./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 17:02:24,004 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:02:24,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:02:24,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:02:24,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:02:24,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:02:24,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:02:24,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:02:24,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:02:24,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:02:24,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:02:24,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:02:24,053 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:02:24,055 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:02:24,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:02:24,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:02:24,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:02:24,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:02:24,063 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:02:24,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:02:24,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:02:24,077 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:02:24,079 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:02:24,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:02:24,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:02:24,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:02:24,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:02:24,086 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:02:24,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:02:24,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:02:24,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:02:24,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:02:24,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:02:24,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:02:24,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:02:24,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:02:24,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:02:24,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:02:24,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:02:24,095 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:02:24,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:02:24,097 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 17:02:24,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:02:24,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:02:24,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:02:24,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:02:24,134 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:02:24,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:02:24,134 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:02:24,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 17:02:24,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:02:24,135 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:02:24,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:02:24,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:02:24,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:02:24,135 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:02:24,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:02:24,136 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:02:24,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:02:24,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:02:24,137 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:02:24,137 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:02:24,137 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:02:24,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:02:24,138 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:02:24,138 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:02:24,138 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:02:24,139 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 17:02:24,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 17:02:24,139 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:02:24,139 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:02:24,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-11-28 17:02:24,457 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:02:24,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:02:24,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:02:24,479 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:02:24,480 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:02:24,481 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-28 17:02:24,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0a8521c/81a144722a7d4d92afde8c0b3b401838/FLAG1150ccaeb [2019-11-28 17:02:25,111 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:02:25,112 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-28 17:02:25,126 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0a8521c/81a144722a7d4d92afde8c0b3b401838/FLAG1150ccaeb [2019-11-28 17:02:25,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb0a8521c/81a144722a7d4d92afde8c0b3b401838 [2019-11-28 17:02:25,412 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:02:25,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:02:25,415 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:25,415 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:02:25,418 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:02:25,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:25" (1/1) ... [2019-11-28 17:02:25,422 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1b3a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:25, skipping insertion in model container [2019-11-28 17:02:25,422 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:25" (1/1) ... [2019-11-28 17:02:25,430 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:02:25,484 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:02:25,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:25,897 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:02:25,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:26,014 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:02:26,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26 WrapperNode [2019-11-28 17:02:26,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:26,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:26,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:02:26,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:02:26,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,047 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,072 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:26,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:02:26,073 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:02:26,073 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:02:26,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,111 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... [2019-11-28 17:02:26,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:02:26,116 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:02:26,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:02:26,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:02:26,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 17:02:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 17:02:26,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 17:02:26,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 17:02:26,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 17:02:26,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:02:26,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:02:26,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:02:26,541 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:02:26,541 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 17:02:26,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:26 BoogieIcfgContainer [2019-11-28 17:02:26,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:02:26,544 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:02:26,544 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:02:26,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:02:26,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:02:25" (1/3) ... [2019-11-28 17:02:26,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa9c7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:26, skipping insertion in model container [2019-11-28 17:02:26,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:26" (2/3) ... [2019-11-28 17:02:26,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa9c7c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:26, skipping insertion in model container [2019-11-28 17:02:26,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:26" (3/3) ... [2019-11-28 17:02:26,552 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-11-28 17:02:26,563 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:02:26,569 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:02:26,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:02:26,598 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:02:26,599 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:02:26,599 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:02:26,599 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:02:26,599 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:02:26,599 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:02:26,600 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:02:26,600 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:02:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-28 17:02:26,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:02:26,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:26,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:26,617 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash 742134712, now seen corresponding path program 1 times [2019-11-28 17:02:26,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:26,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806871052] [2019-11-28 17:02:26,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:26,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806871052] [2019-11-28 17:02:26,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:26,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 17:02:26,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70727695] [2019-11-28 17:02:26,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 17:02:26,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:26,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 17:02:26,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 17:02:26,833 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2019-11-28 17:02:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:26,889 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2019-11-28 17:02:26,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 17:02:26,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 17:02:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:26,903 INFO L225 Difference]: With dead ends: 43 [2019-11-28 17:02:26,903 INFO L226 Difference]: Without dead ends: 21 [2019-11-28 17:02:26,906 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-11-28 17:02:26,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-11-28 17:02:26,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2019-11-28 17:02:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-28 17:02:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-11-28 17:02:26,948 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2019-11-28 17:02:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:26,949 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-11-28 17:02:26,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 17:02:26,950 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2019-11-28 17:02:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 17:02:26,950 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:26,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:26,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:26,952 INFO L82 PathProgramCache]: Analyzing trace with hash -60440637, now seen corresponding path program 1 times [2019-11-28 17:02:26,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:26,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032656239] [2019-11-28 17:02:26,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:27,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032656239] [2019-11-28 17:02:27,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195924466] [2019-11-28 17:02:27,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:27,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 17:02:27,150 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:27,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:27,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:27,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 17:02:27,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244089675] [2019-11-28 17:02:27,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 17:02:27,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:27,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 17:02:27,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:02:27,197 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 5 states. [2019-11-28 17:02:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:27,241 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2019-11-28 17:02:27,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:02:27,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-28 17:02:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:27,243 INFO L225 Difference]: With dead ends: 35 [2019-11-28 17:02:27,243 INFO L226 Difference]: Without dead ends: 24 [2019-11-28 17:02:27,245 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 17:02:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-28 17:02:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2019-11-28 17:02:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 17:02:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 17:02:27,250 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 13 [2019-11-28 17:02:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:27,251 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 17:02:27,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 17:02:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-28 17:02:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:02:27,252 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:27,252 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:27,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:27,459 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:27,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:27,460 INFO L82 PathProgramCache]: Analyzing trace with hash 500274136, now seen corresponding path program 2 times [2019-11-28 17:02:27,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:27,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986271053] [2019-11-28 17:02:27,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:27,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986271053] [2019-11-28 17:02:27,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40928959] [2019-11-28 17:02:27,605 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:27,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:02:27,695 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:27,696 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:02:27,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:27,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:27,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-28 17:02:27,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059603283] [2019-11-28 17:02:27,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 17:02:27,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:27,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 17:02:27,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:02:27,722 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-11-28 17:02:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:27,759 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-11-28 17:02:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 17:02:27,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 17:02:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:27,761 INFO L225 Difference]: With dead ends: 38 [2019-11-28 17:02:27,761 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 17:02:27,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-28 17:02:27,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 17:02:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-28 17:02:27,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 17:02:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-28 17:02:27,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-11-28 17:02:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:27,768 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 17:02:27,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 17:02:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-28 17:02:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 17:02:27,770 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:27,770 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:27,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:27,980 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:27,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1626262435, now seen corresponding path program 3 times [2019-11-28 17:02:27,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:27,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085542759] [2019-11-28 17:02:27,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:28,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085542759] [2019-11-28 17:02:28,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251715048] [2019-11-28 17:02:28,117 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:28,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-28 17:02:28,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:28,212 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 17:02:28,220 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:28,331 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 13 treesize of output 9 [2019-11-28 17:02:28,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:28,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:28,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:28,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-28 17:02:28,379 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 23 treesize of output 11 [2019-11-28 17:02:28,380 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:28,387 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:28,387 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:28,388 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:14 [2019-11-28 17:02:28,443 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-11-28 17:02:28,444 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:28,450 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:28,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:28,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-28 17:02:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:02:28,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:28,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 12 [2019-11-28 17:02:28,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884834950] [2019-11-28 17:02:28,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:02:28,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:02:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-28 17:02:28,476 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 12 states. [2019-11-28 17:02:28,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:28,893 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2019-11-28 17:02:28,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 17:02:28,894 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-28 17:02:28,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:28,895 INFO L225 Difference]: With dead ends: 41 [2019-11-28 17:02:28,895 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 17:02:28,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-11-28 17:02:28,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 17:02:28,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 17:02:28,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 17:02:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 17:02:28,903 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 19 [2019-11-28 17:02:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:28,903 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 17:02:28,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 17:02:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 17:02:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:02:28,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:28,905 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:29,117 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:29,117 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:29,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:29,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1335739081, now seen corresponding path program 1 times [2019-11-28 17:02:29,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 17:02:29,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403622603] [2019-11-28 17:02:29,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 17:02:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:29,856 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 17:02:29,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403622603] [2019-11-28 17:02:29,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556553022] [2019-11-28 17:02:29,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:29,948 INFO L264 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-28 17:02:29,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:30,028 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 13 treesize of output 9 [2019-11-28 17:02:30,029 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,039 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,039 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,040 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-28 17:02:30,158 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_12|, |v_#memory_$Pointer$.offset_12|], 2=[|v_#memory_int_19|, |v_#memory_int_18|]} [2019-11-28 17:02:30,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:30,175 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 22 treesize of output 7 [2019-11-28 17:02:30,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:30,212 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 22 treesize of output 7 [2019-11-28 17:02:30,213 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,234 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,242 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 23 treesize of output 11 [2019-11-28 17:02:30,243 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,269 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 17:02:30,279 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,280 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 36 [2019-11-28 17:02:30,281 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,311 INFO L614 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-11-28 17:02:30,312 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,312 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:89, output treesize:37 [2019-11-28 17:02:30,368 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,369 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2019-11-28 17:02:30,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:30,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:30,374 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:30,445 INFO L614 ElimStorePlain]: treesize reduction 12, result has 85.7 percent of original size [2019-11-28 17:02:30,470 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,471 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-28 17:02:30,472 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,529 INFO L614 ElimStorePlain]: treesize reduction 16, result has 81.0 percent of original size [2019-11-28 17:02:30,540 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,540 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 30 treesize of output 29 [2019-11-28 17:02:30,541 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:30,583 INFO L614 ElimStorePlain]: treesize reduction 12, result has 81.5 percent of original size [2019-11-28 17:02:30,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:30,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:30,587 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:69, output treesize:53 [2019-11-28 17:02:30,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:30,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:30,760 INFO L430 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 5=[|v_#memory_$Pointer$.base_14|, |v_#memory_$Pointer$.offset_14|, |v_#memory_int_21|]} [2019-11-28 17:02:30,767 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:30,799 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,802 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:30,827 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:30,838 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 31 treesize of output 33 [2019-11-28 17:02:30,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:30,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:30,849 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 17:02:30,849 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_9], 1=[v_arrayElimCell_10]} [2019-11-28 17:02:30,854 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1feef976 [2019-11-28 17:02:30,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-28 17:02:30,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-11-28 17:02:30,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997742689] [2019-11-28 17:02:30,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 17:02:30,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 17:02:30,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 17:02:30,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:02:30,856 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 12 states. [2019-11-28 17:02:30,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 17:02:31,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:31,063 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@1feef976 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-11-28 17:02:31,071 INFO L168 Benchmark]: Toolchain (without parser) took 5657.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.1 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -141.6 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:31,072 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:02:31,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:31,074 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.06 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:31,074 INFO L168 Benchmark]: Boogie Preprocessor took 42.56 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-11-28 17:02:31,075 INFO L168 Benchmark]: RCFGBuilder took 427.53 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:31,076 INFO L168 Benchmark]: TraceAbstraction took 4525.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.2 MB). Peak memory consumption was 62.1 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:31,080 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.88 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 600.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -155.8 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.06 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.56 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. * RCFGBuilder took 427.53 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: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4525.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -19.2 MB). Peak memory consumption was 62.1 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@1feef976 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@1feef976: 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-11-28 17:02:32,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 17:02:32,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 17:02:33,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 17:02:33,014 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 17:02:33,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 17:02:33,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 17:02:33,029 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 17:02:33,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 17:02:33,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 17:02:33,041 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 17:02:33,042 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 17:02:33,043 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 17:02:33,045 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 17:02:33,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 17:02:33,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 17:02:33,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 17:02:33,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 17:02:33,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 17:02:33,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 17:02:33,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 17:02:33,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 17:02:33,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 17:02:33,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 17:02:33,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 17:02:33,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 17:02:33,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 17:02:33,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 17:02:33,080 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 17:02:33,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 17:02:33,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 17:02:33,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 17:02:33,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 17:02:33,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 17:02:33,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 17:02:33,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 17:02:33,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 17:02:33,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 17:02:33,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 17:02:33,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 17:02:33,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 17:02:33,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 17:02:33,127 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 17:02:33,131 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 17:02:33,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 17:02:33,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 17:02:33,133 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 17:02:33,133 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 17:02:33,133 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 17:02:33,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 17:02:33,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 17:02:33,136 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 17:02:33,136 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 17:02:33,136 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 17:02:33,138 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 17:02:33,138 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 17:02:33,139 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 17:02:33,139 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 17:02:33,139 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 17:02:33,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 17:02:33,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 17:02:33,140 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 17:02:33,140 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 17:02:33,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 17:02:33,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 17:02:33,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 17:02:33,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 17:02:33,142 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 17:02:33,142 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 17:02:33,143 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 17:02:33,143 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 17:02:33,143 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 17:02:33,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 17:02:33,144 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 15c2a0dbf98e8d278e41c47d311b6d4dc752a8f7 [2019-11-28 17:02:33,504 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 17:02:33,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 17:02:33,528 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 17:02:33,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 17:02:33,530 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 17:02:33,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-28 17:02:33,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f3493d9/d04816bc63dc48a09b740a617daffacb/FLAG90aef0819 [2019-11-28 17:02:34,118 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 17:02:34,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2019-11-28 17:02:34,132 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f3493d9/d04816bc63dc48a09b740a617daffacb/FLAG90aef0819 [2019-11-28 17:02:34,441 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8f3493d9/d04816bc63dc48a09b740a617daffacb [2019-11-28 17:02:34,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 17:02:34,446 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 17:02:34,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:34,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 17:02:34,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 17:02:34,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672988f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:34, skipping insertion in model container [2019-11-28 17:02:34,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 05:02:34" (1/1) ... [2019-11-28 17:02:34,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 17:02:34,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 17:02:34,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:35,012 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 17:02:35,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 17:02:35,147 INFO L208 MainTranslator]: Completed translation [2019-11-28 17:02:35,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35 WrapperNode [2019-11-28 17:02:35,148 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 17:02:35,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:35,149 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 17:02:35,149 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 17:02:35,158 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,178 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 17:02:35,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 17:02:35,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 17:02:35,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 17:02:35,212 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,217 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,235 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... [2019-11-28 17:02:35,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 17:02:35,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 17:02:35,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 17:02:35,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 17:02:35,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:35,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 17:02:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 17:02:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 17:02:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 17:02:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 17:02:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 17:02:35,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 17:02:35,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 17:02:35,727 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 17:02:35,728 INFO L287 CfgBuilder]: Removed 13 assume(true) statements. [2019-11-28 17:02:35,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:35 BoogieIcfgContainer [2019-11-28 17:02:35,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 17:02:35,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 17:02:35,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 17:02:35,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 17:02:35,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 05:02:34" (1/3) ... [2019-11-28 17:02:35,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5183ad4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:35, skipping insertion in model container [2019-11-28 17:02:35,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 05:02:35" (2/3) ... [2019-11-28 17:02:35,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5183ad4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 05:02:35, skipping insertion in model container [2019-11-28 17:02:35,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:35" (3/3) ... [2019-11-28 17:02:35,736 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2019-11-28 17:02:35,746 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 17:02:35,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 17:02:35,765 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 17:02:35,785 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 17:02:35,786 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 17:02:35,786 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 17:02:35,786 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 17:02:35,786 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 17:02:35,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 17:02:35,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 17:02:35,787 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 17:02:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-11-28 17:02:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 17:02:35,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:35,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:35,806 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:35,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:35,811 INFO L82 PathProgramCache]: Analyzing trace with hash 742134712, now seen corresponding path program 1 times [2019-11-28 17:02:35,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:35,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140607040] [2019-11-28 17:02:35,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:35,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 17:02:35,945 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:35,997 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:36,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140607040] [2019-11-28 17:02:36,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:36,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 17:02:36,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121281618] [2019-11-28 17:02:36,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 17:02:36,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 17:02:36,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 17:02:36,046 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-11-28 17:02:36,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:36,129 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2019-11-28 17:02:36,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 17:02:36,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 17:02:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:36,142 INFO L225 Difference]: With dead ends: 44 [2019-11-28 17:02:36,143 INFO L226 Difference]: Without dead ends: 22 [2019-11-28 17:02:36,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 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-11-28 17:02:36,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-28 17:02:36,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-28 17:02:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-28 17:02:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-11-28 17:02:36,192 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 10 [2019-11-28 17:02:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:36,193 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-11-28 17:02:36,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 17:02:36,193 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-11-28 17:02:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 17:02:36,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:36,194 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:36,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 17:02:36,409 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:36,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:36,411 INFO L82 PathProgramCache]: Analyzing trace with hash 500274136, now seen corresponding path program 1 times [2019-11-28 17:02:36,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:36,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963998808] [2019-11-28 17:02:36,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:36,510 INFO L264 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 17:02:36,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:36,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:36,541 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 17:02:36,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963998808] [2019-11-28 17:02:36,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:36,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-11-28 17:02:36,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609797592] [2019-11-28 17:02:36,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 17:02:36,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:36,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 17:02:36,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:02:36,602 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 8 states. [2019-11-28 17:02:36,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:36,755 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-11-28 17:02:36,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 17:02:36,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-11-28 17:02:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:36,757 INFO L225 Difference]: With dead ends: 39 [2019-11-28 17:02:36,757 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 17:02:36,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-28 17:02:36,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 17:02:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 17:02:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 17:02:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-28 17:02:36,764 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 16 [2019-11-28 17:02:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:36,765 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-28 17:02:36,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 17:02:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-28 17:02:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 17:02:36,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:36,766 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:36,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 17:02:36,980 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:36,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:36,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2045871112, now seen corresponding path program 2 times [2019-11-28 17:02:36,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:36,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017572647] [2019-11-28 17:02:36,984 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:37,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 17:02:37,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 17:02:37,168 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 17:02:37,171 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:37,284 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 13 treesize of output 9 [2019-11-28 17:02:37,284 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:37,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:37,300 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:37,300 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-28 17:02:37,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:37,340 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 25 treesize of output 13 [2019-11-28 17:02:37,341 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:37,355 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:37,356 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:37,356 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2019-11-28 17:02:37,413 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-11-28 17:02:37,414 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:37,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:37,420 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:37,420 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2019-11-28 17:02:37,448 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 17:02:37,449 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 17:02:37,551 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:37,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:37,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:37,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:17 [2019-11-28 17:02:37,629 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:37,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:37,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 17:02:37,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:37,676 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 17:02:37,676 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:26 [2019-11-28 17:02:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-28 17:02:37,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017572647] [2019-11-28 17:02:37,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 17:02:37,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-28 17:02:37,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661414215] [2019-11-28 17:02:37,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 17:02:37,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 17:02:37,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 17:02:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-28 17:02:37,792 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 14 states. [2019-11-28 17:02:38,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 17:02:38,421 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2019-11-28 17:02:38,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 17:02:38,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2019-11-28 17:02:38,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 17:02:38,423 INFO L225 Difference]: With dead ends: 32 [2019-11-28 17:02:38,423 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 17:02:38,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-11-28 17:02:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 17:02:38,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 17:02:38,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 17:02:38,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-28 17:02:38,432 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2019-11-28 17:02:38,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 17:02:38,433 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-28 17:02:38,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 17:02:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-28 17:02:38,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 17:02:38,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 17:02:38,434 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 17:02:38,647 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 17:02:38,648 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 17:02:38,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 17:02:38,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1335739081, now seen corresponding path program 1 times [2019-11-28 17:02:38,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 17:02:38,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710096538] [2019-11-28 17:02:38,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 17:02:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:39,003 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-28 17:02:39,007 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 17:02:39,016 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-11-28 17:02:39,016 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:39,031 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,031 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 17:02:39,082 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:39,082 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 19 treesize of output 41 [2019-11-28 17:02:39,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,123 INFO L614 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-28 17:02:39,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:39,125 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-28 17:02:39,212 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:39,213 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 71 [2019-11-28 17:02:39,215 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,283 INFO L614 ElimStorePlain]: treesize reduction 28, result has 54.8 percent of original size [2019-11-28 17:02:39,285 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:39,285 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:34 [2019-11-28 17:02:39,436 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:39,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 103 [2019-11-28 17:02:39,443 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,586 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-28 17:02:39,588 INFO L614 ElimStorePlain]: treesize reduction 42, result has 56.3 percent of original size [2019-11-28 17:02:39,590 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:39,591 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:54 [2019-11-28 17:02:39,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 17:02:39,688 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:39,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:39,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2019-11-28 17:02:39,887 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:39,888 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 54 [2019-11-28 17:02:39,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:39,958 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:39,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:34 [2019-11-28 17:02:40,023 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.base_24|], 2=[|v_#memory_int_30|, |v_#memory_int_31|]} [2019-11-28 17:02:40,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:40,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-28 17:02:40,047 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:40,182 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2019-11-28 17:02:40,183 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,259 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:40,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:40,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-11-28 17:02:40,351 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,404 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,404 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:98, output treesize:54 [2019-11-28 17:02:40,475 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_25|, |v_#memory_$Pointer$.base_25|], 4=[|v_#memory_int_32|]} [2019-11-28 17:02:40,487 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 19 treesize of output 18 [2019-11-28 17:02:40,488 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,554 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,561 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 39 treesize of output 30 [2019-11-28 17:02:40,562 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,652 INFO L614 ElimStorePlain]: treesize reduction 4, result has 95.0 percent of original size [2019-11-28 17:02:40,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:40,673 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 27 [2019-11-28 17:02:40,674 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:40,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,711 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:40,712 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:88, output treesize:61 [2019-11-28 17:02:40,887 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 1=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_26|], 3=[|v_#memory_int_33|]} [2019-11-28 17:02:40,893 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:40,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:40,967 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 17:02:41,020 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:41,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 17:02:41,035 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 33 treesize of output 19 [2019-11-28 17:02:41,063 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 11 treesize of output 7 [2019-11-28 17:02:41,063 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 17:02:41,064 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:41,065 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 17:02:41,093 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:41,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 17:02:41,123 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 88 treesize of output 69 [2019-11-28 17:02:41,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 17:02:41,128 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_25], 1=[v_arrayElimCell_26]} [2019-11-28 17:02:41,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710096538] [2019-11-28 17:02:41,133 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@19f6a2fd [2019-11-28 17:02:41,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1241049358] [2019-11-28 17:02:41,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-28 17:02:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:41,474 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-28 17:02:41,475 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@19f6a2fd [2019-11-28 17:02:41,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643162016] [2019-11-28 17:02:41,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 17:02:41,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-28 17:02:41,579 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@19f6a2fd [2019-11-28 17:02:41,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-11-28 17:02:41,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-11-28 17:02:41,580 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-11-28 17:02:41,580 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 17:02:42,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt --rewrite-divk,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 17:02:42,208 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-11-28 17:02:42,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 05:02:42 BoogieIcfgContainer [2019-11-28 17:02:42,208 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 17:02:42,209 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 17:02:42,209 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 17:02:42,209 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 17:02:42,210 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 05:02:35" (3/4) ... [2019-11-28 17:02:42,213 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 17:02:42,213 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 17:02:42,215 INFO L168 Benchmark]: Toolchain (without parser) took 7768.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.0 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -116.5 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:42,216 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 17:02:42,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 700.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:42,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.05 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-11-28 17:02:42,218 INFO L168 Benchmark]: Boogie Preprocessor took 38.99 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-11-28 17:02:42,218 INFO L168 Benchmark]: RCFGBuilder took 488.72 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:42,219 INFO L168 Benchmark]: TraceAbstraction took 6478.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.0 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-11-28 17:02:42,220 INFO L168 Benchmark]: Witness Printer took 4.49 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-11-28 17:02:42,223 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 700.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 953.7 MB in the beginning and 1.1 GB in the end (delta: -140.0 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.05 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 38.99 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. * RCFGBuilder took 488.72 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6478.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.0 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.49 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 609]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L585] const int len = 5; [L586] const int data_init = 1; [L564] SLL const last = (SLL) malloc(sizeof(struct node)); [L565] COND FALSE !(((void *)0) == last) [L568] last->next = last [L569] last->data = data [L570] SLL head = last; [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND TRUE len > 1 [L572] SLL new_head = (SLL) malloc(sizeof(struct node)); [L573] COND FALSE !(((void *)0) == new_head) [L576] new_head->next = head [L577] new_head->data = data [L578] head = new_head [L579] len-- [L571] COND FALSE !(len > 1) [L581] last->next = head [L582] return head; [L587] SLL const head = sll_circular_create(len, data_init); [L588] int data_new = 1; [L589] SLL ptr = head; [L591] EXPR ptr->data [L591] COND FALSE !(data_init != ptr->data) [L594] ptr->data = data_new [L595] EXPR ptr->next [L595] ptr = ptr->next [L596] data_new++ [L597] COND TRUE ptr != head [L591] EXPR ptr->data [L591] COND TRUE data_init != ptr->data [L609] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: UNKNOWN, OverallTime: 6.4s, OverallIterations: 4, TraceHistogramMax: 4, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 61 SDtfs, 75 SDslu, 163 SDs, 0 SdLazy, 109 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 90 ConstructedInterpolants, 2 QuantifiedInterpolants, 10656 SizeOfPredicates, 25 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 30/54 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...