./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.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/ldv-regression/rule60_list2.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 10cd30ad3ca5cbac349bf58887b96141941b6c91 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 23:53:08,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:53:08,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:53:08,486 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:53:08,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:53:08,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:53:08,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:53:08,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:53:08,493 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:53:08,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:53:08,495 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:53:08,497 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:53:08,497 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:53:08,498 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:53:08,499 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:53:08,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:53:08,502 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:53:08,503 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:53:08,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:53:08,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:53:08,509 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:53:08,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:53:08,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:53:08,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:53:08,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:53:08,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:53:08,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:53:08,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:53:08,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:53:08,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:53:08,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:53:08,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:53:08,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:53:08,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:53:08,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:53:08,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:53:08,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:53:08,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:53:08,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:53:08,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:53:08,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:53:08,526 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:53:08,543 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:53:08,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:53:08,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:53:08,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:53:08,546 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:53:08,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:53:08,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:53:08,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:53:08,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:53:08,547 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:53:08,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:53:08,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:53:08,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:53:08,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:53:08,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:53:08,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:53:08,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:53:08,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:53:08,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:53:08,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:53:08,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:53:08,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:53:08,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:53:08,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:53:08,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:53:08,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:53:08,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:53:08,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:53:08,552 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 -> 10cd30ad3ca5cbac349bf58887b96141941b6c91 [2019-11-27 23:53:08,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:53:08,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:53:08,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:53:08,909 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:53:08,910 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:53:08,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.i [2019-11-27 23:53:08,987 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfccc1127/cdcec73842ad40f3b513e2aee7fbb54b/FLAG037bffd68 [2019-11-27 23:53:09,567 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:53:09,568 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.i [2019-11-27 23:53:09,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfccc1127/cdcec73842ad40f3b513e2aee7fbb54b/FLAG037bffd68 [2019-11-27 23:53:09,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfccc1127/cdcec73842ad40f3b513e2aee7fbb54b [2019-11-27 23:53:09,894 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:53:09,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:53:09,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:09,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:53:09,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:53:09,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:09,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@177923f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:09, skipping insertion in model container [2019-11-27 23:53:09,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:53:09" (1/1) ... [2019-11-27 23:53:09,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:53:09,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:53:10,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:10,375 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:53:10,415 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:53:10,489 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:53:10,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10 WrapperNode [2019-11-27 23:53:10,490 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:53:10,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:10,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:53:10,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:53:10,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,528 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:53:10,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:53:10,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:53:10,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:53:10,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (1/1) ... [2019-11-27 23:53:10,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:53:10,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:53:10,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:53:10,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:53:10,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (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 23:53:10,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:53:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 23:53:10,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:53:10,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:53:11,086 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:53:11,086 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 23:53:11,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:11 BoogieIcfgContainer [2019-11-27 23:53:11,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:53:11,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:53:11,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:53:11,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:53:11,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:53:09" (1/3) ... [2019-11-27 23:53:11,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e41c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:11, skipping insertion in model container [2019-11-27 23:53:11,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:53:10" (2/3) ... [2019-11-27 23:53:11,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e41c77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:53:11, skipping insertion in model container [2019-11-27 23:53:11,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:11" (3/3) ... [2019-11-27 23:53:11,096 INFO L109 eAbstractionObserver]: Analyzing ICFG rule60_list2.i [2019-11-27 23:53:11,106 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:53:11,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-27 23:53:11,126 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-27 23:53:11,148 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:53:11,149 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:53:11,149 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:53:11,149 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:53:11,149 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:53:11,149 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:53:11,149 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:53:11,149 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:53:11,165 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-27 23:53:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-11-27 23:53:11,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,172 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-11-27 23:53:11,173 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:11,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-27 23:53:11,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614598595] [2019-11-27 23:53:11,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,348 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 23:53:11,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614598595] [2019-11-27 23:53:11,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:53:11,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714266808] [2019-11-27 23:53:11,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:53:11,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:53:11,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:53:11,373 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-11-27 23:53:11,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:11,425 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2019-11-27 23:53:11,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:53:11,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-11-27 23:53:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:11,438 INFO L225 Difference]: With dead ends: 73 [2019-11-27 23:53:11,439 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 23:53:11,443 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 23:53:11,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 23:53:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-27 23:53:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-11-27 23:53:11,483 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2019-11-27 23:53:11,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:11,483 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-11-27 23:53:11,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:53:11,484 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-11-27 23:53:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:53:11,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,485 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:11,485 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:11,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2019-11-27 23:53:11,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955674673] [2019-11-27 23:53:11,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,606 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 23:53:11,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955674673] [2019-11-27 23:53:11,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:53:11,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96786983] [2019-11-27 23:53:11,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:11,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:11,611 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-11-27 23:53:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:11,724 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2019-11-27 23:53:11,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:11,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-11-27 23:53:11,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:11,725 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:53:11,726 INFO L226 Difference]: Without dead ends: 32 [2019-11-27 23:53:11,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:11,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-27 23:53:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-11-27 23:53:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2019-11-27 23:53:11,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2019-11-27 23:53:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:11,733 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2019-11-27 23:53:11,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:11,733 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2019-11-27 23:53:11,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:53:11,734 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:11,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:11,735 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:11,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2019-11-27 23:53:11,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:11,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642467650] [2019-11-27 23:53:11,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:11,865 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 23:53:11,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642467650] [2019-11-27 23:53:11,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:11,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:53:11,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017942490] [2019-11-27 23:53:11,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:53:11,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:11,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:53:11,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:11,868 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2019-11-27 23:53:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,127 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2019-11-27 23:53:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:53:12,128 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-27 23:53:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,129 INFO L225 Difference]: With dead ends: 42 [2019-11-27 23:53:12,129 INFO L226 Difference]: Without dead ends: 40 [2019-11-27 23:53:12,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:53:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-27 23:53:12,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2019-11-27 23:53:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:53:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-27 23:53:12,143 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-11-27 23:53:12,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,143 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-27 23:53:12,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:53:12,152 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-27 23:53:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:12,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:12,154 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:12,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2019-11-27 23:53:12,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583170279] [2019-11-27 23:53:12,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,271 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 23:53:12,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583170279] [2019-11-27 23:53:12,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:12,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:53:12,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230985992] [2019-11-27 23:53:12,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:12,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:12,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:12,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:12,278 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2019-11-27 23:53:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,331 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-11-27 23:53:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:53:12,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-27 23:53:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,335 INFO L225 Difference]: With dead ends: 51 [2019-11-27 23:53:12,335 INFO L226 Difference]: Without dead ends: 28 [2019-11-27 23:53:12,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:53:12,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-27 23:53:12,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-27 23:53:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-27 23:53:12,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-11-27 23:53:12,350 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-11-27 23:53:12,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,350 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-11-27 23:53:12,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-11-27 23:53:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:12,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:12,353 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:12,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2019-11-27 23:53:12,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427965917] [2019-11-27 23:53:12,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:12,582 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 23:53:12,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427965917] [2019-11-27 23:53:12,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:12,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-27 23:53:12,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163129478] [2019-11-27 23:53:12,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:53:12,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:12,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:53:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:53:12,585 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2019-11-27 23:53:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:12,920 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2019-11-27 23:53:12,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:53:12,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2019-11-27 23:53:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:12,921 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:53:12,922 INFO L226 Difference]: Without dead ends: 36 [2019-11-27 23:53:12,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:53:12,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-27 23:53:12,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-11-27 23:53:12,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-11-27 23:53:12,929 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2019-11-27 23:53:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:12,929 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-11-27 23:53:12,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:53:12,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-11-27 23:53:12,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-27 23:53:12,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:12,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:12,931 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:12,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:12,931 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2019-11-27 23:53:12,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:12,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739603724] [2019-11-27 23:53:12,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:13,088 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 23:53:13,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739603724] [2019-11-27 23:53:13,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:13,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 23:53:13,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078249194] [2019-11-27 23:53:13,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:53:13,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:53:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:53:13,091 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2019-11-27 23:53:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:13,280 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-27 23:53:13,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:53:13,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-27 23:53:13,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:13,282 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:53:13,282 INFO L226 Difference]: Without dead ends: 36 [2019-11-27 23:53:13,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:53:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-27 23:53:13,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-11-27 23:53:13,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 23:53:13,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-11-27 23:53:13,288 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2019-11-27 23:53:13,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:13,289 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-11-27 23:53:13,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:53:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-11-27 23:53:13,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:13,290 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:13,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:13,291 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:13,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2019-11-27 23:53:13,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:13,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067248693] [2019-11-27 23:53:13,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:13,418 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 23:53:13,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067248693] [2019-11-27 23:53:13,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:13,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 23:53:13,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578767667] [2019-11-27 23:53:13,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:53:13,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:53:13,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:53:13,421 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 10 states. [2019-11-27 23:53:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:13,727 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2019-11-27 23:53:13,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:53:13,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-27 23:53:13,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:13,729 INFO L225 Difference]: With dead ends: 38 [2019-11-27 23:53:13,730 INFO L226 Difference]: Without dead ends: 30 [2019-11-27 23:53:13,730 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:53:13,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-27 23:53:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-27 23:53:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2019-11-27 23:53:13,735 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2019-11-27 23:53:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:13,735 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2019-11-27 23:53:13,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:53:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2019-11-27 23:53:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:13,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:13,737 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:13,737 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:13,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:13,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2019-11-27 23:53:13,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:13,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429676271] [2019-11-27 23:53:13,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:13,903 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 23:53:13,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429676271] [2019-11-27 23:53:13,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:13,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-27 23:53:13,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570086351] [2019-11-27 23:53:13,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:53:13,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:13,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:53:13,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:53:13,906 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2019-11-27 23:53:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:14,403 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-11-27 23:53:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:53:14,404 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-11-27 23:53:14,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:14,405 INFO L225 Difference]: With dead ends: 40 [2019-11-27 23:53:14,405 INFO L226 Difference]: Without dead ends: 34 [2019-11-27 23:53:14,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-11-27 23:53:14,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-27 23:53:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2019-11-27 23:53:14,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-27 23:53:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-11-27 23:53:14,416 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2019-11-27 23:53:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:14,418 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-11-27 23:53:14,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:53:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-11-27 23:53:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:14,419 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:14,419 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:14,420 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2019-11-27 23:53:14,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:14,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647572813] [2019-11-27 23:53:14,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:14,508 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 23:53:14,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647572813] [2019-11-27 23:53:14,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:14,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 23:53:14,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795864444] [2019-11-27 23:53:14,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 23:53:14,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:14,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 23:53:14,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:53:14,512 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 5 states. [2019-11-27 23:53:14,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:14,568 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-27 23:53:14,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:53:14,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-27 23:53:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:14,573 INFO L225 Difference]: With dead ends: 36 [2019-11-27 23:53:14,573 INFO L226 Difference]: Without dead ends: 26 [2019-11-27 23:53:14,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-27 23:53:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-27 23:53:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-27 23:53:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-27 23:53:14,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2019-11-27 23:53:14,577 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2019-11-27 23:53:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:14,578 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2019-11-27 23:53:14,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 23:53:14,578 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2019-11-27 23:53:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:53:14,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:53:14,579 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:53:14,579 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:53:14,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:53:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2019-11-27 23:53:14,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:53:14,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892723513] [2019-11-27 23:53:14,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:53:14,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:53:14,709 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 23:53:14,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892723513] [2019-11-27 23:53:14,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:53:14,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-27 23:53:14,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607021733] [2019-11-27 23:53:14,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-27 23:53:14,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:53:14,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-27 23:53:14,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:53:14,712 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 13 states. [2019-11-27 23:53:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:53:15,060 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-11-27 23:53:15,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 23:53:15,060 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-27 23:53:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:53:15,061 INFO L225 Difference]: With dead ends: 26 [2019-11-27 23:53:15,061 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:53:15,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:53:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:53:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:53:15,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:53:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:53:15,063 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2019-11-27 23:53:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:53:15,063 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:53:15,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-27 23:53:15,063 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:53:15,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:53:15,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:53:15,243 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-11-27 23:53:15,409 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-11-27 23:53:15,537 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-27 23:53:15,540 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,540 INFO L246 CegarLoopResult]: For program point L895(lines 895 898) no Hoare annotation was computed. [2019-11-27 23:53:15,541 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,541 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:53:15,541 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:53:15,541 INFO L242 CegarLoopResult]: At program point L879(lines 878 880) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 ~guard_malloc_counter~0.base)) (.cse2 (= 0 |ULTIMATE.start_my_malloc_#res.base|)) (.cse3 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= 0 |ULTIMATE.start___getMemory_#res.base|) .cse1 .cse2 .cse3) (and (<= 1 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= ~elem~0.base |ULTIMATE.start_my_malloc_#res.base|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse1 .cse2 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)))) [2019-11-27 23:53:15,541 INFO L242 CegarLoopResult]: At program point L879-1(lines 878 880) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse4 (= 0 ~guard_malloc_counter~0.base)) (.cse2 (= 0 |ULTIMATE.start_my_malloc_#res.base|)) (.cse5 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 .cse1 .cse2) (let ((.cse3 (+ ULTIMATE.start_main_~dev1~0.offset 1))) (and (<= .cse3 |ULTIMATE.start_my_malloc_#res.offset|) (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) .cse0 (<= 1 ULTIMATE.start_main_~dev1~0.offset) (= ~elem~0.base |ULTIMATE.start_my_malloc_#res.base|) (<= |ULTIMATE.start_my_malloc_#res.offset| ~guard_malloc_counter~0.offset) .cse4 .cse2 .cse5 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|) (<= .cse3 |ULTIMATE.start___getMemory_#res.offset|))) (and (= 0 ULTIMATE.start_main_~dev1~0.base) .cse0 .cse1 .cse4 .cse2 .cse5 (= ULTIMATE.start_main_~dev1~0.offset 0)))) [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L871(line 871) no Hoare annotation was computed. [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L871-2(line 871) no Hoare annotation was computed. [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L4(lines 1 917) no Hoare annotation was computed. [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L4-1(lines 1 917) no Hoare annotation was computed. [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L4-2(lines 1 917) no Hoare annotation was computed. [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L4-3(lines 1 917) no Hoare annotation was computed. [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L896(lines 896 897) no Hoare annotation was computed. [2019-11-27 23:53:15,542 INFO L246 CegarLoopResult]: For program point L4-4(lines 1 917) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L889(lines 889 893) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L889-1(lines 889 893) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L906(lines 906 915) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L873(lines 873 874) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L873-1(lines 873 874) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,543 INFO L246 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L6-2(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L6-3(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L6-4(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L890(line 890) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L890-2(line 890) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L890-4(line 890) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L891(lines 891 892) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point L891-2(lines 891 892) no Hoare annotation was computed. [2019-11-27 23:53:15,544 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,545 INFO L246 CegarLoopResult]: For program point L891-4(lines 891 892) no Hoare annotation was computed. [2019-11-27 23:53:15,545 INFO L242 CegarLoopResult]: At program point L916(lines 902 917) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2019-11-27 23:53:15,545 INFO L242 CegarLoopResult]: At program point L875(lines 869 876) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse2 (= 0 ~guard_malloc_counter~0.base)) (.cse3 (= ~elem~0.offset 0))) (or (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)) (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse0 .cse1 .cse2 .cse3))) [2019-11-27 23:53:15,545 INFO L242 CegarLoopResult]: At program point L875-1(lines 869 876) the Hoare annotation is: (let ((.cse1 (= 0 |ULTIMATE.start___getMemory_#res.base|)) (.cse0 (= ULTIMATE.start___getMemory_~size 8)) (.cse2 (= 0 ~guard_malloc_counter~0.base)) (.cse3 (= ~elem~0.offset 0))) (or (and (= |ULTIMATE.start___getMemory_#res.offset| 0) .cse0 .cse1) (and (= 0 ULTIMATE.start_main_~dev1~0.base) .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_main_~dev1~0.offset 0)) (and (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) .cse1 .cse0 (<= 1 ULTIMATE.start_main_~dev1~0.offset) .cse2 .cse3 (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|) (<= (+ ULTIMATE.start_main_~dev1~0.offset 1) |ULTIMATE.start___getMemory_#res.offset|)))) [2019-11-27 23:53:15,545 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:53:15,545 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2019-11-27 23:53:15,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:53:15 BoogieIcfgContainer [2019-11-27 23:53:15,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:53:15,576 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:53:15,576 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:53:15,576 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:53:15,577 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:53:11" (3/4) ... [2019-11-27 23:53:15,581 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:53:15,598 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-27 23:53:15,598 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-27 23:53:15,599 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 23:53:15,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((size == 8 && 0 == \result) && 0 == guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) || ((((\result == 0 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) [2019-11-27 23:53:15,624 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) || (((((((((1 <= \result && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) [2019-11-27 23:53:15,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == 0 && size == 8) && 0 == \result) || (((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) && dev1 == 0)) || ((((((((\result == dev1 && 0 == \result) && size == 8) && 1 <= dev1) && 0 == guard_malloc_counter) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result) [2019-11-27 23:53:15,625 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == \result) || (((((((((((dev1 + 1 <= \result && \result == dev1) && size == 8) && 1 <= dev1) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result)) || ((((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && dev1 == 0) [2019-11-27 23:53:15,663 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:53:15,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:53:15,666 INFO L168 Benchmark]: Toolchain (without parser) took 5770.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 961.7 MB in the beginning and 985.8 MB in the end (delta: -24.1 MB). Peak memory consumption was 194.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,666 INFO L168 Benchmark]: CDTParser took 0.64 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 23:53:15,667 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.91 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,668 INFO L168 Benchmark]: Boogie Preprocessor took 29.86 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-27 23:53:15,668 INFO L168 Benchmark]: RCFGBuilder took 501.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,669 INFO L168 Benchmark]: TraceAbstraction took 4486.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 985.8 MB in the end (delta: 93.9 MB). Peak memory consumption was 180.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:53:15,670 INFO L168 Benchmark]: Witness Printer took 88.02 ms. Allocated memory is still 1.2 GB. Free memory was 985.8 MB in the beginning and 985.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-11-27 23:53:15,673 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.64 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 592.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -144.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.91 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.86 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 501.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4486.46 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 87.0 MB). Free memory was 1.1 GB in the beginning and 985.8 MB in the end (delta: 93.9 MB). Peak memory consumption was 180.9 MB. Max. memory is 11.5 GB. * Witness Printer took 88.02 ms. Allocated memory is still 1.2 GB. Free memory was 985.8 MB in the beginning and 985.8 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 902]: Loop Invariant Derived loop invariant: size == 8 - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: (((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == \result) || (((((((((((dev1 + 1 <= \result && \result == dev1) && size == 8) && 1 <= dev1) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result)) || ((((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && dev1 == 0) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((((((size == 8 && 0 == \result) && 0 == guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) || ((((\result == 0 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: (((\result == 0 && size == 8) && 0 == \result) || (((((0 == dev1 && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && elem == 0) && dev1 == 0)) || ((((((((\result == dev1 && 0 == \result) && size == 8) && 1 <= dev1) && 0 == guard_malloc_counter) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((\result == 0 && 0 == \result) && size == 8) && 0 == \result) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) || (((((((((1 <= \result && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 5 error locations. Result: SAFE, OverallTime: 3.9s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 224 SDtfs, 658 SDslu, 521 SDs, 0 SdLazy, 804 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 34 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 16 NumberOfFragments, 236 HoareAnnotationTreeSize, 5 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 57 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 15085 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...