./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.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-2e94e6a [2018-12-31 04:22:52,043 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 04:22:52,045 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 04:22:52,056 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 04:22:52,057 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 04:22:52,058 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 04:22:52,059 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 04:22:52,061 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 04:22:52,064 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 04:22:52,065 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 04:22:52,066 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 04:22:52,066 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 04:22:52,067 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 04:22:52,069 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 04:22:52,070 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 04:22:52,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 04:22:52,074 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 04:22:52,079 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 04:22:52,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 04:22:52,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 04:22:52,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 04:22:52,092 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 04:22:52,097 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 04:22:52,097 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 04:22:52,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 04:22:52,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 04:22:52,101 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 04:22:52,102 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 04:22:52,103 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 04:22:52,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 04:22:52,107 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 04:22:52,109 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 04:22:52,109 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 04:22:52,109 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 04:22:52,110 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 04:22:52,111 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 04:22:52,111 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 04:22:52,141 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 04:22:52,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 04:22:52,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 04:22:52,143 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 04:22:52,143 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 04:22:52,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 04:22:52,144 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 04:22:52,144 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 04:22:52,144 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 04:22:52,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 04:22:52,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 04:22:52,145 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 04:22:52,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 04:22:52,145 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 04:22:52,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 04:22:52,145 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 04:22:52,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 04:22:52,147 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 04:22:52,147 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 04:22:52,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 04:22:52,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 04:22:52,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 04:22:52,148 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 04:22:52,148 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 04:22:52,148 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 04:22:52,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 04:22:52,149 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 04:22:52,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 04:22:52,149 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 [2018-12-31 04:22:52,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 04:22:52,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 04:22:52,200 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 04:22:52,201 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 04:22:52,202 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 04:22:52,202 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-12-31 04:22:52,269 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298867588/09d633c99d5042d3850266a8a8983ecb/FLAGf11c2bbaa [2018-12-31 04:22:52,809 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 04:22:52,810 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/rule60_list2_true-termination.c_true-unreach-call.i [2018-12-31 04:22:52,839 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298867588/09d633c99d5042d3850266a8a8983ecb/FLAGf11c2bbaa [2018-12-31 04:22:53,022 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/298867588/09d633c99d5042d3850266a8a8983ecb [2018-12-31 04:22:53,026 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 04:22:53,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 04:22:53,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 04:22:53,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 04:22:53,033 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 04:22:53,034 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec25a10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53, skipping insertion in model container [2018-12-31 04:22:53,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,047 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 04:22:53,090 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 04:22:53,481 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:22:53,490 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 04:22:53,562 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 04:22:53,736 INFO L195 MainTranslator]: Completed translation [2018-12-31 04:22:53,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53 WrapperNode [2018-12-31 04:22:53,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 04:22:53,739 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 04:22:53,739 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 04:22:53,740 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 04:22:53,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,772 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 04:22:53,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 04:22:53,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 04:22:53,807 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 04:22:53,817 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,825 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,850 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,853 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (1/1) ... [2018-12-31 04:22:53,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 04:22:53,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 04:22:53,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 04:22:53,857 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 04:22:53,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (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 [2018-12-31 04:22:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 04:22:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-31 04:22:53,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 04:22:53,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 04:22:54,475 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 04:22:54,475 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2018-12-31 04:22:54,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:22:54 BoogieIcfgContainer [2018-12-31 04:22:54,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 04:22:54,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 04:22:54,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 04:22:54,480 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 04:22:54,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 04:22:53" (1/3) ... [2018-12-31 04:22:54,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fbeb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:22:54, skipping insertion in model container [2018-12-31 04:22:54,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 04:22:53" (2/3) ... [2018-12-31 04:22:54,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38fbeb76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 04:22:54, skipping insertion in model container [2018-12-31 04:22:54,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:22:54" (3/3) ... [2018-12-31 04:22:54,484 INFO L112 eAbstractionObserver]: Analyzing ICFG rule60_list2_true-termination.c_true-unreach-call.i [2018-12-31 04:22:54,495 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 04:22:54,505 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2018-12-31 04:22:54,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2018-12-31 04:22:54,557 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 04:22:54,558 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 04:22:54,559 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 04:22:54,559 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 04:22:54,559 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 04:22:54,560 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 04:22:54,560 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 04:22:54,560 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 04:22:54,560 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 04:22:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-12-31 04:22:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-31 04:22:54,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:54,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-31 04:22:54,587 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:54,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:54,593 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2018-12-31 04:22:54,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:54,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:54,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:54,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:54,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:54,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:54,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 04:22:54,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 04:22:54,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 04:22:54,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 04:22:54,795 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2018-12-31 04:22:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:54,871 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2018-12-31 04:22:54,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 04:22:54,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-31 04:22:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:54,884 INFO L225 Difference]: With dead ends: 73 [2018-12-31 04:22:54,885 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 04:22:54,888 INFO L631 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 [2018-12-31 04:22:54,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 04:22:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-31 04:22:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 04:22:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-31 04:22:54,928 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 4 [2018-12-31 04:22:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:54,928 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-31 04:22:54,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 04:22:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-31 04:22:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:22:54,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:54,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:54,930 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash 170685048, now seen corresponding path program 1 times [2018-12-31 04:22:54,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:54,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:54,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:54,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:55,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:55,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:22:55,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:22:55,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:22:55,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:22:55,116 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2018-12-31 04:22:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:55,433 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-12-31 04:22:55,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:22:55,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-12-31 04:22:55,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:55,435 INFO L225 Difference]: With dead ends: 52 [2018-12-31 04:22:55,435 INFO L226 Difference]: Without dead ends: 32 [2018-12-31 04:22:55,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:22:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-31 04:22:55,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-12-31 04:22:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 04:22:55,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-31 04:22:55,442 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 15 [2018-12-31 04:22:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:55,442 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-31 04:22:55,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:22:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-31 04:22:55,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 04:22:55,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:55,444 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:55,444 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:55,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:55,444 INFO L82 PathProgramCache]: Analyzing trace with hash 227943350, now seen corresponding path program 1 times [2018-12-31 04:22:55,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:55,445 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:55,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:55,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:55,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:55,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 04:22:55,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 04:22:55,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 04:22:55,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:22:55,631 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2018-12-31 04:22:56,027 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-31 04:22:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:56,503 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-12-31 04:22:56,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 04:22:56,505 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-12-31 04:22:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:56,506 INFO L225 Difference]: With dead ends: 42 [2018-12-31 04:22:56,507 INFO L226 Difference]: Without dead ends: 40 [2018-12-31 04:22:56,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 04:22:56,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-31 04:22:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-12-31 04:22:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 04:22:56,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-12-31 04:22:56,513 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-12-31 04:22:56,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:56,514 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-12-31 04:22:56,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 04:22:56,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-12-31 04:22:56,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:22:56,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:56,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:56,515 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:56,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:56,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1186712674, now seen corresponding path program 1 times [2018-12-31 04:22:56,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:56,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:56,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:56,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:56,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:22:56,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:22:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:22:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:22:56,627 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-12-31 04:22:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:56,721 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-31 04:22:56,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 04:22:56,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-12-31 04:22:56,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:56,723 INFO L225 Difference]: With dead ends: 51 [2018-12-31 04:22:56,723 INFO L226 Difference]: Without dead ends: 28 [2018-12-31 04:22:56,724 INFO L631 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 [2018-12-31 04:22:56,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-31 04:22:56,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-31 04:22:56,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 04:22:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-31 04:22:56,729 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2018-12-31 04:22:56,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:56,730 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-31 04:22:56,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:22:56,730 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-31 04:22:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:22:56,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:56,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:56,731 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash -93151004, now seen corresponding path program 1 times [2018-12-31 04:22:56,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:56,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:56,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:56,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:56,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:56,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-31 04:22:56,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-31 04:22:56,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-31 04:22:56,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-12-31 04:22:56,969 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 12 states. [2018-12-31 04:22:57,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:57,454 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2018-12-31 04:22:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:22:57,456 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-31 04:22:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:57,457 INFO L225 Difference]: With dead ends: 38 [2018-12-31 04:22:57,457 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:22:57,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-12-31 04:22:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:22:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2018-12-31 04:22:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 04:22:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-31 04:22:57,463 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 19 [2018-12-31 04:22:57,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:57,464 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-31 04:22:57,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-31 04:22:57,464 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-31 04:22:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 04:22:57,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:57,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 04:22:57,465 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:57,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:57,466 INFO L82 PathProgramCache]: Analyzing trace with hash -93091422, now seen corresponding path program 1 times [2018-12-31 04:22:57,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:57,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:57,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:57,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:57,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:57,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:57,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 04:22:57,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 04:22:57,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 04:22:57,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 04:22:57,649 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2018-12-31 04:22:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:58,156 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-31 04:22:58,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-31 04:22:58,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-12-31 04:22:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:58,158 INFO L225 Difference]: With dead ends: 38 [2018-12-31 04:22:58,158 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 04:22:58,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:22:58,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 04:22:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2018-12-31 04:22:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 04:22:58,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-31 04:22:58,164 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2018-12-31 04:22:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:58,164 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-31 04:22:58,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 04:22:58,164 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-31 04:22:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:22:58,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:58,165 INFO L402 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] [2018-12-31 04:22:58,166 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1793070580, now seen corresponding path program 1 times [2018-12-31 04:22:58,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:58,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:58,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:58,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:58,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 04:22:58,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 04:22:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 04:22:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 04:22:58,402 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 10 states. [2018-12-31 04:22:58,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:58,733 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-31 04:22:58,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-31 04:22:58,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-31 04:22:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:58,735 INFO L225 Difference]: With dead ends: 38 [2018-12-31 04:22:58,736 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 04:22:58,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-31 04:22:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 04:22:58,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-31 04:22:58,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 04:22:58,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-31 04:22:58,741 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2018-12-31 04:22:58,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:58,742 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-31 04:22:58,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 04:22:58,742 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-31 04:22:58,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:22:58,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:58,743 INFO L402 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] [2018-12-31 04:22:58,743 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:58,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:58,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1793130162, now seen corresponding path program 1 times [2018-12-31 04:22:58,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:58,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:58,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:58,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:58,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:58,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:58,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-31 04:22:58,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-31 04:22:58,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-31 04:22:58,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-12-31 04:22:58,925 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 14 states. [2018-12-31 04:22:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:59,469 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-31 04:22:59,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-31 04:22:59,470 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-12-31 04:22:59,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:59,471 INFO L225 Difference]: With dead ends: 40 [2018-12-31 04:22:59,471 INFO L226 Difference]: Without dead ends: 34 [2018-12-31 04:22:59,472 INFO L631 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 [2018-12-31 04:22:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-31 04:22:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-31 04:22:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 04:22:59,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-31 04:22:59,477 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2018-12-31 04:22:59,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:59,477 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-31 04:22:59,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-31 04:22:59,477 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-31 04:22:59,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:22:59,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:59,478 INFO L402 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] [2018-12-31 04:22:59,479 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:59,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1850388464, now seen corresponding path program 1 times [2018-12-31 04:22:59,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:59,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:59,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:59,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:59,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:22:59,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:22:59,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:22:59,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 04:22:59,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 04:22:59,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 04:22:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 04:22:59,875 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 5 states. [2018-12-31 04:22:59,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:22:59,940 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2018-12-31 04:22:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 04:22:59,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-31 04:22:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:22:59,945 INFO L225 Difference]: With dead ends: 36 [2018-12-31 04:22:59,945 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 04:22:59,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-31 04:22:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 04:22:59,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 04:22:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 04:22:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2018-12-31 04:22:59,949 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 25 [2018-12-31 04:22:59,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:22:59,950 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2018-12-31 04:22:59,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 04:22:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2018-12-31 04:22:59,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-31 04:22:59,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 04:22:59,951 INFO L402 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] [2018-12-31 04:22:59,951 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 04:22:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 04:22:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1400103152, now seen corresponding path program 1 times [2018-12-31 04:22:59,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 04:22:59,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 04:22:59,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:59,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 04:22:59,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 04:22:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 04:23:00,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 04:23:00,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 04:23:00,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-31 04:23:00,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-31 04:23:00,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-31 04:23:00,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-12-31 04:23:00,125 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand 13 states. [2018-12-31 04:23:00,637 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 22 [2018-12-31 04:23:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 04:23:00,691 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2018-12-31 04:23:00,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-31 04:23:00,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-12-31 04:23:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 04:23:00,692 INFO L225 Difference]: With dead ends: 26 [2018-12-31 04:23:00,693 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 04:23:00,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-12-31 04:23:00,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 04:23:00,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 04:23:00,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 04:23:00,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 04:23:00,695 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-12-31 04:23:00,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 04:23:00,695 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 04:23:00,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-31 04:23:00,695 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 04:23:00,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 04:23:00,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 04:23:00,930 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-12-31 04:23:01,159 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2018-12-31 04:23:01,276 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-12-31 04:23:01,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,280 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 898) no Hoare annotation was computed. [2018-12-31 04:23:01,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 04:23:01,280 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 04:23:01,281 INFO L444 ceAbstractionStarter]: 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|))) (or (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 (= 0 |ULTIMATE.start___getMemory_#res.base|) (= 0 ~elem~0.offset) .cse1 .cse2 (= 0 |ULTIMATE.start___getMemory_#res.offset|)) (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|) (= ~elem~0.offset 0) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)))) [2018-12-31 04:23:01,281 INFO L444 ceAbstractionStarter]: 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|))) (or (and (= 0 |ULTIMATE.start_my_malloc_#res.offset|) .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start___getMemory_#res.offset|)) (let ((.cse3 (+ ULTIMATE.start_main_~dev1~0.offset 1))) (and (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) (<= 1 ULTIMATE.start_main_~dev1~0.offset) (<= .cse3 |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) .cse4 .cse2 (= ~elem~0.offset 0) (<= |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 (= ULTIMATE.start_main_~dev1~0.base 0) .cse0 .cse1 (= 0 ~elem~0.offset) .cse4 .cse2 (= ULTIMATE.start_main_~dev1~0.offset 0)))) [2018-12-31 04:23:01,281 INFO L448 ceAbstractionStarter]: For program point L871(line 871) no Hoare annotation was computed. [2018-12-31 04:23:01,281 INFO L448 ceAbstractionStarter]: For program point L871-2(line 871) no Hoare annotation was computed. [2018-12-31 04:23:01,281 INFO L448 ceAbstractionStarter]: For program point L4(lines 1 917) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point L4-1(lines 1 917) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 1 917) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point L4-3(lines 1 917) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point L896(lines 896 897) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point L4-4(lines 1 917) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 893) no Hoare annotation was computed. [2018-12-31 04:23:01,282 INFO L448 ceAbstractionStarter]: For program point L889-1(lines 889 893) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point L906(lines 906 915) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point L873(lines 873 874) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point L906-1(lines 906 915) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point L873-1(lines 873 874) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point L6-1(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,283 INFO L448 ceAbstractionStarter]: For program point L6-2(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L6-3(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L6-4(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L890(line 890) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L890-2(line 890) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L890-4(line 890) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L891(lines 891 892) no Hoare annotation was computed. [2018-12-31 04:23:01,284 INFO L448 ceAbstractionStarter]: For program point L891-2(lines 891 892) no Hoare annotation was computed. [2018-12-31 04:23:01,285 INFO L448 ceAbstractionStarter]: For program point L891-4(lines 891 892) no Hoare annotation was computed. [2018-12-31 04:23:01,285 INFO L444 ceAbstractionStarter]: At program point L916(lines 902 917) the Hoare annotation is: (= ULTIMATE.start___getMemory_~size 8) [2018-12-31 04:23:01,285 INFO L444 ceAbstractionStarter]: 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))) (or (and .cse0 .cse1 (= 0 ~elem~0.offset) .cse2 (= 0 |ULTIMATE.start___getMemory_#res.offset|)) (and .cse0 .cse1 .cse2 (<= 1 |ULTIMATE.start___getMemory_#res.offset|) (= ~elem~0.offset 0) (<= |ULTIMATE.start___getMemory_#res.offset| ~guard_malloc_counter~0.offset) (= ~elem~0.base |ULTIMATE.start___getMemory_#res.base|)))) [2018-12-31 04:23:01,285 INFO L444 ceAbstractionStarter]: 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))) (or (and .cse0 .cse1 (= 0 |ULTIMATE.start___getMemory_#res.offset|)) (and (= ULTIMATE.start_main_~dev1~0.base 0) .cse0 .cse1 (= 0 ~elem~0.offset) .cse2 (= ULTIMATE.start_main_~dev1~0.offset 0)) (and (= |ULTIMATE.start___getMemory_#res.base| ULTIMATE.start_main_~dev1~0.base) .cse1 (<= 1 ULTIMATE.start_main_~dev1~0.offset) .cse0 .cse2 (= ~elem~0.offset 0) (<= |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|)))) [2018-12-31 04:23:01,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 04:23:01,285 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-12-31 04:23:01,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 04:23:01 BoogieIcfgContainer [2018-12-31 04:23:01,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 04:23:01,313 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 04:23:01,313 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 04:23:01,313 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 04:23:01,314 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 04:22:54" (3/4) ... [2018-12-31 04:23:01,318 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 04:23:01,333 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 04:23:01,333 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-31 04:23:01,362 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((size == 8 && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && 0 == \result) || ((((((size == 8 && 0 == \result) && 0 == guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) [2018-12-31 04:23:01,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == \result && size == 8) && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && 0 == \result) && 0 == \result) || (((((((((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) [2018-12-31 04:23:01,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((size == 8 && 0 == \result) && 0 == \result) || (((((dev1 == 0 && size == 8) && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && dev1 == 0)) || ((((((((\result == dev1 && 0 == \result) && 1 <= dev1) && size == 8) && 0 == guard_malloc_counter) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result) [2018-12-31 04:23:01,363 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0 == \result && size == 8) && 0 == \result) && 0 == \result) && 0 == \result) || (((((((((((\result == dev1 && 1 <= dev1) && dev1 + 1 <= \result) && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result)) || ((((((dev1 == 0 && size == 8) && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && 0 == \result) && dev1 == 0) [2018-12-31 04:23:01,404 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 04:23:01,404 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 04:23:01,405 INFO L168 Benchmark]: Toolchain (without parser) took 8378.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 952.7 MB in the beginning and 992.6 MB in the end (delta: -39.9 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:01,406 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 04:23:01,406 INFO L168 Benchmark]: CACSL2BoogieTranslator took 709.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:01,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.15 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. [2018-12-31 04:23:01,408 INFO L168 Benchmark]: Boogie Preprocessor took 50.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:01,408 INFO L168 Benchmark]: RCFGBuilder took 619.32 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:01,409 INFO L168 Benchmark]: TraceAbstraction took 6835.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.7 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:01,410 INFO L168 Benchmark]: Witness Printer took 91.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 992.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 11.5 GB. [2018-12-31 04:23:01,414 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 709.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -170.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 619.32 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: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6835.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 69.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.7 MB). Peak memory consumption was 160.4 MB. Max. memory is 11.5 GB. * Witness Printer took 91.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 992.6 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. 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: (((((0 == \result && size == 8) && 0 == \result) && 0 == \result) && 0 == \result) || (((((((((((\result == dev1 && 1 <= dev1) && dev1 + 1 <= \result) && size == 8) && elem == \result) && \result <= guard_malloc_counter) && 0 == guard_malloc_counter) && 0 == \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result)) || ((((((dev1 == 0 && size == 8) && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && 0 == \result) && dev1 == 0) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: ((((size == 8 && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && 0 == \result) || ((((((size == 8 && 0 == \result) && 0 == guard_malloc_counter) && 1 <= \result) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) - InvariantResult [Line: 869]: Loop Invariant Derived loop invariant: (((size == 8 && 0 == \result) && 0 == \result) || (((((dev1 == 0 && size == 8) && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && dev1 == 0)) || ((((((((\result == dev1 && 0 == \result) && 1 <= dev1) && size == 8) && 0 == guard_malloc_counter) && elem == 0) && \result <= guard_malloc_counter) && elem == \result) && dev1 + 1 <= \result) - InvariantResult [Line: 878]: Loop Invariant Derived loop invariant: ((((((0 == \result && size == 8) && 0 == \result) && 0 == elem) && 0 == guard_malloc_counter) && 0 == \result) && 0 == \result) || (((((((((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. SAFE Result, 6.7s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 224 SDtfs, 658 SDslu, 521 SDs, 0 SdLazy, 804 SolverSat, 118 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 135 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 3.1s 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 AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 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, 69 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s 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, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...