./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ba13ae03d66e26692285201b6dabc9984fe627f1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 22:11:10,415 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:11:10,417 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:11:10,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:11:10,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:11:10,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:11:10,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:11:10,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:11:10,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:11:10,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:11:10,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:11:10,446 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:11:10,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:11:10,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:11:10,457 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:11:10,458 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:11:10,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:11:10,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:11:10,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:11:10,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:11:10,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:11:10,478 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:11:10,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:11:10,482 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:11:10,488 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:11:10,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:11:10,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:11:10,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:11:10,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:11:10,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:11:10,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:11:10,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:11:10,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:11:10,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:11:10,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:11:10,502 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:11:10,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:11:10,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:11:10,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:11:10,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:11:10,508 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:11:10,509 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:11:10,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:11:10,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:11:10,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:11:10,550 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:11:10,551 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:11:10,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:11:10,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:11:10,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:11:10,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:11:10,555 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:11:10,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:11:10,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:11:10,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:11:10,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:11:10,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:11:10,556 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:11:10,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:11:10,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:11:10,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:11:10,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:11:10,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:11:10,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:11:10,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:11:10,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:11:10,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:11:10,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:11:10,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:11:10,563 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:11:10,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba13ae03d66e26692285201b6dabc9984fe627f1 [2019-11-27 22:11:10,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:11:10,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:11:10,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:11:10,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:11:10,965 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:11:10,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-11-27 22:11:11,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fd84b1d/c5fd9f40d8404c7489cbd5252c253bf3/FLAG45063037f [2019-11-27 22:11:11,500 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:11:11,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-11-27 22:11:11,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fd84b1d/c5fd9f40d8404c7489cbd5252c253bf3/FLAG45063037f [2019-11-27 22:11:11,870 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5fd84b1d/c5fd9f40d8404c7489cbd5252c253bf3 [2019-11-27 22:11:11,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:11:11,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:11:11,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:11:11,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:11:11,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:11:11,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:11:11" (1/1) ... [2019-11-27 22:11:11,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301a290c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:11, skipping insertion in model container [2019-11-27 22:11:11,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:11:11" (1/1) ... [2019-11-27 22:11:11,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:11:11,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:11:12,102 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:11:12,111 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:11:12,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:11:12,232 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:11:12,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12 WrapperNode [2019-11-27 22:11:12,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:11:12,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:11:12,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:11:12,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:11:12,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,264 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,294 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:11:12,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:11:12,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:11:12,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:11:12,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,310 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,335 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... [2019-11-27 22:11:12,340 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:11:12,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:11:12,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:11:12,341 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:11:12,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:11:12,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 22:11:12,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:11:12,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:11:12,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 22:11:12,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 22:11:12,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 22:11:12,868 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:11:12,868 INFO L297 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-27 22:11:12,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:11:12 BoogieIcfgContainer [2019-11-27 22:11:12,871 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:11:12,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:11:12,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:11:12,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:11:12,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:11:11" (1/3) ... [2019-11-27 22:11:12,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579d1cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:11:12, skipping insertion in model container [2019-11-27 22:11:12,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:11:12" (2/3) ... [2019-11-27 22:11:12,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@579d1cd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:11:12, skipping insertion in model container [2019-11-27 22:11:12,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:11:12" (3/3) ... [2019-11-27 22:11:12,883 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2019-11-27 22:11:12,891 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:11:12,897 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-27 22:11:12,909 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-27 22:11:12,931 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:11:12,932 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:11:12,932 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:11:12,932 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:11:12,932 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:11:12,933 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:11:12,933 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:11:12,933 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:11:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-11-27 22:11:12,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-27 22:11:12,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:11:12,957 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:11:12,958 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:11:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:11:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash 212109301, now seen corresponding path program 1 times [2019-11-27 22:11:12,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:11:12,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471231105] [2019-11-27 22:11:12,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:11:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:11:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:11:13,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471231105] [2019-11-27 22:11:13,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:11:13,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:11:13,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975724169] [2019-11-27 22:11:13,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:11:13,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:11:13,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:11:13,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:11:13,149 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-11-27 22:11:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:11:13,294 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2019-11-27 22:11:13,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:11:13,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-27 22:11:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:11:13,311 INFO L225 Difference]: With dead ends: 137 [2019-11-27 22:11:13,311 INFO L226 Difference]: Without dead ends: 85 [2019-11-27 22:11:13,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:11:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-27 22:11:13,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2019-11-27 22:11:13,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-27 22:11:13,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-11-27 22:11:13,360 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 8 [2019-11-27 22:11:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:11:13,360 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-27 22:11:13,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:11:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-11-27 22:11:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 22:11:13,361 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:11:13,361 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:11:13,362 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:11:13,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:11:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1436007159, now seen corresponding path program 1 times [2019-11-27 22:11:13,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:11:13,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8428438] [2019-11-27 22:11:13,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:11:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:11:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:11:13,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8428438] [2019-11-27 22:11:13,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323611605] [2019-11-27 22:11:13,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:11:13,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:11:13,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:11:13,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:11:13,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:11:13,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:11:13,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-27 22:11:13,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582668609] [2019-11-27 22:11:13,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:11:13,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:11:13,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:11:13,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:11:13,522 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 5 states. [2019-11-27 22:11:13,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:11:13,681 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2019-11-27 22:11:13,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:11:13,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-27 22:11:13,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:11:13,684 INFO L225 Difference]: With dead ends: 166 [2019-11-27 22:11:13,684 INFO L226 Difference]: Without dead ends: 126 [2019-11-27 22:11:13,685 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:11:13,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-27 22:11:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 47. [2019-11-27 22:11:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 22:11:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-11-27 22:11:13,695 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 10 [2019-11-27 22:11:13,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:11:13,695 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-11-27 22:11:13,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:11:13,696 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-11-27 22:11:13,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-27 22:11:13,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:11:13,697 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:11:13,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:11:13,901 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:11:13,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:11:13,902 INFO L82 PathProgramCache]: Analyzing trace with hash 780809593, now seen corresponding path program 2 times [2019-11-27 22:11:13,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:11:13,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767581154] [2019-11-27 22:11:13,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:11:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:11:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 22:11:14,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767581154] [2019-11-27 22:11:14,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039659877] [2019-11-27 22:11:14,003 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:11:14,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-27 22:11:14,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 22:11:14,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 22:11:14,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:11:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 22:11:14,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:11:14,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-27 22:11:14,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929535536] [2019-11-27 22:11:14,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:11:14,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:11:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:11:14,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:11:14,084 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 4 states. [2019-11-27 22:11:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:11:14,140 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2019-11-27 22:11:14,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:11:14,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-27 22:11:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:11:14,142 INFO L225 Difference]: With dead ends: 92 [2019-11-27 22:11:14,142 INFO L226 Difference]: Without dead ends: 51 [2019-11-27 22:11:14,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 22:11:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-27 22:11:14,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-27 22:11:14,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-27 22:11:14,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-11-27 22:11:14,150 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 12 [2019-11-27 22:11:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:11:14,151 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-11-27 22:11:14,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:11:14,151 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-11-27 22:11:14,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 22:11:14,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:11:14,152 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:11:14,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:11:14,364 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:11:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:11:14,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1692621165, now seen corresponding path program 1 times [2019-11-27 22:11:14,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:11:14,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460812966] [2019-11-27 22:11:14,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:11:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:11:14,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-27 22:11:14,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460812966] [2019-11-27 22:11:14,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:11:14,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:11:14,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790655239] [2019-11-27 22:11:14,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:11:14,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:11:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:11:14,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:11:14,416 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 3 states. [2019-11-27 22:11:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:11:14,450 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2019-11-27 22:11:14,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:11:14,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-27 22:11:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:11:14,454 INFO L225 Difference]: With dead ends: 111 [2019-11-27 22:11:14,454 INFO L226 Difference]: Without dead ends: 73 [2019-11-27 22:11:14,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:11:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-27 22:11:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2019-11-27 22:11:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-27 22:11:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-11-27 22:11:14,463 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 23 [2019-11-27 22:11:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:11:14,463 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-27 22:11:14,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:11:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-11-27 22:11:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:11:14,465 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:11:14,465 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:11:14,465 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:11:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:11:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2112056943, now seen corresponding path program 1 times [2019-11-27 22:11:14,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:11:14,466 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285713022] [2019-11-27 22:11:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:11:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:11:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 22:11:14,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285713022] [2019-11-27 22:11:14,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:11:14,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:11:14,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885367008] [2019-11-27 22:11:14,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:11:14,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:11:14,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:11:14,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:11:14,561 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 4 states. [2019-11-27 22:11:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:11:14,595 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2019-11-27 22:11:14,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:11:14,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-27 22:11:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:11:14,597 INFO L225 Difference]: With dead ends: 106 [2019-11-27 22:11:14,597 INFO L226 Difference]: Without dead ends: 79 [2019-11-27 22:11:14,598 INFO L630 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 [2019-11-27 22:11:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-27 22:11:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-11-27 22:11:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-27 22:11:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-11-27 22:11:14,606 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2019-11-27 22:11:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:11:14,606 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-11-27 22:11:14,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:11:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-11-27 22:11:14,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 22:11:14,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:11:14,608 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 22:11:14,608 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:11:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:11:14,609 INFO L82 PathProgramCache]: Analyzing trace with hash -930350137, now seen corresponding path program 1 times [2019-11-27 22:11:14,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:11:14,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264075410] [2019-11-27 22:11:14,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:11:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:11:14,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-27 22:11:14,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264075410] [2019-11-27 22:11:14,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:11:14,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:11:14,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731225098] [2019-11-27 22:11:14,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:11:14,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:11:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:11:14,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:11:14,682 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 4 states. [2019-11-27 22:11:14,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:11:14,708 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-11-27 22:11:14,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:11:14,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-27 22:11:14,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:11:14,709 INFO L225 Difference]: With dead ends: 64 [2019-11-27 22:11:14,709 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:11:14,710 INFO L630 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 [2019-11-27 22:11:14,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:11:14,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:11:14,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:11:14,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:11:14,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-27 22:11:14,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:11:14,711 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:11:14,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:11:14,712 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:11:14,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:11:14,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:11:14,913 INFO L246 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,913 INFO L246 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,914 INFO L246 CegarLoopResult]: For program point L2-4(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,914 INFO L246 CegarLoopResult]: For program point L2-5(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,914 INFO L246 CegarLoopResult]: For program point L2-7(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,914 INFO L246 CegarLoopResult]: For program point L2-8(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,914 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,914 INFO L246 CegarLoopResult]: For program point L2-9(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,915 INFO L246 CegarLoopResult]: For program point L2-11(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,915 INFO L246 CegarLoopResult]: For program point L44-2(lines 44 48) no Hoare annotation was computed. [2019-11-27 22:11:14,915 INFO L246 CegarLoopResult]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2019-11-27 22:11:14,915 INFO L242 CegarLoopResult]: At program point L44-3(lines 44 48) the Hoare annotation is: (and (= 0 ULTIMATE.start_elem_exists_~i~0) (= ULTIMATE.start_elem_exists_~size 0) (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,916 INFO L242 CegarLoopResult]: At program point L11-3(lines 11 13) the Hoare annotation is: (and (= 0 ULTIMATE.start_elem_exists_~i~0) (= ULTIMATE.start_elem_exists_~size 0) (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,916 INFO L246 CegarLoopResult]: For program point L11-4(lines 11 13) no Hoare annotation was computed. [2019-11-27 22:11:14,916 INFO L246 CegarLoopResult]: For program point L36-2(lines 36 39) no Hoare annotation was computed. [2019-11-27 22:11:14,916 INFO L242 CegarLoopResult]: At program point L36-3(lines 36 39) the Hoare annotation is: (and (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,917 INFO L246 CegarLoopResult]: For program point L36-4(lines 36 39) no Hoare annotation was computed. [2019-11-27 22:11:14,917 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:11:14,917 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:11:14,917 INFO L246 CegarLoopResult]: For program point L28-2(lines 28 32) no Hoare annotation was computed. [2019-11-27 22:11:14,917 INFO L242 CegarLoopResult]: At program point L28-3(lines 28 32) the Hoare annotation is: (and (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,917 INFO L246 CegarLoopResult]: For program point L28-4(lines 28 32) no Hoare annotation was computed. [2019-11-27 22:11:14,918 INFO L246 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2019-11-27 22:11:14,918 INFO L246 CegarLoopResult]: For program point L45-2(lines 45 47) no Hoare annotation was computed. [2019-11-27 22:11:14,918 INFO L242 CegarLoopResult]: At program point L45-3(lines 45 47) the Hoare annotation is: false [2019-11-27 22:11:14,918 INFO L246 CegarLoopResult]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2019-11-27 22:11:14,918 INFO L242 CegarLoopResult]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2019-11-27 22:11:14,918 INFO L249 CegarLoopResult]: At program point L55(lines 16 56) the Hoare annotation is: true [2019-11-27 22:11:14,919 INFO L246 CegarLoopResult]: For program point L22-2(lines 22 25) no Hoare annotation was computed. [2019-11-27 22:11:14,919 INFO L242 CegarLoopResult]: At program point L22-3(lines 22 25) the Hoare annotation is: (and (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,919 INFO L246 CegarLoopResult]: For program point L22-4(lines 22 25) no Hoare annotation was computed. [2019-11-27 22:11:14,919 INFO L242 CegarLoopResult]: At program point L14(lines 9 15) the Hoare annotation is: (and (= 0 ULTIMATE.start_elem_exists_~i~0) (= 0 |ULTIMATE.start_elem_exists_#res|) (= ULTIMATE.start_elem_exists_~size 0) (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,919 INFO L242 CegarLoopResult]: At program point L7(lines 5 8) the Hoare annotation is: false [2019-11-27 22:11:14,920 INFO L246 CegarLoopResult]: For program point L40-2(lines 40 49) no Hoare annotation was computed. [2019-11-27 22:11:14,920 INFO L242 CegarLoopResult]: At program point L40-3(lines 40 49) the Hoare annotation is: (and (= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,920 INFO L246 CegarLoopResult]: For program point L40-4(lines 40 49) no Hoare annotation was computed. [2019-11-27 22:11:14,920 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 22:11:14,920 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,921 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-27 22:11:14,921 INFO L246 CegarLoopResult]: For program point L41-2(lines 41 43) no Hoare annotation was computed. [2019-11-27 22:11:14,921 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:11:14,921 INFO L246 CegarLoopResult]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2019-11-27 22:11:14,921 INFO L242 CegarLoopResult]: At program point L50-3(lines 50 54) the Hoare annotation is: (and (<= ULTIMATE.start_main_~n~0 0) (<= 0 ULTIMATE.start_main_~x~0)) [2019-11-27 22:11:14,921 INFO L246 CegarLoopResult]: For program point L50-4(lines 50 54) no Hoare annotation was computed. [2019-11-27 22:11:14,922 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,922 INFO L246 CegarLoopResult]: For program point L51-2(lines 51 53) no Hoare annotation was computed. [2019-11-27 22:11:14,922 INFO L242 CegarLoopResult]: At program point L51-3(lines 51 53) the Hoare annotation is: false [2019-11-27 22:11:14,922 INFO L246 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2019-11-27 22:11:14,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:11:14 BoogieIcfgContainer [2019-11-27 22:11:14,945 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:11:14,945 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:11:14,945 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:11:14,946 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:11:14,946 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:11:12" (3/4) ... [2019-11-27 22:11:14,950 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:11:14,971 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-27 22:11:14,972 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-27 22:11:14,972 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 22:11:15,029 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == i && 0 == \result) && size == 0) && n == 0) && 0 <= x [2019-11-27 22:11:15,103 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:11:15,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:11:15,106 INFO L168 Benchmark]: Toolchain (without parser) took 3230.47 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 956.3 MB in the beginning and 897.1 MB in the end (delta: 59.2 MB). Peak memory consumption was 133.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:11:15,108 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:11:15,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -106.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:11:15,109 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:11:15,109 INFO L168 Benchmark]: Boogie Preprocessor took 45.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:11:15,110 INFO L168 Benchmark]: RCFGBuilder took 530.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:11:15,110 INFO L168 Benchmark]: TraceAbstraction took 2072.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 904.2 MB in the end (delta: 130.6 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:11:15,111 INFO L168 Benchmark]: Witness Printer took 158.39 ms. Allocated memory is still 1.1 GB. Free memory is still 897.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:11:15,113 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 357.36 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 73.9 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -106.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.59 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.33 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 530.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2072.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 904.2 MB in the end (delta: 130.6 MB). Peak memory consumption was 130.6 MB. Max. memory is 11.5 GB. * Witness Printer took 158.39 ms. Allocated memory is still 1.1 GB. Free memory is still 897.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: n <= 0 && 0 <= x - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: ((0 == i && size == 0) && n == 0) && 0 <= x - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((0 == i && size == 0) && n == 0) && 0 <= x - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant Derived loop invariant: (((0 == i && 0 == \result) && size == 0) && n == 0) && 0 <= x - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: n == 0 && 0 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 3 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 248 SDtfs, 244 SDslu, 328 SDs, 0 SdLazy, 129 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=5, 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, 6 MinimizatonAttempts, 166 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 13 PreInvPairs, 26 NumberOfFragments, 82 HoareAnnotationTreeSize, 13 FomulaSimplifications, 184 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 125 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 3427 SizeOfPredicates, 3 NumberOfNonLiveVariables, 82 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 18/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...