./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 647186f77af479db589ba9ca6b990f259feeb9ca .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 647186f77af479db589ba9ca6b990f259feeb9ca ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:55:06,192 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:55:06,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:55:06,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:55:06,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:55:06,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:55:06,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:55:06,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:55:06,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:55:06,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:55:06,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:55:06,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:55:06,211 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:55:06,212 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:55:06,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:55:06,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:55:06,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:55:06,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:55:06,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:55:06,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:55:06,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:55:06,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:55:06,222 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:55:06,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:55:06,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:55:06,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:55:06,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:55:06,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:55:06,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:55:06,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:55:06,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:55:06,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:55:06,228 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:55:06,229 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:55:06,230 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:55:06,230 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:55:06,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:55:06,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:55:06,231 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:55:06,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:55:06,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:55:06,233 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 19:55:06,245 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:55:06,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:55:06,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:55:06,246 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:55:06,246 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:55:06,246 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:55:06,246 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:55:06,246 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:55:06,246 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:55:06,247 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:55:06,247 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:55:06,247 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:55:06,247 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:55:06,247 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:55:06,247 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:55:06,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:55:06,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:55:06,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:55:06,248 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:55:06,248 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:55:06,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:55:06,249 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:55:06,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:55:06,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:55:06,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:55:06,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:55:06,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:55:06,250 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:55:06,250 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:55:06,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:55:06,250 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:55:06,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:55:06,251 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647186f77af479db589ba9ca6b990f259feeb9ca [2019-12-07 19:55:06,351 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:55:06,360 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:55:06,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:55:06,363 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:55:06,364 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:55:06,364 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-12-07 19:55:06,403 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/fd3514dfe/86b617c5f5724834a283beb1a4c1b566/FLAG2300cae6e [2019-12-07 19:55:06,868 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:55:06,868 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-12-07 19:55:06,878 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/fd3514dfe/86b617c5f5724834a283beb1a4c1b566/FLAG2300cae6e [2019-12-07 19:55:06,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/fd3514dfe/86b617c5f5724834a283beb1a4c1b566 [2019-12-07 19:55:06,892 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:55:06,893 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:55:06,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:55:06,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:55:06,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:55:06,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:55:06" (1/1) ... [2019-12-07 19:55:06,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4afd14cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:06, skipping insertion in model container [2019-12-07 19:55:06,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:55:06" (1/1) ... [2019-12-07 19:55:06,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:55:06,937 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:55:07,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:55:07,155 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:55:07,182 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:55:07,211 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:55:07,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07 WrapperNode [2019-12-07 19:55:07,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:55:07,212 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:55:07,212 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:55:07,212 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:55:07,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:55:07,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:55:07,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:55:07,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:55:07,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... [2019-12-07 19:55:07,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:55:07,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:55:07,266 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:55:07,266 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:55:07,266 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:55:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 19:55:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:55:07,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:55:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:55:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:55:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:55:07,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:55:07,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:55:07,635 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:55:07,635 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 19:55:07,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:07 BoogieIcfgContainer [2019-12-07 19:55:07,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:55:07,636 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:55:07,636 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:55:07,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:55:07,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:55:06" (1/3) ... [2019-12-07 19:55:07,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330e94b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:55:07, skipping insertion in model container [2019-12-07 19:55:07,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:07" (2/3) ... [2019-12-07 19:55:07,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@330e94b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:55:07, skipping insertion in model container [2019-12-07 19:55:07,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:07" (3/3) ... [2019-12-07 19:55:07,640 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-12-07 19:55:07,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:55:07,652 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-12-07 19:55:07,659 INFO L249 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-12-07 19:55:07,671 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:55:07,671 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:55:07,672 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:55:07,672 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:55:07,672 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:55:07,672 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:55:07,672 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:55:07,672 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:55:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2019-12-07 19:55:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 19:55:07,688 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:07,688 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 19:55:07,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:07,693 INFO L82 PathProgramCache]: Analyzing trace with hash 7320, now seen corresponding path program 1 times [2019-12-07 19:55:07,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:07,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362331055] [2019-12-07 19:55:07,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:07,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:07,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362331055] [2019-12-07 19:55:07,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:07,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:55:07,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030903876] [2019-12-07 19:55:07,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:55:07,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:55:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:07,805 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 3 states. [2019-12-07 19:55:07,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:07,890 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2019-12-07 19:55:07,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:07,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 19:55:07,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:07,898 INFO L225 Difference]: With dead ends: 104 [2019-12-07 19:55:07,898 INFO L226 Difference]: Without dead ends: 103 [2019-12-07 19:55:07,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-12-07 19:55:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2019-12-07 19:55:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 19:55:07,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2019-12-07 19:55:07,925 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 2 [2019-12-07 19:55:07,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:07,925 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2019-12-07 19:55:07,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:55:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2019-12-07 19:55:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 19:55:07,926 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:07,926 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 19:55:07,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:07,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:07,927 INFO L82 PathProgramCache]: Analyzing trace with hash 7321, now seen corresponding path program 1 times [2019-12-07 19:55:07,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:07,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378016005] [2019-12-07 19:55:07,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:07,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:07,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378016005] [2019-12-07 19:55:07,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:07,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:55:07,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974734410] [2019-12-07 19:55:07,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:55:07,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:07,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:55:07,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:07,951 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 3 states. [2019-12-07 19:55:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:08,009 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2019-12-07 19:55:08,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:08,010 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 19:55:08,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:08,011 INFO L225 Difference]: With dead ends: 100 [2019-12-07 19:55:08,011 INFO L226 Difference]: Without dead ends: 100 [2019-12-07 19:55:08,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:08,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-12-07 19:55:08,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 88. [2019-12-07 19:55:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-12-07 19:55:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2019-12-07 19:55:08,017 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 2 [2019-12-07 19:55:08,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:08,017 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2019-12-07 19:55:08,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:55:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2019-12-07 19:55:08,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:55:08,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:08,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:08,018 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:08,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:08,018 INFO L82 PathProgramCache]: Analyzing trace with hash -904856850, now seen corresponding path program 1 times [2019-12-07 19:55:08,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:08,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690734566] [2019-12-07 19:55:08,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:08,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:08,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690734566] [2019-12-07 19:55:08,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:08,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:55:08,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77176107] [2019-12-07 19:55:08,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:08,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:08,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:08,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:08,058 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 4 states. [2019-12-07 19:55:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:08,151 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2019-12-07 19:55:08,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:08,152 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 19:55:08,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:08,152 INFO L225 Difference]: With dead ends: 85 [2019-12-07 19:55:08,152 INFO L226 Difference]: Without dead ends: 85 [2019-12-07 19:55:08,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:08,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-12-07 19:55:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2019-12-07 19:55:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 19:55:08,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2019-12-07 19:55:08,157 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 7 [2019-12-07 19:55:08,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:08,158 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2019-12-07 19:55:08,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2019-12-07 19:55:08,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 19:55:08,158 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:08,158 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:08,158 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:08,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:08,159 INFO L82 PathProgramCache]: Analyzing trace with hash -904856849, now seen corresponding path program 1 times [2019-12-07 19:55:08,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:08,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947160881] [2019-12-07 19:55:08,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:08,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947160881] [2019-12-07 19:55:08,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:08,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:55:08,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843656414] [2019-12-07 19:55:08,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:08,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:08,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:08,201 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand 4 states. [2019-12-07 19:55:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:08,290 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2019-12-07 19:55:08,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:55:08,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 19:55:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:08,291 INFO L225 Difference]: With dead ends: 97 [2019-12-07 19:55:08,292 INFO L226 Difference]: Without dead ends: 97 [2019-12-07 19:55:08,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-12-07 19:55:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 83. [2019-12-07 19:55:08,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 19:55:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 92 transitions. [2019-12-07 19:55:08,297 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 92 transitions. Word has length 7 [2019-12-07 19:55:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:08,298 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 92 transitions. [2019-12-07 19:55:08,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 92 transitions. [2019-12-07 19:55:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:55:08,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:08,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:08,299 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:08,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1984036300, now seen corresponding path program 1 times [2019-12-07 19:55:08,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:08,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866477608] [2019-12-07 19:55:08,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:08,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866477608] [2019-12-07 19:55:08,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:08,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:55:08,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84492861] [2019-12-07 19:55:08,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:08,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:08,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:08,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:08,338 INFO L87 Difference]: Start difference. First operand 83 states and 92 transitions. Second operand 5 states. [2019-12-07 19:55:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:08,497 INFO L93 Difference]: Finished difference Result 127 states and 138 transitions. [2019-12-07 19:55:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:08,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 19:55:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:08,498 INFO L225 Difference]: With dead ends: 127 [2019-12-07 19:55:08,499 INFO L226 Difference]: Without dead ends: 127 [2019-12-07 19:55:08,499 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:08,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-12-07 19:55:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 82. [2019-12-07 19:55:08,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 19:55:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2019-12-07 19:55:08,506 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 9 [2019-12-07 19:55:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:08,506 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2019-12-07 19:55:08,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2019-12-07 19:55:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 19:55:08,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:08,507 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:08,508 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1984036299, now seen corresponding path program 1 times [2019-12-07 19:55:08,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:08,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470809172] [2019-12-07 19:55:08,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:08,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:08,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470809172] [2019-12-07 19:55:08,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:08,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:55:08,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657509787] [2019-12-07 19:55:08,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:08,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:08,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:08,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:08,559 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand 5 states. [2019-12-07 19:55:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:08,723 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2019-12-07 19:55:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:08,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-12-07 19:55:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:08,724 INFO L225 Difference]: With dead ends: 128 [2019-12-07 19:55:08,725 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 19:55:08,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 19:55:08,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 81. [2019-12-07 19:55:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-12-07 19:55:08,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2019-12-07 19:55:08,731 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 9 [2019-12-07 19:55:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:08,732 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2019-12-07 19:55:08,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:08,732 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2019-12-07 19:55:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:55:08,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:08,732 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:08,733 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:08,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:08,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1375489782, now seen corresponding path program 1 times [2019-12-07 19:55:08,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:08,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776099709] [2019-12-07 19:55:08,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:08,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776099709] [2019-12-07 19:55:08,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:08,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:55:08,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291337625] [2019-12-07 19:55:08,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:55:08,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:08,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:55:08,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:08,834 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 7 states. [2019-12-07 19:55:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:08,994 INFO L93 Difference]: Finished difference Result 156 states and 167 transitions. [2019-12-07 19:55:08,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:55:08,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 19:55:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:08,995 INFO L225 Difference]: With dead ends: 156 [2019-12-07 19:55:08,995 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 19:55:08,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:55:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 19:55:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 83. [2019-12-07 19:55:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-12-07 19:55:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2019-12-07 19:55:08,999 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 10 [2019-12-07 19:55:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:08,999 INFO L462 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2019-12-07 19:55:08,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:55:08,999 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2019-12-07 19:55:08,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:55:08,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:08,999 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:09,000 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:09,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:09,000 INFO L82 PathProgramCache]: Analyzing trace with hash 309493891, now seen corresponding path program 1 times [2019-12-07 19:55:09,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:09,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568647092] [2019-12-07 19:55:09,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:09,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568647092] [2019-12-07 19:55:09,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:09,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:09,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470591786] [2019-12-07 19:55:09,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:55:09,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:55:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:09,098 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 7 states. [2019-12-07 19:55:09,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:09,337 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2019-12-07 19:55:09,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:55:09,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-07 19:55:09,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:09,338 INFO L225 Difference]: With dead ends: 152 [2019-12-07 19:55:09,338 INFO L226 Difference]: Without dead ends: 152 [2019-12-07 19:55:09,338 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:55:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-12-07 19:55:09,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 112. [2019-12-07 19:55:09,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 19:55:09,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions. [2019-12-07 19:55:09,343 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 142 transitions. Word has length 11 [2019-12-07 19:55:09,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:09,343 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 142 transitions. [2019-12-07 19:55:09,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:55:09,343 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2019-12-07 19:55:09,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:55:09,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:09,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:09,344 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash 309493890, now seen corresponding path program 1 times [2019-12-07 19:55:09,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:09,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080943244] [2019-12-07 19:55:09,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:09,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080943244] [2019-12-07 19:55:09,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:09,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:09,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975151790] [2019-12-07 19:55:09,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:55:09,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:09,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:55:09,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:09,409 INFO L87 Difference]: Start difference. First operand 112 states and 142 transitions. Second operand 7 states. [2019-12-07 19:55:09,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:09,601 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-12-07 19:55:09,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:55:09,602 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-12-07 19:55:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:09,602 INFO L225 Difference]: With dead ends: 129 [2019-12-07 19:55:09,603 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 19:55:09,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:55:09,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 19:55:09,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2019-12-07 19:55:09,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 19:55:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 140 transitions. [2019-12-07 19:55:09,606 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 140 transitions. Word has length 11 [2019-12-07 19:55:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:09,606 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 140 transitions. [2019-12-07 19:55:09,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:55:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 140 transitions. [2019-12-07 19:55:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:55:09,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:09,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:09,607 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:09,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:09,607 INFO L82 PathProgramCache]: Analyzing trace with hash 306779519, now seen corresponding path program 1 times [2019-12-07 19:55:09,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:09,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987314219] [2019-12-07 19:55:09,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:09,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987314219] [2019-12-07 19:55:09,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:09,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:55:09,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974232857] [2019-12-07 19:55:09,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:09,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:09,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:09,668 INFO L87 Difference]: Start difference. First operand 112 states and 140 transitions. Second operand 8 states. [2019-12-07 19:55:09,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:09,887 INFO L93 Difference]: Finished difference Result 120 states and 149 transitions. [2019-12-07 19:55:09,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:55:09,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-12-07 19:55:09,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:09,888 INFO L225 Difference]: With dead ends: 120 [2019-12-07 19:55:09,888 INFO L226 Difference]: Without dead ends: 120 [2019-12-07 19:55:09,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:55:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-12-07 19:55:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2019-12-07 19:55:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 19:55:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 139 transitions. [2019-12-07 19:55:09,891 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 139 transitions. Word has length 11 [2019-12-07 19:55:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:09,891 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 139 transitions. [2019-12-07 19:55:09,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:09,891 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 139 transitions. [2019-12-07 19:55:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:55:09,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:09,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:09,892 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash 306779520, now seen corresponding path program 1 times [2019-12-07 19:55:09,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:09,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660372780] [2019-12-07 19:55:09,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:09,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:09,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660372780] [2019-12-07 19:55:09,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:09,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:55:09,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825320223] [2019-12-07 19:55:09,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:55:09,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:09,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:55:09,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:55:09,958 INFO L87 Difference]: Start difference. First operand 111 states and 139 transitions. Second operand 9 states. [2019-12-07 19:55:10,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:10,287 INFO L93 Difference]: Finished difference Result 114 states and 143 transitions. [2019-12-07 19:55:10,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 19:55:10,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-12-07 19:55:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:10,288 INFO L225 Difference]: With dead ends: 114 [2019-12-07 19:55:10,288 INFO L226 Difference]: Without dead ends: 114 [2019-12-07 19:55:10,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-12-07 19:55:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-12-07 19:55:10,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 101. [2019-12-07 19:55:10,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 19:55:10,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2019-12-07 19:55:10,291 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 11 [2019-12-07 19:55:10,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:10,291 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2019-12-07 19:55:10,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:55:10,291 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2019-12-07 19:55:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:55:10,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:10,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:10,291 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:10,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:10,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1162221000, now seen corresponding path program 1 times [2019-12-07 19:55:10,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:10,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468002521] [2019-12-07 19:55:10,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:10,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468002521] [2019-12-07 19:55:10,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:10,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:55:10,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195103227] [2019-12-07 19:55:10,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:10,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:10,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:10,380 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand 8 states. [2019-12-07 19:55:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:10,648 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2019-12-07 19:55:10,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:55:10,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-07 19:55:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:10,649 INFO L225 Difference]: With dead ends: 125 [2019-12-07 19:55:10,649 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 19:55:10,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:55:10,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 19:55:10,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2019-12-07 19:55:10,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 19:55:10,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2019-12-07 19:55:10,651 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 14 [2019-12-07 19:55:10,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:10,651 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2019-12-07 19:55:10,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:10,651 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2019-12-07 19:55:10,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:55:10,652 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:10,652 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:10,652 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:10,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:10,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1162220999, now seen corresponding path program 1 times [2019-12-07 19:55:10,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:10,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306615576] [2019-12-07 19:55:10,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:10,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306615576] [2019-12-07 19:55:10,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:10,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:10,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820161478] [2019-12-07 19:55:10,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:55:10,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:10,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:55:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:10,743 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 7 states. [2019-12-07 19:55:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:10,928 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2019-12-07 19:55:10,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:55:10,928 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-07 19:55:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:10,929 INFO L225 Difference]: With dead ends: 135 [2019-12-07 19:55:10,929 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 19:55:10,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:55:10,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 19:55:10,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 101. [2019-12-07 19:55:10,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-12-07 19:55:10,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2019-12-07 19:55:10,931 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 14 [2019-12-07 19:55:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:10,931 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2019-12-07 19:55:10,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:55:10,932 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2019-12-07 19:55:10,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:55:10,932 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:10,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:10,932 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:10,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:10,932 INFO L82 PathProgramCache]: Analyzing trace with hash -30789524, now seen corresponding path program 1 times [2019-12-07 19:55:10,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:10,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079615055] [2019-12-07 19:55:10,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:10,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:10,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079615055] [2019-12-07 19:55:10,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:10,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:55:10,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221285679] [2019-12-07 19:55:10,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:55:10,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:10,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:55:10,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:55:10,988 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 9 states. [2019-12-07 19:55:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:11,186 INFO L93 Difference]: Finished difference Result 129 states and 160 transitions. [2019-12-07 19:55:11,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:55:11,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-12-07 19:55:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:11,187 INFO L225 Difference]: With dead ends: 129 [2019-12-07 19:55:11,187 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 19:55:11,187 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:55:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 19:55:11,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-12-07 19:55:11,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-12-07 19:55:11,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 140 transitions. [2019-12-07 19:55:11,190 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 140 transitions. Word has length 15 [2019-12-07 19:55:11,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:11,190 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 140 transitions. [2019-12-07 19:55:11,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:55:11,190 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 140 transitions. [2019-12-07 19:55:11,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:55:11,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:11,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:11,191 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:11,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:11,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1971558910, now seen corresponding path program 1 times [2019-12-07 19:55:11,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:11,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733256648] [2019-12-07 19:55:11,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:11,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733256648] [2019-12-07 19:55:11,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:11,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:11,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84932496] [2019-12-07 19:55:11,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:55:11,263 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:55:11,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:11,264 INFO L87 Difference]: Start difference. First operand 111 states and 140 transitions. Second operand 7 states. [2019-12-07 19:55:11,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:11,441 INFO L93 Difference]: Finished difference Result 143 states and 157 transitions. [2019-12-07 19:55:11,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:55:11,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-12-07 19:55:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:11,442 INFO L225 Difference]: With dead ends: 143 [2019-12-07 19:55:11,442 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 19:55:11,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:55:11,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 19:55:11,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 112. [2019-12-07 19:55:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-12-07 19:55:11,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 141 transitions. [2019-12-07 19:55:11,449 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 141 transitions. Word has length 17 [2019-12-07 19:55:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:11,449 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 141 transitions. [2019-12-07 19:55:11,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:55:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 141 transitions. [2019-12-07 19:55:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:55:11,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:11,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:11,451 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:11,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:11,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1991865479, now seen corresponding path program 1 times [2019-12-07 19:55:11,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:11,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068638235] [2019-12-07 19:55:11,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:11,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:11,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068638235] [2019-12-07 19:55:11,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:11,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:55:11,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515088927] [2019-12-07 19:55:11,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:55:11,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:11,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:55:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:11,467 INFO L87 Difference]: Start difference. First operand 112 states and 141 transitions. Second operand 3 states. [2019-12-07 19:55:11,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:11,473 INFO L93 Difference]: Finished difference Result 115 states and 144 transitions. [2019-12-07 19:55:11,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:11,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 19:55:11,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:11,474 INFO L225 Difference]: With dead ends: 115 [2019-12-07 19:55:11,474 INFO L226 Difference]: Without dead ends: 115 [2019-12-07 19:55:11,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-12-07 19:55:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-12-07 19:55:11,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-12-07 19:55:11,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2019-12-07 19:55:11,476 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 17 [2019-12-07 19:55:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:11,477 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2019-12-07 19:55:11,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:55:11,477 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2019-12-07 19:55:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:55:11,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:11,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:11,478 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:11,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:11,478 INFO L82 PathProgramCache]: Analyzing trace with hash -988710191, now seen corresponding path program 1 times [2019-12-07 19:55:11,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:11,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592710840] [2019-12-07 19:55:11,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:11,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592710840] [2019-12-07 19:55:11,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:11,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:55:11,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168373605] [2019-12-07 19:55:11,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:11,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:11,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:11,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:11,547 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand 8 states. [2019-12-07 19:55:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:11,680 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2019-12-07 19:55:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:55:11,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 19:55:11,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:11,681 INFO L225 Difference]: With dead ends: 148 [2019-12-07 19:55:11,681 INFO L226 Difference]: Without dead ends: 148 [2019-12-07 19:55:11,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:55:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-12-07 19:55:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 116. [2019-12-07 19:55:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 19:55:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2019-12-07 19:55:11,684 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 18 [2019-12-07 19:55:11,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:11,684 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2019-12-07 19:55:11,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:11,684 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2019-12-07 19:55:11,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:55:11,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:11,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:11,685 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:11,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:11,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1618240817, now seen corresponding path program 1 times [2019-12-07 19:55:11,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:11,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646208138] [2019-12-07 19:55:11,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:11,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646208138] [2019-12-07 19:55:11,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:11,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:55:11,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063172640] [2019-12-07 19:55:11,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:11,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:11,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:11,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:11,756 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand 8 states. [2019-12-07 19:55:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:12,135 INFO L93 Difference]: Finished difference Result 135 states and 149 transitions. [2019-12-07 19:55:12,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:55:12,136 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-12-07 19:55:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:12,137 INFO L225 Difference]: With dead ends: 135 [2019-12-07 19:55:12,137 INFO L226 Difference]: Without dead ends: 135 [2019-12-07 19:55:12,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:55:12,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-12-07 19:55:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 116. [2019-12-07 19:55:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 19:55:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 144 transitions. [2019-12-07 19:55:12,142 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 144 transitions. Word has length 18 [2019-12-07 19:55:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:12,142 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 144 transitions. [2019-12-07 19:55:12,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:12,143 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2019-12-07 19:55:12,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:55:12,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:12,144 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:12,144 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:12,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1618240816, now seen corresponding path program 1 times [2019-12-07 19:55:12,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:12,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147378519] [2019-12-07 19:55:12,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:12,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:12,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147378519] [2019-12-07 19:55:12,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:12,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 19:55:12,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77060166] [2019-12-07 19:55:12,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 19:55:12,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 19:55:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:12,237 INFO L87 Difference]: Start difference. First operand 116 states and 144 transitions. Second operand 7 states. [2019-12-07 19:55:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:12,421 INFO L93 Difference]: Finished difference Result 145 states and 159 transitions. [2019-12-07 19:55:12,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:55:12,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-07 19:55:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:12,423 INFO L225 Difference]: With dead ends: 145 [2019-12-07 19:55:12,423 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 19:55:12,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:55:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 19:55:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2019-12-07 19:55:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-12-07 19:55:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 143 transitions. [2019-12-07 19:55:12,425 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 143 transitions. Word has length 18 [2019-12-07 19:55:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:12,425 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 143 transitions. [2019-12-07 19:55:12,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 19:55:12,425 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 143 transitions. [2019-12-07 19:55:12,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 19:55:12,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:12,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:12,426 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:12,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:12,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1372963156, now seen corresponding path program 1 times [2019-12-07 19:55:12,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:12,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996518948] [2019-12-07 19:55:12,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:12,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:12,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996518948] [2019-12-07 19:55:12,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:12,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:55:12,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341522897] [2019-12-07 19:55:12,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:55:12,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:12,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:55:12,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:12,438 INFO L87 Difference]: Start difference. First operand 116 states and 143 transitions. Second operand 3 states. [2019-12-07 19:55:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:12,448 INFO L93 Difference]: Finished difference Result 180 states and 209 transitions. [2019-12-07 19:55:12,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:12,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 19:55:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:12,451 INFO L225 Difference]: With dead ends: 180 [2019-12-07 19:55:12,451 INFO L226 Difference]: Without dead ends: 180 [2019-12-07 19:55:12,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:12,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-12-07 19:55:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 129. [2019-12-07 19:55:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 19:55:12,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 157 transitions. [2019-12-07 19:55:12,454 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 157 transitions. Word has length 18 [2019-12-07 19:55:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:12,454 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 157 transitions. [2019-12-07 19:55:12,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:55:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 157 transitions. [2019-12-07 19:55:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:55:12,455 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:12,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:12,455 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:12,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash -587527611, now seen corresponding path program 1 times [2019-12-07 19:55:12,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:12,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113041252] [2019-12-07 19:55:12,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:12,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:12,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113041252] [2019-12-07 19:55:12,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:12,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:55:12,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670192438] [2019-12-07 19:55:12,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:12,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:12,563 INFO L87 Difference]: Start difference. First operand 129 states and 157 transitions. Second operand 8 states. [2019-12-07 19:55:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:12,705 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2019-12-07 19:55:12,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:55:12,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-12-07 19:55:12,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:12,707 INFO L225 Difference]: With dead ends: 133 [2019-12-07 19:55:12,707 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 19:55:12,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-07 19:55:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 19:55:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2019-12-07 19:55:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 19:55:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 146 transitions. [2019-12-07 19:55:12,710 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 146 transitions. Word has length 19 [2019-12-07 19:55:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:12,710 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 146 transitions. [2019-12-07 19:55:12,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 146 transitions. [2019-12-07 19:55:12,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:55:12,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:12,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:12,711 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:12,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:12,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1372821303, now seen corresponding path program 1 times [2019-12-07 19:55:12,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:12,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349867888] [2019-12-07 19:55:12,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:12,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349867888] [2019-12-07 19:55:12,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687797149] [2019-12-07 19:55:12,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:12,838 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 19:55:12,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:12,898 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-12-07 19:55:12,899 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:12,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:12,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-12-07 19:55:12,906 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:12,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:12,910 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:12,910 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-12-07 19:55:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:12,921 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:12,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:12,935 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:12,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2019-12-07 19:55:12,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:12,939 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:55:12,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 19:55:12,942 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:12,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:12,952 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-12-07 19:55:12,952 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:55, output treesize:41 [2019-12-07 19:55:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:12,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:55:12,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [5] total 10 [2019-12-07 19:55:12,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777838575] [2019-12-07 19:55:12,974 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:55:12,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:55:12,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:55:12,975 INFO L87 Difference]: Start difference. First operand 121 states and 146 transitions. Second operand 6 states. [2019-12-07 19:55:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:13,107 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2019-12-07 19:55:13,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:55:13,107 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-07 19:55:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:13,108 INFO L225 Difference]: With dead ends: 123 [2019-12-07 19:55:13,108 INFO L226 Difference]: Without dead ends: 123 [2019-12-07 19:55:13,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:55:13,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-12-07 19:55:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-12-07 19:55:13,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 19:55:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 145 transitions. [2019-12-07 19:55:13,110 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 145 transitions. Word has length 19 [2019-12-07 19:55:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:13,111 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 145 transitions. [2019-12-07 19:55:13,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:55:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 145 transitions. [2019-12-07 19:55:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 19:55:13,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:13,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:13,312 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:13,313 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:13,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:13,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1372821302, now seen corresponding path program 1 times [2019-12-07 19:55:13,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:13,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101982137] [2019-12-07 19:55:13,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:13,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101982137] [2019-12-07 19:55:13,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573440719] [2019-12-07 19:55:13,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:13,451 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:55:13,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:13,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 19:55:13,463 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:13,464 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:13,464 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:13,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-12-07 19:55:13,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:13,465 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:13,472 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:13,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-12-07 19:55:13,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:13,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:13,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:13,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:13,474 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-12-07 19:55:13,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:13,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:55:13,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6] total 8 [2019-12-07 19:55:13,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261999391] [2019-12-07 19:55:13,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:13,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:13,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:55:13,476 INFO L87 Difference]: Start difference. First operand 121 states and 145 transitions. Second operand 5 states. [2019-12-07 19:55:13,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:13,561 INFO L93 Difference]: Finished difference Result 121 states and 143 transitions. [2019-12-07 19:55:13,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:55:13,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 19:55:13,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:13,562 INFO L225 Difference]: With dead ends: 121 [2019-12-07 19:55:13,562 INFO L226 Difference]: Without dead ends: 121 [2019-12-07 19:55:13,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:55:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-12-07 19:55:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-12-07 19:55:13,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-12-07 19:55:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2019-12-07 19:55:13,565 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 19 [2019-12-07 19:55:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:13,565 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2019-12-07 19:55:13,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:13,565 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2019-12-07 19:55:13,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:55:13,566 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:13,566 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:13,766 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:13,767 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:13,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:13,768 INFO L82 PathProgramCache]: Analyzing trace with hash -351192042, now seen corresponding path program 1 times [2019-12-07 19:55:13,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:13,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456202802] [2019-12-07 19:55:13,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:13,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:13,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456202802] [2019-12-07 19:55:13,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:13,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 19:55:13,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360512780] [2019-12-07 19:55:13,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:55:13,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:13,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:55:13,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:55:13,923 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand 9 states. [2019-12-07 19:55:14,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:14,159 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2019-12-07 19:55:14,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:55:14,159 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2019-12-07 19:55:14,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:14,159 INFO L225 Difference]: With dead ends: 128 [2019-12-07 19:55:14,160 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 19:55:14,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:55:14,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 19:55:14,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2019-12-07 19:55:14,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-12-07 19:55:14,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2019-12-07 19:55:14,162 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 20 [2019-12-07 19:55:14,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:14,162 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2019-12-07 19:55:14,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:55:14,162 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2019-12-07 19:55:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:55:14,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:14,162 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:14,162 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:14,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:14,163 INFO L82 PathProgramCache]: Analyzing trace with hash 726314139, now seen corresponding path program 1 times [2019-12-07 19:55:14,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:14,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437800650] [2019-12-07 19:55:14,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:14,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437800650] [2019-12-07 19:55:14,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130906458] [2019-12-07 19:55:14,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:14,273 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 19:55:14,274 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:14,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-12-07 19:55:14,310 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,314 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-12-07 19:55:14,315 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,316 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2019-12-07 19:55:14,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 19:55:14,327 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,328 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,328 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,328 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 19:55:14,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:14,337 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:14,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:14,359 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2019-12-07 19:55:14,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:55:14,360 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:55:14,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,364 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 19:55:14,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2019-12-07 19:55:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:14,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 19:55:14,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [6] total 14 [2019-12-07 19:55:14,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268854042] [2019-12-07 19:55:14,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:14,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:14,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:14,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:55:14,372 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand 8 states. [2019-12-07 19:55:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:14,527 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2019-12-07 19:55:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 19:55:14,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-12-07 19:55:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:14,528 INFO L225 Difference]: With dead ends: 133 [2019-12-07 19:55:14,528 INFO L226 Difference]: Without dead ends: 128 [2019-12-07 19:55:14,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 19:55:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-12-07 19:55:14,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2019-12-07 19:55:14,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-12-07 19:55:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2019-12-07 19:55:14,530 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 21 [2019-12-07 19:55:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:14,530 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2019-12-07 19:55:14,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:14,531 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2019-12-07 19:55:14,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 19:55:14,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:14,531 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:14,731 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:14,732 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:14,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:14,732 INFO L82 PathProgramCache]: Analyzing trace with hash -486789161, now seen corresponding path program 1 times [2019-12-07 19:55:14,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:55:14,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630055749] [2019-12-07 19:55:14,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:55:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:14,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:14,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630055749] [2019-12-07 19:55:14,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217491808] [2019-12-07 19:55:14,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:14,884 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 19:55:14,885 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:14,896 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,896 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:55:14,897 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,905 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,905 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-12-07 19:55:14,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:14,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:14,944 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:14,945 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-12-07 19:55:15,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:15,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 56 [2019-12-07 19:55:15,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:55:15,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:15,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:15,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 19:55:15,037 INFO L614 ElimStorePlain]: treesize reduction 133, result has 21.3 percent of original size [2019-12-07 19:55:15,037 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:15,037 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 19:55:15,109 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:15,110 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 109 [2019-12-07 19:55:15,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:15,132 INFO L614 ElimStorePlain]: treesize reduction 46, result has 41.0 percent of original size [2019-12-07 19:55:15,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:15,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:32 [2019-12-07 19:55:17,160 WARN L192 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-12-07 19:55:17,179 INFO L343 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-12-07 19:55:17,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-12-07 19:55:17,180 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:17,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:17,189 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:17,189 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-12-07 19:55:21,248 INFO L343 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-12-07 19:55:21,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78 [2019-12-07 19:55:21,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:21,249 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:21,258 INFO L614 ElimStorePlain]: treesize reduction 32, result has 46.7 percent of original size [2019-12-07 19:55:21,259 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:21,259 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28 [2019-12-07 19:55:21,283 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:21,283 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30 [2019-12-07 19:55:21,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:21,286 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:21,286 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:21,286 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4 [2019-12-07 19:55:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:21,289 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:21,294 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:21,296 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:21,296 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:21,297 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-12-07 19:55:21,317 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:21,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:21,319 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:21,319 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-12-07 19:55:25,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 366 treesize of output 358 [2019-12-07 19:55:25,635 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:55:25,768 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 30 [2019-12-07 19:55:25,768 INFO L614 ElimStorePlain]: treesize reduction 292, result has 15.6 percent of original size [2019-12-07 19:55:25,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:25,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:25,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-12-07 19:55:25,770 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:15 [2019-12-07 19:55:25,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 19:55:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:25,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1527837360] [2019-12-07 19:55:25,857 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2019-12-07 19:55:25,857 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 19:55:25,862 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 19:55:25,868 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 19:55:25,868 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 19:55:26,180 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,204 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,280 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,297 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,744 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,758 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,774 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,789 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,803 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,817 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,829 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,840 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,849 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:26,883 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:27,055 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 19:55:27,473 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-12-07 19:55:27,828 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-12-07 19:55:28,061 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f6d3271 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:91) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:555) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:428) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:234) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.quantifier(PartialQuantifierElimination.java:146) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:279) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:116) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 19:55:28,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 19:55:28,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 11] total 25 [2019-12-07 19:55:28,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381978590] [2019-12-07 19:55:28,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 19:55:28,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:55:28,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 19:55:28,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=501, Unknown=4, NotChecked=0, Total=600 [2019-12-07 19:55:28,064 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 25 states. [2019-12-07 19:55:28,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 19:55:28,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:55:28,265 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f6d3271 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 19:55:28,267 INFO L168 Benchmark]: Toolchain (without parser) took 21373.90 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 251.1 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -84.7 MB). Peak memory consumption was 166.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:28,267 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:55:28,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:28,267 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:55:28,268 INFO L168 Benchmark]: Boogie Preprocessor took 21.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:28,268 INFO L168 Benchmark]: RCFGBuilder took 370.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:28,268 INFO L168 Benchmark]: TraceAbstraction took 20629.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.8 MB). Peak memory consumption was 156.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:55:28,269 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 317.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 370.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20629.77 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 120.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 35.8 MB). Peak memory consumption was 156.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f6d3271 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4f6d3271: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 19:55:29,599 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:55:29,600 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:55:29,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:55:29,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:55:29,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:55:29,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:55:29,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:55:29,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:55:29,613 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:55:29,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:55:29,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:55:29,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:55:29,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:55:29,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:55:29,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:55:29,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:55:29,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:55:29,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:55:29,621 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:55:29,622 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:55:29,622 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:55:29,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:55:29,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:55:29,625 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:55:29,626 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:55:29,626 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:55:29,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:55:29,627 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:55:29,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:55:29,628 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:55:29,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:55:29,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:55:29,629 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:55:29,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:55:29,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:55:29,630 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:55:29,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:55:29,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:55:29,631 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:55:29,632 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:55:29,632 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 19:55:29,642 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:55:29,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:55:29,643 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:55:29,643 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:55:29,643 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:55:29,643 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:55:29,644 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:55:29,644 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:55:29,644 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:55:29,644 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:55:29,644 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:55:29,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 19:55:29,645 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 19:55:29,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:55:29,646 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:55:29,646 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 19:55:29,646 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 19:55:29,646 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:55:29,646 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:55:29,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:55:29,647 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:55:29,647 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:55:29,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:55:29,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:55:29,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:55:29,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:55:29,647 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 19:55:29,647 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 19:55:29,648 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:55:29,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:55:29,648 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647186f77af479db589ba9ca6b990f259feeb9ca [2019-12-07 19:55:29,810 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:55:29,821 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:55:29,824 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:55:29,825 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:55:29,826 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:55:29,826 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/../../sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-12-07 19:55:29,874 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/954072d87/469e0c48ee044b15af3ba3adf2c38d5a/FLAGf0f5c469b [2019-12-07 19:55:30,242 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:55:30,242 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-12-07 19:55:30,250 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/954072d87/469e0c48ee044b15af3ba3adf2c38d5a/FLAGf0f5c469b [2019-12-07 19:55:30,636 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/data/954072d87/469e0c48ee044b15af3ba3adf2c38d5a [2019-12-07 19:55:30,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:55:30,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:55:30,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:55:30,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:55:30,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:55:30,642 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:30,644 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231d58f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30, skipping insertion in model container [2019-12-07 19:55:30,644 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:30,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:55:30,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:55:30,844 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:55:30,913 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:55:30,942 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:55:30,975 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:55:30,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30 WrapperNode [2019-12-07 19:55:30,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:55:30,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:55:30,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:55:30,976 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:55:30,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:30,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,009 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:55:31,009 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:55:31,009 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:55:31,009 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:55:31,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,018 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,018 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... [2019-12-07 19:55:31,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:55:31,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:55:31,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:55:31,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:55:31,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:55:31,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 19:55:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 19:55:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 19:55:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 19:55:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:55:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 19:55:31,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:55:31,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:55:31,467 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:55:31,467 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-12-07 19:55:31,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:31 BoogieIcfgContainer [2019-12-07 19:55:31,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:55:31,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:55:31,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:55:31,471 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:55:31,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:55:30" (1/3) ... [2019-12-07 19:55:31,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1634e7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:55:31, skipping insertion in model container [2019-12-07 19:55:31,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:55:30" (2/3) ... [2019-12-07 19:55:31,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1634e7f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:55:31, skipping insertion in model container [2019-12-07 19:55:31,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:31" (3/3) ... [2019-12-07 19:55:31,473 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-12-07 19:55:31,479 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:55:31,484 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 52 error locations. [2019-12-07 19:55:31,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2019-12-07 19:55:31,504 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:55:31,504 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 19:55:31,504 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:55:31,504 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:55:31,504 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:55:31,504 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:55:31,504 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:55:31,504 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:55:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-12-07 19:55:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:55:31,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:31,522 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:55:31,522 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:31,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:31,526 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-12-07 19:55:31,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:31,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809455207] [2019-12-07 19:55:31,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:31,579 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 19:55:31,583 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:31,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:31,623 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:31,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:31,629 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:31,629 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:55:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:31,636 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:31,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:31,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809455207] [2019-12-07 19:55:31,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:31,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 19:55:31,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618069559] [2019-12-07 19:55:31,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:55:31,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:31,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:55:31,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:31,656 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 3 states. [2019-12-07 19:55:31,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:31,836 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2019-12-07 19:55:31,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:31,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:55:31,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:31,845 INFO L225 Difference]: With dead ends: 114 [2019-12-07 19:55:31,845 INFO L226 Difference]: Without dead ends: 112 [2019-12-07 19:55:31,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:55:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-12-07 19:55:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2019-12-07 19:55:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-12-07 19:55:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-12-07 19:55:31,873 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 3 [2019-12-07 19:55:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:31,874 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-12-07 19:55:31,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:55:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-12-07 19:55:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:55:31,874 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:31,874 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:55:32,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 19:55:32,076 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:32,078 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 19:55:32,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:32,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934507676] [2019-12-07 19:55:32,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:32,150 INFO L264 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 19:55:32,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:32,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:32,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:32,167 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:32,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:32,168 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:55:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:32,176 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:32,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934507676] [2019-12-07 19:55:32,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:32,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 19:55:32,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602678327] [2019-12-07 19:55:32,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:32,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:32,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:32,220 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 4 states. [2019-12-07 19:55:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:32,429 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-12-07 19:55:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:55:32,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 19:55:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:32,431 INFO L225 Difference]: With dead ends: 109 [2019-12-07 19:55:32,431 INFO L226 Difference]: Without dead ends: 109 [2019-12-07 19:55:32,432 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:32,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-12-07 19:55:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2019-12-07 19:55:32,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 19:55:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-12-07 19:55:32,438 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 3 [2019-12-07 19:55:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:32,439 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-12-07 19:55:32,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-12-07 19:55:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:55:32,439 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:32,439 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:32,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 19:55:32,642 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:32,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:32,644 INFO L82 PathProgramCache]: Analyzing trace with hash 59261799, now seen corresponding path program 1 times [2019-12-07 19:55:32,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:32,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1530205849] [2019-12-07 19:55:32,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:32,698 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:55:32,699 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:32,704 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:32,704 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:32,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:32,707 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:32,707 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:55:32,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:32,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:32,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1530205849] [2019-12-07 19:55:32,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:32,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 19:55:32,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577977604] [2019-12-07 19:55:32,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:55:32,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:55:32,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:55:32,720 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 4 states. [2019-12-07 19:55:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:32,936 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-12-07 19:55:32,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:32,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 19:55:32,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:32,937 INFO L225 Difference]: With dead ends: 94 [2019-12-07 19:55:32,937 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 19:55:32,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 19:55:32,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-12-07 19:55:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 19:55:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-12-07 19:55:32,944 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 8 [2019-12-07 19:55:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:32,944 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-12-07 19:55:32,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:55:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-12-07 19:55:32,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 19:55:32,945 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:32,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:33,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 19:55:33,147 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:33,148 INFO L82 PathProgramCache]: Analyzing trace with hash 59261800, now seen corresponding path program 1 times [2019-12-07 19:55:33,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:33,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781145895] [2019-12-07 19:55:33,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:33,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:55:33,216 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:33,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:33,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:33,226 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:33,226 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:33,226 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:55:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:33,241 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:33,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781145895] [2019-12-07 19:55:33,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:33,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-12-07 19:55:33,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96759933] [2019-12-07 19:55:33,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:55:33,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:33,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:55:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:55:33,315 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 6 states. [2019-12-07 19:55:33,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:33,841 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-12-07 19:55:33,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:55:33,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-07 19:55:33,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:33,843 INFO L225 Difference]: With dead ends: 108 [2019-12-07 19:55:33,843 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 19:55:33,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:55:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 19:55:33,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2019-12-07 19:55:33,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-12-07 19:55:33,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2019-12-07 19:55:33,848 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 8 [2019-12-07 19:55:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:33,849 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2019-12-07 19:55:33,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:55:33,849 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2019-12-07 19:55:33,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:55:33,849 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:33,849 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:34,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 19:55:34,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:34,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:34,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1116017678, now seen corresponding path program 1 times [2019-12-07 19:55:34,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:34,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894960230] [2019-12-07 19:55:34,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:34,100 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 19:55:34,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:34,104 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:34,104 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,106 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,106 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,106 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:55:34,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:34,114 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,119 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,119 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,119 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2019-12-07 19:55:34,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 19:55:34,128 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,129 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,130 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:7 [2019-12-07 19:55:34,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:34,135 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:34,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894960230] [2019-12-07 19:55:34,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:34,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 19:55:34,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39065916] [2019-12-07 19:55:34,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:55:34,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:55:34,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:55:34,138 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 5 states. [2019-12-07 19:55:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:34,526 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-12-07 19:55:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:55:34,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-12-07 19:55:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:34,528 INFO L225 Difference]: With dead ends: 141 [2019-12-07 19:55:34,528 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 19:55:34,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:55:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 19:55:34,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 90. [2019-12-07 19:55:34,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-12-07 19:55:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2019-12-07 19:55:34,533 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 10 [2019-12-07 19:55:34,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:34,533 INFO L462 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2019-12-07 19:55:34,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:55:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2019-12-07 19:55:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 19:55:34,534 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:34,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:34,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 19:55:34,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:34,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1116017679, now seen corresponding path program 1 times [2019-12-07 19:55:34,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:34,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454929410] [2019-12-07 19:55:34,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:34,820 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 19:55:34,821 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:34,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:34,826 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:55:34,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:34,844 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:34,857 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,866 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:17 [2019-12-07 19:55:34,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-12-07 19:55:34,881 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,888 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-12-07 19:55:34,891 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,896 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:34,896 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:34,896 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:11 [2019-12-07 19:55:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:34,905 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:35,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:35,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454929410] [2019-12-07 19:55:35,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:35,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 19:55:35,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849204940] [2019-12-07 19:55:35,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:55:35,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:55:35,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:55:35,036 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 8 states. [2019-12-07 19:55:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:36,079 INFO L93 Difference]: Finished difference Result 142 states and 151 transitions. [2019-12-07 19:55:36,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:55:36,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-12-07 19:55:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:36,081 INFO L225 Difference]: With dead ends: 142 [2019-12-07 19:55:36,081 INFO L226 Difference]: Without dead ends: 142 [2019-12-07 19:55:36,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 19:55:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-12-07 19:55:36,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 89. [2019-12-07 19:55:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 19:55:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2019-12-07 19:55:36,085 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 10 [2019-12-07 19:55:36,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:36,085 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2019-12-07 19:55:36,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:55:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2019-12-07 19:55:36,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 19:55:36,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:36,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:36,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 19:55:36,288 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:36,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:36,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1250743926, now seen corresponding path program 1 times [2019-12-07 19:55:36,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:36,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833084918] [2019-12-07 19:55:36,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:36,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:36,400 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 19:55:36,401 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:36,414 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:36,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:36,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-12-07 19:55:36,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:36,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 19:55:36,434 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:36,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,442 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-12-07 19:55:36,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:36,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:36,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:36,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:36,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,469 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:36,469 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2019-12-07 19:55:36,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:36,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:36,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:36,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:36,496 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:36,504 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,504 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:24 [2019-12-07 19:55:36,509 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 19:55:36,510 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:36,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:36,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:4 [2019-12-07 19:55:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:36,525 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:36,543 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:36,547 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:36,548 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:36,548 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-12-07 19:55:36,580 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:36,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:36,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:36,583 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:13 [2019-12-07 19:55:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:36,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833084918] [2019-12-07 19:55:36,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:36,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-12-07 19:55:36,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900057055] [2019-12-07 19:55:36,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:55:36,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:36,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:55:36,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 19:55:36,606 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 11 states. [2019-12-07 19:55:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:37,203 INFO L93 Difference]: Finished difference Result 171 states and 182 transitions. [2019-12-07 19:55:37,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 19:55:37,203 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 12 [2019-12-07 19:55:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:37,205 INFO L225 Difference]: With dead ends: 171 [2019-12-07 19:55:37,205 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 19:55:37,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:55:37,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 19:55:37,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 93. [2019-12-07 19:55:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 19:55:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-12-07 19:55:37,209 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 12 [2019-12-07 19:55:37,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:37,209 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-12-07 19:55:37,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:55:37,209 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-12-07 19:55:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:55:37,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:37,209 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:37,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 19:55:37,411 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:37,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:37,412 INFO L82 PathProgramCache]: Analyzing trace with hash -118351872, now seen corresponding path program 1 times [2019-12-07 19:55:37,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:37,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372031733] [2019-12-07 19:55:37,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:37,482 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 19:55:37,483 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:37,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:37,487 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:37,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,491 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:55:37,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:37,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:37,506 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,506 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2019-12-07 19:55:37,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:37,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 19:55:37,520 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:37,528 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-12-07 19:55:37,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:37,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:37,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:37,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:37,548 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,557 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:37,557 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,557 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-12-07 19:55:37,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:37,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:37,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:37,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:37,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,593 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:37,593 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,593 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-12-07 19:55:37,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 19:55:37,598 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,602 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:37,602 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:37,603 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-12-07 19:55:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:37,616 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:37,632 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:37,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:37,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:37,636 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:19 [2019-12-07 19:55:39,683 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:39,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:39,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:39,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:14 [2019-12-07 19:55:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:39,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372031733] [2019-12-07 19:55:39,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:39,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 10 [2019-12-07 19:55:39,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643756398] [2019-12-07 19:55:39,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 19:55:39,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:39,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 19:55:39,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=75, Unknown=1, NotChecked=0, Total=110 [2019-12-07 19:55:39,712 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 11 states. [2019-12-07 19:55:42,079 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2019-12-07 19:55:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:42,434 INFO L93 Difference]: Finished difference Result 141 states and 152 transitions. [2019-12-07 19:55:42,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:55:42,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 13 [2019-12-07 19:55:42,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:42,435 INFO L225 Difference]: With dead ends: 141 [2019-12-07 19:55:42,435 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 19:55:42,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=96, Invalid=175, Unknown=1, NotChecked=0, Total=272 [2019-12-07 19:55:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 19:55:42,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 95. [2019-12-07 19:55:42,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-12-07 19:55:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2019-12-07 19:55:42,439 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 13 [2019-12-07 19:55:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:42,439 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2019-12-07 19:55:42,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 19:55:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2019-12-07 19:55:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 19:55:42,440 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:42,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:42,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 19:55:42,643 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:42,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:42,644 INFO L82 PathProgramCache]: Analyzing trace with hash -118351871, now seen corresponding path program 1 times [2019-12-07 19:55:42,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:42,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017067888] [2019-12-07 19:55:42,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:42,743 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 19 conjunts are in the unsatisfiable core [2019-12-07 19:55:42,744 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:42,747 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:42,747 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,751 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,752 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:55:42,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:42,762 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,773 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:42,776 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,784 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:25 [2019-12-07 19:55:42,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,802 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 19:55:42,802 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,828 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 19:55:42,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,846 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,846 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,846 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-12-07 19:55:42,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:42,882 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:42,915 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,928 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,929 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,929 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:43 [2019-12-07 19:55:42,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:42,967 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:42,994 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:42,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:55:42,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:55:43,000 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:43,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:43,012 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:43,012 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:81, output treesize:43 [2019-12-07 19:55:43,017 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 19:55:43,017 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:43,026 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:43,029 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 19:55:43,029 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:43,034 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:43,035 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:43,035 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:9 [2019-12-07 19:55:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:43,057 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:43,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:43,200 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:43,207 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:43,249 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:43,253 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:43,257 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:43,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:43,295 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 19:55:43,295 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:71 [2019-12-07 19:55:43,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:43,589 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:43,593 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:43,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:43,632 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:43,634 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:43,647 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:43,647 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 19:55:43,648 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:113, output treesize:51 [2019-12-07 19:55:43,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:43,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017067888] [2019-12-07 19:55:43,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:43,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 12 [2019-12-07 19:55:43,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117868903] [2019-12-07 19:55:43,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 19:55:43,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 19:55:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:55:43,769 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand 13 states. [2019-12-07 19:55:45,548 WARN L192 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-12-07 19:55:46,098 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-12-07 19:55:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:47,265 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2019-12-07 19:55:47,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 19:55:47,267 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-12-07 19:55:47,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:47,268 INFO L225 Difference]: With dead ends: 166 [2019-12-07 19:55:47,268 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 19:55:47,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-12-07 19:55:47,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 19:55:47,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 107. [2019-12-07 19:55:47,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-12-07 19:55:47,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 121 transitions. [2019-12-07 19:55:47,273 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 121 transitions. Word has length 13 [2019-12-07 19:55:47,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:47,273 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 121 transitions. [2019-12-07 19:55:47,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 19:55:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 121 transitions. [2019-12-07 19:55:47,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:55:47,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:47,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:47,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 19:55:47,475 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:47,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:47,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1834952304, now seen corresponding path program 1 times [2019-12-07 19:55:47,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:47,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880052506] [2019-12-07 19:55:47,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:47,572 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 19:55:47,574 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:47,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:47,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:47,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,580 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:55:47,604 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:47,604 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-12-07 19:55:47,605 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,619 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-12-07 19:55:47,620 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,620 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-12-07 19:55:47,633 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:47,633 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,641 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:47,642 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-12-07 19:55:47,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:47,700 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 57 [2019-12-07 19:55:47,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:47,701 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,714 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:47,714 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:47,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2019-12-07 19:55:47,756 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:47,756 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-12-07 19:55:47,756 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:47,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:47,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:47,763 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:17 [2019-12-07 19:55:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:47,798 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:47,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880052506] [2019-12-07 19:55:47,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:47,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 6] imperfect sequences [] total 13 [2019-12-07 19:55:47,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351391489] [2019-12-07 19:55:47,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 19:55:47,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:47,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 19:55:47,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-12-07 19:55:47,889 INFO L87 Difference]: Start difference. First operand 107 states and 121 transitions. Second operand 14 states. [2019-12-07 19:55:49,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:55:49,210 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2019-12-07 19:55:49,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 19:55:49,210 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-12-07 19:55:49,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:55:49,211 INFO L225 Difference]: With dead ends: 159 [2019-12-07 19:55:49,211 INFO L226 Difference]: Without dead ends: 159 [2019-12-07 19:55:49,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=206, Invalid=444, Unknown=0, NotChecked=0, Total=650 [2019-12-07 19:55:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-12-07 19:55:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 106. [2019-12-07 19:55:49,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-12-07 19:55:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-12-07 19:55:49,214 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 14 [2019-12-07 19:55:49,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:55:49,214 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-12-07 19:55:49,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 19:55:49,214 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-12-07 19:55:49,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:55:49,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:55:49,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:55:49,415 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 19:55:49,416 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:55:49,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:55:49,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1834952303, now seen corresponding path program 1 times [2019-12-07 19:55:49,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:55:49,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163831683] [2019-12-07 19:55:49,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 19:55:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:55:49,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 19:55:49,552 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:55:49,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:49,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,558 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,558 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-12-07 19:55:49,564 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_61|], 1=[|v_#valid_74|]} [2019-12-07 19:55:49,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:55:49,567 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,574 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,579 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-12-07 19:55:49,580 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,585 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2019-12-07 19:55:49,602 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:49,602 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,613 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:55:49,616 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,625 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,625 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:25 [2019-12-07 19:55:49,684 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 70 [2019-12-07 19:55:49,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 19:55:49,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:49,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 19:55:49,745 INFO L614 ElimStorePlain]: treesize reduction 62, result has 49.6 percent of original size [2019-12-07 19:55:49,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-12-07 19:55:49,749 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,762 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:55:49,762 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:53 [2019-12-07 19:55:49,809 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,810 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 42 [2019-12-07 19:55:49,810 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,826 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,829 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-12-07 19:55:49,829 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:49,835 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:55:49,835 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2019-12-07 19:55:49,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:49,864 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:55:52,751 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-12-07 19:55:55,217 WARN L192 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 19:55:55,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:55,374 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 19:55:55,374 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:55,381 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:55,868 WARN L192 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-12-07 19:55:55,868 INFO L614 ElimStorePlain]: treesize reduction 59, result has 54.3 percent of original size [2019-12-07 19:55:55,875 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 19:55:55,975 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-12-07 19:55:55,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:55:55,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:55,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 19:55:55,981 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2019-12-07 19:55:55,981 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:133, output treesize:33 [2019-12-07 19:55:56,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:55:56,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163831683] [2019-12-07 19:55:56,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:55:56,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-12-07 19:55:56,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122768161] [2019-12-07 19:55:56,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 19:55:56,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 19:55:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 19:55:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-07 19:55:56,087 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 16 states. [2019-12-07 19:55:57,761 WARN L192 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2019-12-07 19:56:00,058 WARN L192 SmtUtils]: Spent 803.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-07 19:56:02,360 WARN L192 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-07 19:56:03,213 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2019-12-07 19:56:04,437 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2019-12-07 19:56:05,024 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2019-12-07 19:56:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:56:05,069 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2019-12-07 19:56:05,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 19:56:05,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-12-07 19:56:05,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:56:05,070 INFO L225 Difference]: With dead ends: 108 [2019-12-07 19:56:05,070 INFO L226 Difference]: Without dead ends: 108 [2019-12-07 19:56:05,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2019-12-07 19:56:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-12-07 19:56:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 82. [2019-12-07 19:56:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-12-07 19:56:05,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2019-12-07 19:56:05,072 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 14 [2019-12-07 19:56:05,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:56:05,072 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2019-12-07 19:56:05,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 19:56:05,072 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2019-12-07 19:56:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:56:05,073 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:56:05,073 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:56:05,273 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 19:56:05,275 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr43REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr30REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr35REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr33REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr41REQUIRES_VIOLATION, ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr37REQUIRES_VIOLATION, ULTIMATE.startErr39REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr42REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr44REQUIRES_VIOLATION, ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr31REQUIRES_VIOLATION, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr34REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr32REQUIRES_VIOLATION, ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr40REQUIRES_VIOLATION, ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr38REQUIRES_VIOLATION]=== [2019-12-07 19:56:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:56:05,275 INFO L82 PathProgramCache]: Analyzing trace with hash 347615800, now seen corresponding path program 1 times [2019-12-07 19:56:05,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 19:56:05,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81721553] [2019-12-07 19:56:05,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 19:56:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:05,406 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 20 conjunts are in the unsatisfiable core [2019-12-07 19:56:05,407 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:05,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 19:56:05,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,416 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,416 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-12-07 19:56:05,423 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:56:05,423 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,434 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-12-07 19:56:05,434 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,441 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-12-07 19:56:05,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 19:56:05,455 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,478 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-12-07 19:56:05,478 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,490 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,490 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,490 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2019-12-07 19:56:05,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:56:05,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,542 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:56:05,543 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,554 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,554 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2019-12-07 19:56:05,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:56:05,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,618 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 19:56:05,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-12-07 19:56:05,624 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,636 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,636 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,636 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2019-12-07 19:56:05,642 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-12-07 19:56:05,643 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:56:05,653 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:30 [2019-12-07 19:56:05,694 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,695 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 21 [2019-12-07 19:56:05,695 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,698 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,699 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 19:56:05,699 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:5 [2019-12-07 19:56:05,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:56:05,711 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 19:56:05,758 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_63|], 6=[|v_#memory_$Pointer$.base_74|]} [2019-12-07 19:56:05,760 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:56:05,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,777 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 19:56:05,781 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:05,782 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 19:56:05,782 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:49 [2019-12-07 19:56:09,938 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_64|], 1=[|v_#memory_$Pointer$.base_75|]} [2019-12-07 19:56:09,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:09,958 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:09,960 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 19:56:09,964 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 19:56:09,964 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 19:56:09,964 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:80, output treesize:39 [2019-12-07 19:56:12,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81721553] [2019-12-07 19:56:12,419 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: incompatible size [2019-12-07 19:56:12,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1245931850] [2019-12-07 19:56:12,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 19:56:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:12,507 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 19:56:12,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:12,509 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2a495841 [2019-12-07 19:56:12,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393129242] [2019-12-07 19:56:12,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea2f7cc0-f256-4d0f-bf49-f4f07544bb5c/bin/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:56:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:56:12,556 INFO L264 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 19:56:12,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 19:56:12,557 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@2a495841 [2019-12-07 19:56:12,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:56:12,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 19:56:12,558 ERROR L206 FreeRefinementEngine]: Strategy WALRUS failed to provide any proof altough trace is infeasible [2019-12-07 19:56:12,558 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:56:13,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 19:56:13,194 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 19:56:13,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:56:13 BoogieIcfgContainer [2019-12-07 19:56:13,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:56:13,196 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:56:13,196 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:56:13,197 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:56:13,197 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:55:31" (3/4) ... [2019-12-07 19:56:13,203 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 19:56:13,203 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:56:13,204 INFO L168 Benchmark]: Toolchain (without parser) took 42565.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 266.9 MB). Free memory was 945.7 MB in the beginning and 771.5 MB in the end (delta: 174.1 MB). Peak memory consumption was 441.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:56:13,204 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:56:13,205 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -117.0 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:56:13,205 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:56:13,205 INFO L168 Benchmark]: Boogie Preprocessor took 23.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:56:13,206 INFO L168 Benchmark]: RCFGBuilder took 435.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:56:13,206 INFO L168 Benchmark]: TraceAbstraction took 41726.50 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 781.3 MB in the end (delta: 237.5 MB). Peak memory consumption was 420.0 MB. Max. memory is 11.5 GB. [2019-12-07 19:56:13,207 INFO L168 Benchmark]: Witness Printer took 6.68 ms. Allocated memory is still 1.3 GB. Free memory was 781.3 MB in the beginning and 771.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-12-07 19:56:13,209 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 335.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 84.4 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -117.0 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 435.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41726.50 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.0 GB in the beginning and 781.3 MB in the end (delta: 237.5 MB). Peak memory consumption was 420.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.68 ms. Allocated memory is still 1.3 GB. Free memory was 781.3 MB in the beginning and 771.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1024]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L986] SLL* head = malloc(sizeof(SLL)); [L987] head->next = head [L988] head->prev = ((void*)0) [L989] head->data = 0 [L991] SLL* x = head; [L992] int state = 1; [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1017] x->data = state [L1019] EXPR head->next [L1019] x = head->next [L1020] COND FALSE !(!(((void*)0) != x)) [L1022] EXPR x->data [L1022] COND TRUE x->data != 0 [L1024] EXPR x->next [L1024] x->next->data - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 52 error locations. Result: UNKNOWN, OverallTime: 41.6s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 685 SDtfs, 2280 SDslu, 1641 SDs, 0 SdLazy, 2620 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 110 SyntacticMatches, 12 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 21.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 414 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 194 ConstructedInterpolants, 15 QuantifiedInterpolants, 27792 SizeOfPredicates, 79 NumberOfNonLiveVariables, 571 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...