./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 f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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.25-f470102 [2019-11-28 15:15:37,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:15:37,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:15:37,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:15:37,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:15:37,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:15:37,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:15:37,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:15:37,376 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:15:37,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:15:37,378 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:15:37,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:15:37,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:15:37,381 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:15:37,382 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:15:37,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:15:37,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:15:37,386 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:15:37,387 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:15:37,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:15:37,391 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:15:37,392 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:15:37,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:15:37,395 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:15:37,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:15:37,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:15:37,398 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:15:37,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:15:37,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:15:37,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:15:37,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:15:37,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:15:37,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:15:37,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:15:37,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:15:37,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:15:37,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:15:37,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:15:37,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:15:37,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:15:37,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:15:37,410 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:15:37,426 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:15:37,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:15:37,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:15:37,428 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:15:37,428 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:15:37,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:15:37,429 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:15:37,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:15:37,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:15:37,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:15:37,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:15:37,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:15:37,430 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:15:37,430 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:15:37,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:15:37,431 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:15:37,431 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:15:37,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:15:37,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:15:37,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:15:37,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:15:37,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:15:37,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:15:37,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:15:37,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:15:37,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:15:37,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:15:37,435 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:15:37,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:15:37,435 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-28 15:15:37,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:15:37,762 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:15:37,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:15:37,767 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:15:37,768 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:15:37,768 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-28 15:15:37,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c847e28b9/832d57d4e6dc43d88c9c32e35dd47de7/FLAGb00a43ac9 [2019-11-28 15:15:38,319 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:15:38,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/data_structures_set_multi_proc_trivial_ground.i [2019-11-28 15:15:38,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c847e28b9/832d57d4e6dc43d88c9c32e35dd47de7/FLAGb00a43ac9 [2019-11-28 15:15:38,687 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c847e28b9/832d57d4e6dc43d88c9c32e35dd47de7 [2019-11-28 15:15:38,691 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:15:38,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:15:38,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:15:38,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:15:38,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:15:38,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:38" (1/1) ... [2019-11-28 15:15:38,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34097ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:38, skipping insertion in model container [2019-11-28 15:15:38,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:15:38" (1/1) ... [2019-11-28 15:15:38,710 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:15:38,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:15:38,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:15:38,941 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:15:38,966 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:15:39,043 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:15:39,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39 WrapperNode [2019-11-28 15:15:39,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:15:39,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:15:39,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:15:39,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:15:39,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,065 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:15:39,097 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:15:39,097 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:15:39,098 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:15:39,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,110 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... [2019-11-28 15:15:39,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:15:39,130 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:15:39,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:15:39,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:15:39,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:15:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 15:15:39,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:15:39,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:15:39,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 15:15:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 15:15:39,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 15:15:39,619 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:15:39,619 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-28 15:15:39,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:39 BoogieIcfgContainer [2019-11-28 15:15:39,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:15:39,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:15:39,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:15:39,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:15:39,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:15:38" (1/3) ... [2019-11-28 15:15:39,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b229e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:15:39, skipping insertion in model container [2019-11-28 15:15:39,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:15:39" (2/3) ... [2019-11-28 15:15:39,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b229e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:15:39, skipping insertion in model container [2019-11-28 15:15:39,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:39" (3/3) ... [2019-11-28 15:15:39,630 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2019-11-28 15:15:39,639 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:15:39,646 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-28 15:15:39,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-28 15:15:39,679 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:15:39,680 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:15:39,680 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:15:39,680 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:15:39,680 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:15:39,680 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:15:39,681 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:15:39,681 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:15:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-11-28 15:15:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 15:15:39,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:15:39,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:15:39,703 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:15:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:15:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash 212109301, now seen corresponding path program 1 times [2019-11-28 15:15:39,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:15:39,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056132017] [2019-11-28 15:15:39,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:15:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:15:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:15:39,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056132017] [2019-11-28 15:15:39,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:15:39,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:15:39,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494334677] [2019-11-28 15:15:39,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:15:39,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:15:39,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:15:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:15:39,918 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2019-11-28 15:15:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:15:40,086 INFO L93 Difference]: Finished difference Result 137 states and 207 transitions. [2019-11-28 15:15:40,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:15:40,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-11-28 15:15:40,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:15:40,105 INFO L225 Difference]: With dead ends: 137 [2019-11-28 15:15:40,105 INFO L226 Difference]: Without dead ends: 85 [2019-11-28 15:15:40,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:15:40,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-11-28 15:15:40,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2019-11-28 15:15:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 15:15:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2019-11-28 15:15:40,174 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 8 [2019-11-28 15:15:40,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:15:40,176 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-28 15:15:40,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:15:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2019-11-28 15:15:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 15:15:40,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:15:40,178 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:15:40,179 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:15:40,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:15:40,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1436007159, now seen corresponding path program 1 times [2019-11-28 15:15:40,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:15:40,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819153921] [2019-11-28 15:15:40,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:15:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:15:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:15:40,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819153921] [2019-11-28 15:15:40,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969621410] [2019-11-28 15:15:40,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:15:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:15:40,320 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:15:40,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:15:40,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:15:40,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:15:40,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-11-28 15:15:40,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113017853] [2019-11-28 15:15:40,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:15:40,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:15:40,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:15:40,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:15:40,359 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand 5 states. [2019-11-28 15:15:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:15:40,541 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2019-11-28 15:15:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:15:40,542 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-28 15:15:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:15:40,544 INFO L225 Difference]: With dead ends: 166 [2019-11-28 15:15:40,544 INFO L226 Difference]: Without dead ends: 126 [2019-11-28 15:15:40,547 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-28 15:15:40,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-28 15:15:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 47. [2019-11-28 15:15:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 15:15:40,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 58 transitions. [2019-11-28 15:15:40,564 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 58 transitions. Word has length 10 [2019-11-28 15:15:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:15:40,568 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 58 transitions. [2019-11-28 15:15:40,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:15:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 58 transitions. [2019-11-28 15:15:40,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-28 15:15:40,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:15:40,572 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:15:40,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:15:40,776 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:15:40,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:15:40,776 INFO L82 PathProgramCache]: Analyzing trace with hash 780809593, now seen corresponding path program 2 times [2019-11-28 15:15:40,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:15:40,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036782467] [2019-11-28 15:15:40,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:15:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:15:40,831 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-28 15:15:40,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036782467] [2019-11-28 15:15:40,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961741468] [2019-11-28 15:15:40,834 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:15:40,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 15:15:40,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:15:40,885 INFO L264 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:15:40,886 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:15:40,918 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-28 15:15:40,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:15:40,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-28 15:15:40,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535643995] [2019-11-28 15:15:40,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:15:40,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:15:40,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:15:40,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-28 15:15:40,925 INFO L87 Difference]: Start difference. First operand 47 states and 58 transitions. Second operand 4 states. [2019-11-28 15:15:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:15:40,998 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2019-11-28 15:15:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:15:40,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-28 15:15:40,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:15:41,000 INFO L225 Difference]: With dead ends: 92 [2019-11-28 15:15:41,000 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 15:15:41,001 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-28 15:15:41,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 15:15:41,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-11-28 15:15:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-28 15:15:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-11-28 15:15:41,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 12 [2019-11-28 15:15:41,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:15:41,009 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-11-28 15:15:41,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:15:41,009 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-11-28 15:15:41,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:15:41,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:15:41,011 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-28 15:15:41,215 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:15:41,215 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:15:41,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:15:41,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1692621165, now seen corresponding path program 1 times [2019-11-28 15:15:41,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:15:41,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826846819] [2019-11-28 15:15:41,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:15:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:15:41,268 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-28 15:15:41,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826846819] [2019-11-28 15:15:41,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:15:41,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:15:41,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193753146] [2019-11-28 15:15:41,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:15:41,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:15:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:15:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:15:41,271 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 3 states. [2019-11-28 15:15:41,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:15:41,302 INFO L93 Difference]: Finished difference Result 111 states and 139 transitions. [2019-11-28 15:15:41,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:15:41,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:15:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:15:41,304 INFO L225 Difference]: With dead ends: 111 [2019-11-28 15:15:41,304 INFO L226 Difference]: Without dead ends: 73 [2019-11-28 15:15:41,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:15:41,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-28 15:15:41,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2019-11-28 15:15:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 15:15:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2019-11-28 15:15:41,313 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 23 [2019-11-28 15:15:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:15:41,313 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2019-11-28 15:15:41,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:15:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2019-11-28 15:15:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:15:41,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:15:41,315 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-28 15:15:41,316 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:15:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:15:41,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2112056943, now seen corresponding path program 1 times [2019-11-28 15:15:41,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:15:41,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209383673] [2019-11-28 15:15:41,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:15:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:15:41,379 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-28 15:15:41,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209383673] [2019-11-28 15:15:41,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:15:41,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:15:41,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760444947] [2019-11-28 15:15:41,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:15:41,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:15:41,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:15:41,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:15:41,382 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 4 states. [2019-11-28 15:15:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:15:41,411 INFO L93 Difference]: Finished difference Result 106 states and 131 transitions. [2019-11-28 15:15:41,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:15:41,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 15:15:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:15:41,413 INFO L225 Difference]: With dead ends: 106 [2019-11-28 15:15:41,413 INFO L226 Difference]: Without dead ends: 79 [2019-11-28 15:15:41,414 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-28 15:15:41,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-28 15:15:41,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2019-11-28 15:15:41,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-28 15:15:41,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2019-11-28 15:15:41,423 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2019-11-28 15:15:41,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:15:41,423 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2019-11-28 15:15:41,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:15:41,424 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2019-11-28 15:15:41,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:15:41,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:15:41,425 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-28 15:15:41,425 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:15:41,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:15:41,426 INFO L82 PathProgramCache]: Analyzing trace with hash -930350137, now seen corresponding path program 1 times [2019-11-28 15:15:41,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:15:41,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004695686] [2019-11-28 15:15:41,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:15:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:15:41,497 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-28 15:15:41,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004695686] [2019-11-28 15:15:41,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:15:41,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:15:41,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53243084] [2019-11-28 15:15:41,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:15:41,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:15:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:15:41,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:15:41,500 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 4 states. [2019-11-28 15:15:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:15:41,537 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2019-11-28 15:15:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:15:41,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-28 15:15:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:15:41,538 INFO L225 Difference]: With dead ends: 64 [2019-11-28 15:15:41,538 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:15:41,539 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-28 15:15:41,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:15:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:15:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:15:41,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:15:41,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-28 15:15:41,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:15:41,540 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:15:41,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:15:41,542 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:15:41,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:15:41,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:15:41,739 INFO L246 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,739 INFO L246 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,739 INFO L246 CegarLoopResult]: For program point L2-4(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,739 INFO L246 CegarLoopResult]: For program point L2-5(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,740 INFO L246 CegarLoopResult]: For program point L2-7(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,740 INFO L246 CegarLoopResult]: For program point L2-8(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,740 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,740 INFO L246 CegarLoopResult]: For program point L2-9(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,740 INFO L246 CegarLoopResult]: For program point L2-11(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,741 INFO L246 CegarLoopResult]: For program point L44-2(lines 44 48) no Hoare annotation was computed. [2019-11-28 15:15:41,741 INFO L246 CegarLoopResult]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2019-11-28 15:15:41,742 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-28 15:15:41,742 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-28 15:15:41,742 INFO L246 CegarLoopResult]: For program point L11-4(lines 11 13) no Hoare annotation was computed. [2019-11-28 15:15:41,742 INFO L246 CegarLoopResult]: For program point L36-2(lines 36 39) no Hoare annotation was computed. [2019-11-28 15:15:41,742 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-28 15:15:41,743 INFO L246 CegarLoopResult]: For program point L36-4(lines 36 39) no Hoare annotation was computed. [2019-11-28 15:15:41,743 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:15:41,743 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:15:41,743 INFO L246 CegarLoopResult]: For program point L28-2(lines 28 32) no Hoare annotation was computed. [2019-11-28 15:15:41,743 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-28 15:15:41,743 INFO L246 CegarLoopResult]: For program point L28-4(lines 28 32) no Hoare annotation was computed. [2019-11-28 15:15:41,744 INFO L246 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2019-11-28 15:15:41,744 INFO L246 CegarLoopResult]: For program point L45-2(lines 45 47) no Hoare annotation was computed. [2019-11-28 15:15:41,745 INFO L242 CegarLoopResult]: At program point L45-3(lines 45 47) the Hoare annotation is: false [2019-11-28 15:15:41,745 INFO L246 CegarLoopResult]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2019-11-28 15:15:41,745 INFO L242 CegarLoopResult]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2019-11-28 15:15:41,745 INFO L249 CegarLoopResult]: At program point L55(lines 16 56) the Hoare annotation is: true [2019-11-28 15:15:41,746 INFO L246 CegarLoopResult]: For program point L22-2(lines 22 25) no Hoare annotation was computed. [2019-11-28 15:15:41,746 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-28 15:15:41,746 INFO L246 CegarLoopResult]: For program point L22-4(lines 22 25) no Hoare annotation was computed. [2019-11-28 15:15:41,746 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-28 15:15:41,747 INFO L242 CegarLoopResult]: At program point L7(lines 5 8) the Hoare annotation is: false [2019-11-28 15:15:41,747 INFO L246 CegarLoopResult]: For program point L40-2(lines 40 49) no Hoare annotation was computed. [2019-11-28 15:15:41,747 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-28 15:15:41,747 INFO L246 CegarLoopResult]: For program point L40-4(lines 40 49) no Hoare annotation was computed. [2019-11-28 15:15:41,748 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 15:15:41,748 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,748 INFO L246 CegarLoopResult]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-11-28 15:15:41,748 INFO L246 CegarLoopResult]: For program point L41-2(lines 41 43) no Hoare annotation was computed. [2019-11-28 15:15:41,748 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:15:41,749 INFO L246 CegarLoopResult]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2019-11-28 15:15:41,749 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-28 15:15:41,749 INFO L246 CegarLoopResult]: For program point L50-4(lines 50 54) no Hoare annotation was computed. [2019-11-28 15:15:41,749 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,750 INFO L246 CegarLoopResult]: For program point L51-2(lines 51 53) no Hoare annotation was computed. [2019-11-28 15:15:41,750 INFO L242 CegarLoopResult]: At program point L51-3(lines 51 53) the Hoare annotation is: false [2019-11-28 15:15:41,750 INFO L246 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2019-11-28 15:15:41,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:15:41 BoogieIcfgContainer [2019-11-28 15:15:41,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:15:41,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:15:41,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:15:41,774 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:15:41,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:15:39" (3/4) ... [2019-11-28 15:15:41,781 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:15:41,800 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-11-28 15:15:41,801 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-28 15:15:41,801 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 15:15:41,860 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == i && 0 == \result) && size == 0) && n == 0) && 0 <= x [2019-11-28 15:15:41,921 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:15:41,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:15:41,929 INFO L168 Benchmark]: Toolchain (without parser) took 3233.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 957.7 MB in the beginning and 960.7 MB in the end (delta: -3.0 MB). Peak memory consumption was 134.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:15:41,930 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:15:41,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 350.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:15:41,934 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:15:41,934 INFO L168 Benchmark]: Boogie Preprocessor took 32.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:15:41,935 INFO L168 Benchmark]: RCFGBuilder took 490.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:15:41,935 INFO L168 Benchmark]: TraceAbstraction took 2151.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.7 MB in the end (delta: 135.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:15:41,936 INFO L168 Benchmark]: Witness Printer took 150.03 ms. Allocated memory is still 1.2 GB. Free memory is still 960.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:15:41,938 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.29 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 350.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.51 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 490.35 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2151.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.7 MB in the end (delta: 135.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 11.5 GB. * Witness Printer took 150.03 ms. Allocated memory is still 1.2 GB. Free memory is still 960.7 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.8s, 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.2s 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...