./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/forester-heap/sll-sorted-2.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc3896142acc5bdf441df6ee5a4320292e59871e ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 -Xmx15G -Xms4m -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/forester-heap/sll-sorted-2.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dc3896142acc5bdf441df6ee5a4320292e59871e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:46:41,251 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:46:41,253 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:46:41,277 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:46:41,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:46:41,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:46:41,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:46:41,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:46:41,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:46:41,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:46:41,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:46:41,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:46:41,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:46:41,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:46:41,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:46:41,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:46:41,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:46:41,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:46:41,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:46:41,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:46:41,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:46:41,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:46:41,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:46:41,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:46:41,313 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:46:41,317 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:46:41,318 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:46:41,320 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:46:41,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:46:41,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:46:41,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:46:41,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:46:41,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:46:41,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:46:41,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:46:41,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:46:41,329 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:46:41,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:46:41,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:46:41,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:46:41,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:46:41,333 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 00:46:41,392 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:46:41,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:46:41,395 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:46:41,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:46:41,396 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:46:41,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:46:41,397 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:46:41,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 00:46:41,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:46:41,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:46:41,398 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:46:41,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:46:41,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:46:41,400 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:46:41,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:46:41,400 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:46:41,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:46:41,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:46:41,401 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:46:41,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:46:41,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:46:41,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:46:41,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:46:41,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:46:41,402 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:46:41,403 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 00:46:41,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 00:46:41,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:46:41,403 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:46:41,404 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(reach_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 -> dc3896142acc5bdf441df6ee5a4320292e59871e [2020-10-20 00:46:41,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:46:41,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:46:41,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:46:41,654 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:46:41,654 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:46:41,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2020-10-20 00:46:41,724 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c2f5f83/791d872a3e05444d9261165f154aa96f/FLAG17deffa10 [2020-10-20 00:46:42,356 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:46:42,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2020-10-20 00:46:42,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c2f5f83/791d872a3e05444d9261165f154aa96f/FLAG17deffa10 [2020-10-20 00:46:42,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77c2f5f83/791d872a3e05444d9261165f154aa96f [2020-10-20 00:46:42,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:46:42,647 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:46:42,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:42,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:46:42,652 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:46:42,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:42" (1/1) ... [2020-10-20 00:46:42,656 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35ec381c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:42, skipping insertion in model container [2020-10-20 00:46:42,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:42" (1/1) ... [2020-10-20 00:46:42,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:46:42,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:46:43,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:43,097 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:46:43,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:43,221 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:46:43,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43 WrapperNode [2020-10-20 00:46:43,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:43,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:43,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:46:43,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:46:43,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,258 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:43,289 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:46:43,289 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:46:43,289 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:46:43,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (1/1) ... [2020-10-20 00:46:43,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:46:43,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:46:43,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:46:43,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:46:43,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (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 [2020-10-20 00:46:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 00:46:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 00:46:43,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 00:46:43,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 00:46:43,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:46:43,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 00:46:43,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:46:43,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 00:46:43,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:46:43,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:46:43,931 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:46:43,931 INFO L298 CfgBuilder]: Removed 38 assume(true) statements. [2020-10-20 00:46:43,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:43 BoogieIcfgContainer [2020-10-20 00:46:43,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:46:43,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:46:43,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:46:43,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:46:43,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:46:42" (1/3) ... [2020-10-20 00:46:43,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9b31b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:43, skipping insertion in model container [2020-10-20 00:46:43,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:43" (2/3) ... [2020-10-20 00:46:43,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9b31b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:43, skipping insertion in model container [2020-10-20 00:46:43,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:43" (3/3) ... [2020-10-20 00:46:43,944 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2020-10-20 00:46:43,957 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:46:43,964 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-10-20 00:46:43,985 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-20 00:46:44,010 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:46:44,010 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:46:44,011 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:46:44,011 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:46:44,011 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:46:44,011 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:46:44,012 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:46:44,012 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:46:44,030 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2020-10-20 00:46:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-20 00:46:44,036 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:44,036 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:44,037 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:44,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:44,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1824948254, now seen corresponding path program 1 times [2020-10-20 00:46:44,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:44,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292085095] [2020-10-20 00:46:44,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:44,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:44,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292085095] [2020-10-20 00:46:44,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:44,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 00:46:44,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642947664] [2020-10-20 00:46:44,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:46:44,215 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:44,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:46:44,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:46:44,231 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2020-10-20 00:46:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:44,254 INFO L93 Difference]: Finished difference Result 139 states and 225 transitions. [2020-10-20 00:46:44,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:46:44,256 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-20 00:46:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:44,266 INFO L225 Difference]: With dead ends: 139 [2020-10-20 00:46:44,267 INFO L226 Difference]: Without dead ends: 63 [2020-10-20 00:46:44,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:46:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-20 00:46:44,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-20 00:46:44,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-20 00:46:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2020-10-20 00:46:44,307 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 7 [2020-10-20 00:46:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:44,308 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2020-10-20 00:46:44,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:46:44,308 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2020-10-20 00:46:44,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-20 00:46:44,309 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:44,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:44,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 00:46:44,310 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:44,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:44,310 INFO L82 PathProgramCache]: Analyzing trace with hash 178060237, now seen corresponding path program 1 times [2020-10-20 00:46:44,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:44,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390277436] [2020-10-20 00:46:44,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:44,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:44,411 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390277436] [2020-10-20 00:46:44,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:44,412 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:44,412 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370416179] [2020-10-20 00:46:44,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:44,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:44,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:44,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:44,415 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 3 states. [2020-10-20 00:46:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:44,476 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2020-10-20 00:46:44,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:44,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-20 00:46:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:44,478 INFO L225 Difference]: With dead ends: 129 [2020-10-20 00:46:44,478 INFO L226 Difference]: Without dead ends: 68 [2020-10-20 00:46:44,480 INFO L677 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 [2020-10-20 00:46:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-20 00:46:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2020-10-20 00:46:44,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-20 00:46:44,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2020-10-20 00:46:44,490 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 8 [2020-10-20 00:46:44,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:44,491 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2020-10-20 00:46:44,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:44,491 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-10-20 00:46:44,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 00:46:44,492 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:44,492 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:44,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 00:46:44,493 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:44,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:44,494 INFO L82 PathProgramCache]: Analyzing trace with hash 858016664, now seen corresponding path program 1 times [2020-10-20 00:46:44,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:44,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929129706] [2020-10-20 00:46:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 00:46:44,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929129706] [2020-10-20 00:46:44,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:44,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 00:46:44,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571708800] [2020-10-20 00:46:44,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:46:44,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:46:44,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:44,580 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 4 states. [2020-10-20 00:46:44,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:44,755 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2020-10-20 00:46:44,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:46:44,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-20 00:46:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:44,768 INFO L225 Difference]: With dead ends: 111 [2020-10-20 00:46:44,768 INFO L226 Difference]: Without dead ends: 108 [2020-10-20 00:46:44,769 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-10-20 00:46:44,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 64. [2020-10-20 00:46:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 00:46:44,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2020-10-20 00:46:44,782 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 12 [2020-10-20 00:46:44,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:44,784 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2020-10-20 00:46:44,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:46:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2020-10-20 00:46:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 00:46:44,785 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:44,785 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:44,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 00:46:44,786 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:44,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:44,786 INFO L82 PathProgramCache]: Analyzing trace with hash -56906818, now seen corresponding path program 1 times [2020-10-20 00:46:44,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:44,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460378786] [2020-10-20 00:46:44,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:44,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 00:46:44,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460378786] [2020-10-20 00:46:44,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:44,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 00:46:44,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440080594] [2020-10-20 00:46:44,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:44,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:44,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:44,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:44,881 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 3 states. [2020-10-20 00:46:44,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:44,900 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2020-10-20 00:46:44,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:44,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-20 00:46:44,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:44,902 INFO L225 Difference]: With dead ends: 115 [2020-10-20 00:46:44,902 INFO L226 Difference]: Without dead ends: 65 [2020-10-20 00:46:44,903 INFO L677 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 [2020-10-20 00:46:44,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-20 00:46:44,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-20 00:46:44,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-20 00:46:44,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2020-10-20 00:46:44,911 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 19 [2020-10-20 00:46:44,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:44,911 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2020-10-20 00:46:44,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:44,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2020-10-20 00:46:44,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 00:46:44,912 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:44,913 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:44,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 00:46:44,913 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:44,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:44,914 INFO L82 PathProgramCache]: Analyzing trace with hash -114165120, now seen corresponding path program 1 times [2020-10-20 00:46:44,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:44,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210025983] [2020-10-20 00:46:44,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:45,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:45,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210025983] [2020-10-20 00:46:45,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843512694] [2020-10-20 00:46:45,310 INFO L95 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 [2020-10-20 00:46:45,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:45,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-20 00:46:45,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:45,490 INFO L384 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 [2020-10-20 00:46:45,490 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,501 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,505 INFO L384 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 [2020-10-20 00:46:45,506 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,519 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,520 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2020-10-20 00:46:45,587 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,588 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:46:45,588 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,609 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:45,621 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:45,627 INFO L384 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 41 treesize of output 20 [2020-10-20 00:46:45,628 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,641 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,644 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,644 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:53, output treesize:14 [2020-10-20 00:46:45,675 INFO L384 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 22 [2020-10-20 00:46:45,676 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,682 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,685 INFO L545 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. [2020-10-20 00:46:45,685 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2020-10-20 00:46:45,832 INFO L384 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 28 treesize of output 10 [2020-10-20 00:46:45,834 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,838 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:45,840 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:45,840 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:3 [2020-10-20 00:46:45,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:45,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:46:45,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-10-20 00:46:45,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762751528] [2020-10-20 00:46:45,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-20 00:46:45,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:45,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-20 00:46:45,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2020-10-20 00:46:45,864 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 13 states. [2020-10-20 00:46:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:46,706 INFO L93 Difference]: Finished difference Result 157 states and 186 transitions. [2020-10-20 00:46:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 00:46:46,707 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2020-10-20 00:46:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:46,710 INFO L225 Difference]: With dead ends: 157 [2020-10-20 00:46:46,710 INFO L226 Difference]: Without dead ends: 106 [2020-10-20 00:46:46,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2020-10-20 00:46:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-20 00:46:46,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 77. [2020-10-20 00:46:46,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-20 00:46:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 92 transitions. [2020-10-20 00:46:46,721 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 92 transitions. Word has length 19 [2020-10-20 00:46:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:46,722 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 92 transitions. [2020-10-20 00:46:46,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-20 00:46:46,722 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 92 transitions. [2020-10-20 00:46:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:46:46,723 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:46,723 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:46,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:46:46,938 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash -538702628, now seen corresponding path program 1 times [2020-10-20 00:46:46,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:46,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778641273] [2020-10-20 00:46:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-20 00:46:46,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778641273] [2020-10-20 00:46:46,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:46,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 00:46:46,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573531454] [2020-10-20 00:46:46,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 00:46:46,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:46,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 00:46:46,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:46,994 INFO L87 Difference]: Start difference. First operand 77 states and 92 transitions. Second operand 5 states. [2020-10-20 00:46:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:47,090 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2020-10-20 00:46:47,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 00:46:47,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-10-20 00:46:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:47,092 INFO L225 Difference]: With dead ends: 123 [2020-10-20 00:46:47,092 INFO L226 Difference]: Without dead ends: 83 [2020-10-20 00:46:47,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-20 00:46:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-20 00:46:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2020-10-20 00:46:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-20 00:46:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2020-10-20 00:46:47,115 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 22 [2020-10-20 00:46:47,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:47,116 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2020-10-20 00:46:47,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 00:46:47,116 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2020-10-20 00:46:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 00:46:47,117 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:47,117 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:47,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 00:46:47,117 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:47,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:47,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1218760998, now seen corresponding path program 1 times [2020-10-20 00:46:47,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:47,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433728549] [2020-10-20 00:46:47,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:47,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433728549] [2020-10-20 00:46:47,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182878970] [2020-10-20 00:46:47,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 00:46:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:47,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 33 conjunts are in the unsatisfiable core [2020-10-20 00:46:47,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:47,512 INFO L384 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 [2020-10-20 00:46:47,513 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,518 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,518 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,519 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 00:46:47,548 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,549 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2020-10-20 00:46:47,550 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,564 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,577 INFO L384 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 27 treesize of output 15 [2020-10-20 00:46:47,578 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,587 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,592 INFO L384 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 27 treesize of output 15 [2020-10-20 00:46:47,592 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,601 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,601 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,602 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:65, output treesize:33 [2020-10-20 00:46:47,643 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 6=[|v_#memory_$Pointer$.base_29|, |v_#memory_$Pointer$.offset_29|]} [2020-10-20 00:46:47,653 INFO L384 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 25 treesize of output 17 [2020-10-20 00:46:47,654 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,676 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,732 INFO L350 Elim1Store]: treesize reduction 66, result has 49.6 percent of original size [2020-10-20 00:46:47,733 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 149 [2020-10-20 00:46:47,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 3, 2, 1] term [2020-10-20 00:46:47,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 00:46:47,739 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,791 INFO L625 ElimStorePlain]: treesize reduction 40, result has 70.4 percent of original size [2020-10-20 00:46:47,808 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,809 INFO L384 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 105 [2020-10-20 00:46:47,811 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,829 INFO L625 ElimStorePlain]: treesize reduction 58, result has 49.1 percent of original size [2020-10-20 00:46:47,830 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,830 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:142, output treesize:56 [2020-10-20 00:46:47,912 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,912 INFO L384 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 63 treesize of output 54 [2020-10-20 00:46:47,914 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,931 INFO L625 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2020-10-20 00:46:47,934 INFO L384 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2020-10-20 00:46:47,935 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,941 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,943 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,944 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:9 [2020-10-20 00:46:47,968 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2020-10-20 00:46:47,969 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,971 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:47,972 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:47,972 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-20 00:46:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:47,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:46:47,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-10-20 00:46:47,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121754164] [2020-10-20 00:46:47,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-20 00:46:47,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 00:46:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:46:47,981 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand 14 states. [2020-10-20 00:46:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:48,777 INFO L93 Difference]: Finished difference Result 116 states and 138 transitions. [2020-10-20 00:46:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 00:46:48,778 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 22 [2020-10-20 00:46:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:48,779 INFO L225 Difference]: With dead ends: 116 [2020-10-20 00:46:48,779 INFO L226 Difference]: Without dead ends: 113 [2020-10-20 00:46:48,780 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2020-10-20 00:46:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-20 00:46:48,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 86. [2020-10-20 00:46:48,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-10-20 00:46:48,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2020-10-20 00:46:48,790 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 22 [2020-10-20 00:46:48,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:48,790 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2020-10-20 00:46:48,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-20 00:46:48,791 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2020-10-20 00:46:48,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 00:46:48,792 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:48,792 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:49,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:46:49,007 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:49,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:49,007 INFO L82 PathProgramCache]: Analyzing trace with hash 380237205, now seen corresponding path program 1 times [2020-10-20 00:46:49,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:49,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648867339] [2020-10-20 00:46:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:49,192 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:49,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648867339] [2020-10-20 00:46:49,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890582435] [2020-10-20 00:46:49,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 00:46:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:49,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 33 conjunts are in the unsatisfiable core [2020-10-20 00:46:49,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:49,273 INFO L384 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 [2020-10-20 00:46:49,274 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,281 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,284 INFO L384 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 [2020-10-20 00:46:49,285 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,296 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,296 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,296 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:21 [2020-10-20 00:46:49,341 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,341 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2020-10-20 00:46:49,342 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,397 INFO L625 ElimStorePlain]: treesize reduction 14, result has 80.3 percent of original size [2020-10-20 00:46:49,400 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:49,414 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-20 00:46:49,420 INFO L384 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 41 treesize of output 20 [2020-10-20 00:46:49,421 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,431 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,433 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,433 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:59, output treesize:24 [2020-10-20 00:46:49,454 INFO L384 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 22 [2020-10-20 00:46:49,455 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,464 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,464 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,465 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2020-10-20 00:46:49,518 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,519 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-10-20 00:46:49,520 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,537 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,538 INFO L441 ElimStorePlain]: Different costs {2=[|v_#memory_int_38|], 6=[|v_#memory_int_41|]} [2020-10-20 00:46:49,540 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:49,554 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,565 INFO L350 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2020-10-20 00:46:49,566 INFO L384 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 1 case distinctions, treesize of input 50 treesize of output 32 [2020-10-20 00:46:49,567 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,578 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,581 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:49,581 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:68, output treesize:31 [2020-10-20 00:46:49,626 INFO L384 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 32 treesize of output 34 [2020-10-20 00:46:49,627 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,640 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,644 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-20 00:46:49,644 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:44, output treesize:40 [2020-10-20 00:46:49,892 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2020-10-20 00:46:49,893 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,902 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:46:49,903 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:46:49,903 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-10-20 00:46:49,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:49,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:46:49,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2020-10-20 00:46:49,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823930517] [2020-10-20 00:46:49,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 00:46:49,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 00:46:49,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 00:46:49,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2020-10-20 00:46:49,911 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 15 states. [2020-10-20 00:46:52,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:52,911 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2020-10-20 00:46:52,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-20 00:46:52,911 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 23 [2020-10-20 00:46:52,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:52,914 INFO L225 Difference]: With dead ends: 215 [2020-10-20 00:46:52,914 INFO L226 Difference]: Without dead ends: 212 [2020-10-20 00:46:52,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2020-10-20 00:46:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-10-20 00:46:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 91. [2020-10-20 00:46:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-20 00:46:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2020-10-20 00:46:52,945 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 23 [2020-10-20 00:46:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:52,945 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2020-10-20 00:46:52,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 00:46:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2020-10-20 00:46:52,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 00:46:52,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:52,948 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:53,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:46:53,164 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:53,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash 78045093, now seen corresponding path program 1 times [2020-10-20 00:46:53,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 00:46:53,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142472329] [2020-10-20 00:46:53,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 00:46:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:53,285 ERROR L253 erpolLogProxyWrapper]: Interpolant 21 not inductive [2020-10-20 00:46:53,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 00:46:53,287 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:876) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:241) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) 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) [2020-10-20 00:46:53,296 INFO L168 Benchmark]: Toolchain (without parser) took 10654.33 ms. Allocated memory was 44.0 MB in the beginning and 94.9 MB in the end (delta: 50.9 MB). Free memory was 23.0 MB in the beginning and 21.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 51.9 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:53,297 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 32.5 MB. Free memory was 11.3 MB in the beginning and 11.3 MB in the end (delta: 48.5 kB). Peak memory consumption was 48.5 kB. Max. memory is 14.3 GB. [2020-10-20 00:46:53,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 573.85 ms. Allocated memory is still 44.0 MB. Free memory was 22.2 MB in the beginning and 9.6 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:53,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.05 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 9.6 MB in the beginning and 28.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 26.6 kB. Max. memory is 14.3 GB. [2020-10-20 00:46:53,299 INFO L168 Benchmark]: Boogie Preprocessor took 43.28 ms. Allocated memory is still 46.1 MB. Free memory was 28.1 MB in the beginning and 25.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:53,304 INFO L168 Benchmark]: RCFGBuilder took 601.79 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 25.5 MB in the beginning and 10.2 MB in the end (delta: 15.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:53,304 INFO L168 Benchmark]: TraceAbstraction took 9358.32 ms. Allocated memory was 46.7 MB in the beginning and 94.9 MB in the end (delta: 48.2 MB). Free memory was 9.9 MB in the beginning and 21.9 MB in the end (delta: -12.0 MB). Peak memory consumption was 36.2 MB. Max. memory is 14.3 GB. [2020-10-20 00:46:53,312 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 32.5 MB. Free memory was 11.3 MB in the beginning and 11.3 MB in the end (delta: 48.5 kB). Peak memory consumption was 48.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 573.85 ms. Allocated memory is still 44.0 MB. Free memory was 22.2 MB in the beginning and 9.6 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 65.05 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 9.6 MB in the beginning and 28.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 26.6 kB. Max. memory is 14.3 GB. * Boogie Preprocessor took 43.28 ms. Allocated memory is still 46.1 MB. Free memory was 28.1 MB in the beginning and 25.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 601.79 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 25.5 MB in the beginning and 10.2 MB in the end (delta: 15.3 MB). Peak memory consumption was 18.0 MB. Max. memory is 14.3 GB. * TraceAbstraction took 9358.32 ms. Allocated memory was 46.7 MB in the beginning and 94.9 MB in the end (delta: 48.2 MB). Free memory was 9.9 MB in the beginning and 21.9 MB in the end (delta: -12.0 MB). Peak memory consumption was 36.2 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:219) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 00:46:55,517 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 00:46:55,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 00:46:55,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 00:46:55,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 00:46:55,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 00:46:55,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 00:46:55,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 00:46:55,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 00:46:55,583 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 00:46:55,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 00:46:55,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 00:46:55,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 00:46:55,590 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 00:46:55,591 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 00:46:55,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 00:46:55,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 00:46:55,595 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 00:46:55,597 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 00:46:55,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 00:46:55,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 00:46:55,608 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 00:46:55,610 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 00:46:55,611 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 00:46:55,623 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 00:46:55,625 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 00:46:55,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 00:46:55,636 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 00:46:55,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 00:46:55,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 00:46:55,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 00:46:55,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 00:46:55,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 00:46:55,643 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 00:46:55,644 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 00:46:55,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 00:46:55,645 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 00:46:55,645 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 00:46:55,646 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 00:46:55,650 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 00:46:55,651 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 00:46:55,652 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-20 00:46:55,690 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 00:46:55,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 00:46:55,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 00:46:55,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 00:46:55,693 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 00:46:55,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 00:46:55,694 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 00:46:55,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 00:46:55,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 00:46:55,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 00:46:55,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 00:46:55,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 00:46:55,696 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 00:46:55,696 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 00:46:55,696 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 00:46:55,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 00:46:55,697 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 00:46:55,698 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 00:46:55,698 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 00:46:55,698 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 00:46:55,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 00:46:55,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 00:46:55,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 00:46:55,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 00:46:55,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 00:46:55,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 00:46:55,700 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 00:46:55,700 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 00:46:55,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 00:46:55,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 00:46:55,701 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 00:46:55,701 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(reach_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 -> dc3896142acc5bdf441df6ee5a4320292e59871e [2020-10-20 00:46:55,913 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 00:46:55,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 00:46:55,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 00:46:55,929 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 00:46:55,930 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 00:46:55,930 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2020-10-20 00:46:55,995 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e558e8b99/bfb42baa95814439a4e3120b07db651d/FLAG7e9496b8c [2020-10-20 00:46:56,640 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 00:46:56,641 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2020-10-20 00:46:56,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e558e8b99/bfb42baa95814439a4e3120b07db651d/FLAG7e9496b8c [2020-10-20 00:46:56,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e558e8b99/bfb42baa95814439a4e3120b07db651d [2020-10-20 00:46:56,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 00:46:56,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 00:46:56,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:56,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 00:46:56,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 00:46:56,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:56" (1/1) ... [2020-10-20 00:46:56,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4750fe7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:56, skipping insertion in model container [2020-10-20 00:46:56,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 12:46:56" (1/1) ... [2020-10-20 00:46:56,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 00:46:57,005 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 00:46:57,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:57,366 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 00:46:57,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 00:46:57,530 INFO L208 MainTranslator]: Completed translation [2020-10-20 00:46:57,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57 WrapperNode [2020-10-20 00:46:57,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 00:46:57,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:57,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 00:46:57,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 00:46:57,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 00:46:57,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 00:46:57,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 00:46:57,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 00:46:57,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,636 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (1/1) ... [2020-10-20 00:46:57,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 00:46:57,641 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 00:46:57,641 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 00:46:57,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 00:46:57,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (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 [2020-10-20 00:46:57,709 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-20 00:46:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 00:46:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 00:46:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 00:46:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 00:46:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 00:46:57,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-10-20 00:46:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 00:46:57,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 00:46:57,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 00:46:58,332 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 00:46:58,333 INFO L298 CfgBuilder]: Removed 38 assume(true) statements. [2020-10-20 00:46:58,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:58 BoogieIcfgContainer [2020-10-20 00:46:58,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 00:46:58,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 00:46:58,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 00:46:58,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 00:46:58,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 12:46:56" (1/3) ... [2020-10-20 00:46:58,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7025ac7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:58, skipping insertion in model container [2020-10-20 00:46:58,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 12:46:57" (2/3) ... [2020-10-20 00:46:58,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7025ac7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 12:46:58, skipping insertion in model container [2020-10-20 00:46:58,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:58" (3/3) ... [2020-10-20 00:46:58,345 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2020-10-20 00:46:58,357 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 00:46:58,365 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2020-10-20 00:46:58,380 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-20 00:46:58,405 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 00:46:58,405 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 00:46:58,406 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 00:46:58,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 00:46:58,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 00:46:58,406 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 00:46:58,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 00:46:58,406 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 00:46:58,424 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2020-10-20 00:46:58,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-20 00:46:58,429 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:58,430 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:58,431 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1823993949, now seen corresponding path program 1 times [2020-10-20 00:46:58,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:58,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509904287] [2020-10-20 00:46:58,448 INFO L95 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 [2020-10-20 00:46:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:58,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-20 00:46:58,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:58,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:58,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:58,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509904287] [2020-10-20 00:46:58,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:58,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-20 00:46:58,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480478605] [2020-10-20 00:46:58,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-20 00:46:58,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:58,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 00:46:58,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:46:58,609 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 2 states. [2020-10-20 00:46:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:58,638 INFO L93 Difference]: Finished difference Result 136 states and 220 transitions. [2020-10-20 00:46:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 00:46:58,640 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 7 [2020-10-20 00:46:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:58,650 INFO L225 Difference]: With dead ends: 136 [2020-10-20 00:46:58,651 INFO L226 Difference]: Without dead ends: 61 [2020-10-20 00:46:58,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 00:46:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-20 00:46:58,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-20 00:46:58,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-20 00:46:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2020-10-20 00:46:58,697 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 7 [2020-10-20 00:46:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:58,697 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2020-10-20 00:46:58,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-20 00:46:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2020-10-20 00:46:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-20 00:46:58,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:58,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:58,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 00:46:58,913 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:58,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1809217613, now seen corresponding path program 1 times [2020-10-20 00:46:58,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:58,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525049335] [2020-10-20 00:46:58,916 INFO L95 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 [2020-10-20 00:46:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:58,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 00:46:58,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:59,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:46:59,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525049335] [2020-10-20 00:46:59,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:59,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-20 00:46:59,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947972715] [2020-10-20 00:46:59,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 00:46:59,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:59,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 00:46:59,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:59,019 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 3 states. [2020-10-20 00:46:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:59,117 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2020-10-20 00:46:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 00:46:59,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-20 00:46:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:59,119 INFO L225 Difference]: With dead ends: 124 [2020-10-20 00:46:59,119 INFO L226 Difference]: Without dead ends: 65 [2020-10-20 00:46:59,121 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 00:46:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-20 00:46:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2020-10-20 00:46:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 00:46:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2020-10-20 00:46:59,130 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 7 [2020-10-20 00:46:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:59,130 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2020-10-20 00:46:59,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 00:46:59,131 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2020-10-20 00:46:59,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 00:46:59,131 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:59,131 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:46:59,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 00:46:59,342 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:46:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:46:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash 996033154, now seen corresponding path program 1 times [2020-10-20 00:46:59,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:46:59,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039338743] [2020-10-20 00:46:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-10-20 00:46:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:46:59,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 00:46:59,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:46:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:46:59,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:46:59,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-20 00:46:59,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039338743] [2020-10-20 00:46:59,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:46:59,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-20 00:46:59,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591471414] [2020-10-20 00:46:59,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 00:46:59,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:46:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 00:46:59,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 00:46:59,501 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand 4 states. [2020-10-20 00:46:59,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:46:59,789 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2020-10-20 00:46:59,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 00:46:59,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 00:46:59,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:46:59,795 INFO L225 Difference]: With dead ends: 107 [2020-10-20 00:46:59,796 INFO L226 Difference]: Without dead ends: 104 [2020-10-20 00:46:59,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 00:46:59,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-20 00:46:59,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 61. [2020-10-20 00:46:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-20 00:46:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2020-10-20 00:46:59,822 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 10 [2020-10-20 00:46:59,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:46:59,823 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2020-10-20 00:46:59,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 00:46:59,823 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2020-10-20 00:46:59,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 00:46:59,824 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:46:59,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:00,041 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 00:47:00,041 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:00,042 INFO L82 PathProgramCache]: Analyzing trace with hash 220243125, now seen corresponding path program 1 times [2020-10-20 00:47:00,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:47:00,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369240030] [2020-10-20 00:47:00,043 INFO L95 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 [2020-10-20 00:47:00,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:00,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-20 00:47:00,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:00,236 INFO L384 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 [2020-10-20 00:47:00,237 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,248 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,249 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,249 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-10-20 00:47:00,336 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,336 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-20 00:47:00,338 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,456 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-10-20 00:47:00,457 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,472 INFO L384 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 27 treesize of output 15 [2020-10-20 00:47:00,473 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,519 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,527 INFO L384 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 27 treesize of output 15 [2020-10-20 00:47:00,527 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,559 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,560 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,560 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:73, output treesize:39 [2020-10-20 00:47:00,607 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 4=[|v_#memory_$Pointer$.base_33|, |v_#memory_$Pointer$.offset_33|]} [2020-10-20 00:47:00,624 INFO L384 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 19 treesize of output 11 [2020-10-20 00:47:00,624 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,697 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,724 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,725 INFO L384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 73 [2020-10-20 00:47:00,730 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,805 INFO L625 ElimStorePlain]: treesize reduction 16, result has 83.2 percent of original size [2020-10-20 00:47:00,818 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2020-10-20 00:47:00,820 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,850 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:00,851 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:00,852 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:114, output treesize:52 [2020-10-20 00:47:00,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:00,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:00,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:47:00,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 00:47:01,073 INFO L441 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_34|]} [2020-10-20 00:47:01,085 INFO L384 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 38 treesize of output 24 [2020-10-20 00:47:01,087 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 00:47:01,134 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:01,141 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-10-20 00:47:01,174 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:01,182 INFO L545 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2020-10-20 00:47:01,206 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:01,207 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-10-20 00:47:01,208 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:69, output treesize:39 [2020-10-20 00:47:01,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,394 INFO L384 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 590 treesize of output 574 [2020-10-20 00:47:01,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,398 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:47:01,399 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:47:01,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,415 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:47:01,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,419 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:01,426 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:02,456 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 77 DAG size of output: 42 [2020-10-20 00:47:02,457 INFO L625 ElimStorePlain]: treesize reduction 878, result has 8.7 percent of original size [2020-10-20 00:47:02,483 INFO L384 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 316 treesize of output 308 [2020-10-20 00:47:02,484 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 00:47:02,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,499 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,505 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,516 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2020-10-20 00:47:02,974 WARN L193 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2020-10-20 00:47:02,975 INFO L625 ElimStorePlain]: treesize reduction 926, result has 8.8 percent of original size [2020-10-20 00:47:02,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:02,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:47:02,989 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 00:47:02,991 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2020-10-20 00:47:03,001 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:81 [2020-10-20 00:47:03,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:03,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 00:47:03,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 00:47:03,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369240030] [2020-10-20 00:47:03,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 00:47:03,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-10-20 00:47:03,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146999024] [2020-10-20 00:47:03,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 00:47:03,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 00:47:03,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 00:47:03,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-20 00:47:03,115 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand 11 states. [2020-10-20 00:47:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 00:47:04,779 INFO L93 Difference]: Finished difference Result 136 states and 160 transitions. [2020-10-20 00:47:04,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 00:47:04,781 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 17 [2020-10-20 00:47:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 00:47:04,782 INFO L225 Difference]: With dead ends: 136 [2020-10-20 00:47:04,782 INFO L226 Difference]: Without dead ends: 87 [2020-10-20 00:47:04,783 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-10-20 00:47:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-20 00:47:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 72. [2020-10-20 00:47:04,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-20 00:47:04,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2020-10-20 00:47:04,793 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 17 [2020-10-20 00:47:04,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 00:47:04,793 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2020-10-20 00:47:04,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 00:47:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2020-10-20 00:47:04,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 00:47:04,794 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 00:47:04,794 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 00:47:05,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 00:47:05,009 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 00:47:05,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 00:47:05,009 INFO L82 PathProgramCache]: Analyzing trace with hash 314624536, now seen corresponding path program 1 times [2020-10-20 00:47:05,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 00:47:05,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207208450] [2020-10-20 00:47:05,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-20 00:47:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:05,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 23 conjunts are in the unsatisfiable core [2020-10-20 00:47:05,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:05,115 INFO L384 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 [2020-10-20 00:47:05,116 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,125 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,125 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,125 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-10-20 00:47:05,192 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,192 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-20 00:47:05,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207208450] [2020-10-20 00:47:05,196 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 1) [2020-10-20 00:47:05,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1784871738] [2020-10-20 00:47:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 00:47:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:05,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-20 00:47:05,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:05,371 INFO L384 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 [2020-10-20 00:47:05,371 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,379 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,380 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2020-10-20 00:47:05,437 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,437 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-20 00:47:05,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 00:47:05,441 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 1) [2020-10-20 00:47:05,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802375393] [2020-10-20 00:47:05,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 00:47:05,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-20 00:47:05,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 00:47:05,520 INFO L384 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 [2020-10-20 00:47:05,520 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,529 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,529 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,530 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 00:47:05,609 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,610 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2020-10-20 00:47:05,610 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,705 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,715 INFO L384 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 27 treesize of output 15 [2020-10-20 00:47:05,715 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,745 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,754 INFO L384 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 27 treesize of output 15 [2020-10-20 00:47:05,755 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,777 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,778 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,778 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:70, output treesize:36 [2020-10-20 00:47:05,812 INFO L441 ElimStorePlain]: Different costs {0=[|v_#memory_int_39|], 4=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_40|]} [2020-10-20 00:47:05,822 INFO L384 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 19 treesize of output 11 [2020-10-20 00:47:05,823 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,886 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,894 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2020-10-20 00:47:05,905 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:05,932 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,968 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:05,969 INFO L384 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 90 [2020-10-20 00:47:05,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 00:47:05,972 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:06,002 INFO L625 ElimStorePlain]: treesize reduction 56, result has 46.7 percent of original size [2020-10-20 00:47:06,003 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 00:47:06,003 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:111, output treesize:49 [2020-10-20 00:47:06,083 INFO L384 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 26 treesize of output 10 [2020-10-20 00:47:06,084 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:06,104 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:06,115 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 00:47:06,115 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2020-10-20 00:47:06,116 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 00:47:06,134 INFO L625 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2020-10-20 00:47:06,135 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 00:47:06,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-20 00:47:06,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-20 00:47:06,135 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-20 00:47:06,135 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 00:47:06,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 mathsat -unsat_core_generation=3,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 00:47:06,761 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-20 00:47:06,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 12:47:06 BoogieIcfgContainer [2020-10-20 00:47:06,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 00:47:06,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 00:47:06,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 00:47:06,762 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 00:47:06,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 12:46:58" (3/4) ... [2020-10-20 00:47:06,766 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 00:47:06,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 00:47:06,767 INFO L168 Benchmark]: Toolchain (without parser) took 9852.74 ms. Allocated memory was 43.0 MB in the beginning and 64.0 MB in the end (delta: 21.0 MB). Free memory was 20.0 MB in the beginning and 14.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 26.3 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,768 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 32.0 MB. Free memory was 8.9 MB in the beginning and 8.9 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,769 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.20 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 19.1 MB in the beginning and 22.9 MB in the end (delta: -3.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,770 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.57 ms. Allocated memory is still 45.6 MB. Free memory was 22.9 MB in the beginning and 20.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,770 INFO L168 Benchmark]: Boogie Preprocessor took 49.40 ms. Allocated memory is still 45.6 MB. Free memory was 20.4 MB in the beginning and 17.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,771 INFO L168 Benchmark]: RCFGBuilder took 694.26 ms. Allocated memory was 45.6 MB in the beginning and 47.7 MB in the end (delta: 2.1 MB). Free memory was 17.8 MB in the beginning and 23.3 MB in the end (delta: -5.4 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,772 INFO L168 Benchmark]: TraceAbstraction took 8424.97 ms. Allocated memory was 47.7 MB in the beginning and 64.0 MB in the end (delta: 16.3 MB). Free memory was 22.6 MB in the beginning and 15.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,772 INFO L168 Benchmark]: Witness Printer took 4.14 ms. Allocated memory is still 64.0 MB. Free memory was 15.3 MB in the beginning and 14.6 MB in the end (delta: 695.3 kB). Peak memory consumption was 695.3 kB. Max. memory is 14.3 GB. [2020-10-20 00:47:06,776 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 32.0 MB. Free memory was 8.9 MB in the beginning and 8.9 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 607.20 ms. Allocated memory was 43.0 MB in the beginning and 45.6 MB in the end (delta: 2.6 MB). Free memory was 19.1 MB in the beginning and 22.9 MB in the end (delta: -3.8 MB). Peak memory consumption was 9.6 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 58.57 ms. Allocated memory is still 45.6 MB. Free memory was 22.9 MB in the beginning and 20.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 49.40 ms. Allocated memory is still 45.6 MB. Free memory was 20.4 MB in the beginning and 17.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 694.26 ms. Allocated memory was 45.6 MB in the beginning and 47.7 MB in the end (delta: 2.1 MB). Free memory was 17.8 MB in the beginning and 23.3 MB in the end (delta: -5.4 MB). Peak memory consumption was 8.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 8424.97 ms. Allocated memory was 47.7 MB in the beginning and 64.0 MB in the end (delta: 16.3 MB). Free memory was 22.6 MB in the beginning and 15.3 MB in the end (delta: 7.3 MB). Peak memory consumption was 23.6 MB. Max. memory is 14.3 GB. * Witness Printer took 4.14 ms. Allocated memory is still 64.0 MB. Free memory was 15.3 MB in the beginning and 14.6 MB in the end (delta: 695.3 kB). Peak memory consumption was 695.3 kB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 985]: 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: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int marked = 0; [L1004] COND TRUE __VERIFIER_nondet_int() || !marked [L1007] x->next = malloc(sizeof(SLL)) [L1008] EXPR x->next [L1008] x = x->next [L1009] x->next = ((void*)0) [L1011] COND TRUE __VERIFIER_nondet_int() [L1013] marked = 1 [L1016] COND TRUE \read(marked) [L1017] x->data = 1 [L1004] COND FALSE !(__VERIFIER_nondet_int() || !marked) [L1022] x = head [L1024] COND FALSE !(!(((void*)0) != x)) [L1025] marked = 0 [L1027] EXPR x->next [L1027] x->next != ((void*)0) && x->next->data == 0 [L1027] EXPR x->next [L1027] EXPR x->next->data [L1027] x->next != ((void*)0) && x->next->data == 0 [L1027] COND FALSE !(x->next != ((void*)0) && x->next->data == 0) [L1033] EXPR x->next [L1033] COND TRUE x->next != ((void*)0) && __VERIFIER_nondet_int() [L1035] EXPR x->next [L1035] x = x->next [L1036] EXPR x->data [L1036] COND TRUE !(x->data == 1) [L985] COND FALSE !(0) [L985] __assert_fail ("0", "sll-sorted-2.c", 16, __extension__ __PRETTY_FUNCTION__) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 8.3s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 244 SDtfs, 233 SDslu, 323 SDs, 0 SdLazy, 221 SolverSat, 27 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 74 ConstructedInterpolants, 3 QuantifiedInterpolants, 12254 SizeOfPredicates, 22 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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...