./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f 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/test24_true-unreach-call_true-termination.c -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 043660dc5a969bbd34b12cbb93ba3e467b4f8613 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:50:23,400 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:50:23,401 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:50:23,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:50:23,416 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:50:23,417 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:50:23,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:50:23,421 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:50:23,424 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:50:23,430 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:50:23,431 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:50:23,431 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:50:23,434 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:50:23,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:50:23,437 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:50:23,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:50:23,441 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:50:23,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:50:23,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:50:23,452 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:50:23,457 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:50:23,461 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:50:23,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:50:23,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:50:23,463 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:50:23,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:50:23,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:50:23,467 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:50:23,467 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:50:23,469 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:50:23,469 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:50:23,470 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:50:23,470 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:50:23,470 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:50:23,471 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:50:23,472 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:50:23,472 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:50:23,496 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:50:23,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:50:23,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:50:23,499 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:50:23,500 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:50:23,500 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:50:23,500 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:50:23,501 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:50:23,501 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:50:23,502 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:50:23,502 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:50:23,502 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:50:23,502 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:50:23,503 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:50:23,503 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:50:23,503 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:50:23,504 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:50:23,504 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:50:23,504 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:50:23,504 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:50:23,504 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:50:23,507 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:50:23,507 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:50:23,507 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:50:23,507 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:50:23,508 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:50:23,508 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:50:23,508 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 -> 043660dc5a969bbd34b12cbb93ba3e467b4f8613 [2019-01-14 15:50:23,557 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:50:23,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:50:23,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:50:23,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:50:23,580 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:50:23,582 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c [2019-01-14 15:50:23,636 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309b22cbe/85052c0f68e44057a20a889f783ba184/FLAGb0f6f438f [2019-01-14 15:50:24,055 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:50:24,056 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test24_true-unreach-call_true-termination.c [2019-01-14 15:50:24,061 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309b22cbe/85052c0f68e44057a20a889f783ba184/FLAGb0f6f438f [2019-01-14 15:50:24,428 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/309b22cbe/85052c0f68e44057a20a889f783ba184 [2019-01-14 15:50:24,432 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:50:24,433 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:50:24,434 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:50:24,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:50:24,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:50:24,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a411c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24, skipping insertion in model container [2019-01-14 15:50:24,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,451 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:50:24,470 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:50:24,708 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:50:24,726 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:50:24,751 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:50:24,773 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:50:24,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24 WrapperNode [2019-01-14 15:50:24,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:50:24,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:50:24,776 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:50:24,776 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:50:24,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,795 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,821 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:50:24,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:50:24,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:50:24,822 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:50:24,833 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,835 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,912 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (1/1) ... [2019-01-14 15:50:24,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:50:24,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:50:24,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:50:24,923 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:50:24,924 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (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-01-14 15:50:24,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:50:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:50:24,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:50:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:50:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:50:24,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 15:50:25,340 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:50:25,340 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 15:50:25,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:25 BoogieIcfgContainer [2019-01-14 15:50:25,342 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:50:25,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:50:25,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:50:25,347 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:50:25,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:50:24" (1/3) ... [2019-01-14 15:50:25,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603ca247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:50:25, skipping insertion in model container [2019-01-14 15:50:25,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:24" (2/3) ... [2019-01-14 15:50:25,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603ca247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:50:25, skipping insertion in model container [2019-01-14 15:50:25,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:25" (3/3) ... [2019-01-14 15:50:25,356 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_true-unreach-call_true-termination.c [2019-01-14 15:50:25,377 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:50:25,385 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:50:25,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:50:25,436 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:50:25,437 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:50:25,437 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:50:25,437 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:50:25,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:50:25,438 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:50:25,438 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:50:25,438 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:50:25,438 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:50:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-01-14 15:50:25,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 15:50:25,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:25,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:25,465 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:25,471 INFO L82 PathProgramCache]: Analyzing trace with hash 126985497, now seen corresponding path program 1 times [2019-01-14 15:50:25,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:25,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:25,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:25,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:25,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:25,608 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:50:25,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:50:25,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:50:25,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:50:25,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:50:25,626 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-01-14 15:50:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:25,639 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-14 15:50:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:50:25,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-14 15:50:25,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:25,650 INFO L225 Difference]: With dead ends: 23 [2019-01-14 15:50:25,650 INFO L226 Difference]: Without dead ends: 10 [2019-01-14 15:50:25,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:50:25,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-14 15:50:25,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 15:50:25,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 15:50:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-14 15:50:25,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-14 15:50:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:25,682 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-14 15:50:25,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:50:25,683 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-14 15:50:25,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 15:50:25,683 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:25,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:25,684 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:25,684 INFO L82 PathProgramCache]: Analyzing trace with hash -564424753, now seen corresponding path program 1 times [2019-01-14 15:50:25,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:25,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:25,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:25,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:26,308 WARN L181 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 24 [2019-01-14 15:50:26,685 WARN L181 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 16 [2019-01-14 15:50:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:50:26,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 15:50:26,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 15:50:26,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 15:50:26,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 15:50:26,701 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 5 states. [2019-01-14 15:50:26,870 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-01-14 15:50:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:26,897 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-14 15:50:26,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 15:50:26,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-14 15:50:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:26,905 INFO L225 Difference]: With dead ends: 17 [2019-01-14 15:50:26,905 INFO L226 Difference]: Without dead ends: 12 [2019-01-14 15:50:26,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-14 15:50:26,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-14 15:50:26,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 15:50:26,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 15:50:26,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-14 15:50:26,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-14 15:50:26,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:26,914 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-14 15:50:26,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 15:50:26,915 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-14 15:50:26,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-14 15:50:26,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:26,915 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:26,916 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:26,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:26,916 INFO L82 PathProgramCache]: Analyzing trace with hash 263489748, now seen corresponding path program 1 times [2019-01-14 15:50:26,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:26,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:26,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:26,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:26,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:27,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:27,191 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:50:27,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:27,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:27,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 15:50:27,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-01-14 15:50:27,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:27,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:27,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:27,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:9 [2019-01-14 15:50:27,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 15:50:27,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:27,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:27,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:27,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:27,393 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-14 15:50:27,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:27,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-01-14 15:50:27,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 15:50:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 15:50:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:50:27,436 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2019-01-14 15:50:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:27,760 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2019-01-14 15:50:27,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 15:50:27,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2019-01-14 15:50:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:27,762 INFO L225 Difference]: With dead ends: 21 [2019-01-14 15:50:27,762 INFO L226 Difference]: Without dead ends: 16 [2019-01-14 15:50:27,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-14 15:50:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-14 15:50:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-14 15:50:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 15:50:27,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-14 15:50:27,769 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-01-14 15:50:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:27,770 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-14 15:50:27,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 15:50:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-14 15:50:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 15:50:27,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:27,771 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:27,771 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash -919715042, now seen corresponding path program 2 times [2019-01-14 15:50:27,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:27,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:27,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:28,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:28,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:28,029 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:50:28,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:50:28,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:50:28,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:28,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:28,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-14 15:50:28,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:28,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-14 15:50:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:28,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:28,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-01-14 15:50:28,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 15:50:28,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 15:50:28,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-14 15:50:28,160 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2019-01-14 15:50:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:28,285 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-14 15:50:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 15:50:28,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-14 15:50:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:28,287 INFO L225 Difference]: With dead ends: 23 [2019-01-14 15:50:28,287 INFO L226 Difference]: Without dead ends: 18 [2019-01-14 15:50:28,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-14 15:50:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-14 15:50:28,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-14 15:50:28,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-14 15:50:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-14 15:50:28,293 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-01-14 15:50:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:28,293 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-14 15:50:28,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 15:50:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-14 15:50:28,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 15:50:28,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:28,295 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:28,295 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:28,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:28,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1868061597, now seen corresponding path program 3 times [2019-01-14 15:50:28,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:28,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:28,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:28,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:50:28,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:28,700 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:28,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:28,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:50:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:50:28,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 15:50:28,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:28,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:28,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2019-01-14 15:50:28,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2019-01-14 15:50:28,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,760 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 15:50:28,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2019-01-14 15:50:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 15:50:29,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:29,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-01-14 15:50:29,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 15:50:29,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 15:50:29,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-01-14 15:50:29,242 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 16 states. [2019-01-14 15:50:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:30,067 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-14 15:50:30,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 15:50:30,067 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-01-14 15:50:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:30,068 INFO L225 Difference]: With dead ends: 23 [2019-01-14 15:50:30,068 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:50:30,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2019-01-14 15:50:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:50:30,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:50:30,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:50:30,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:50:30,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-01-14 15:50:30,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:30,070 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:50:30,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 15:50:30,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:50:30,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:50:30,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:50:30,412 WARN L181 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 22 [2019-01-14 15:50:30,415 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:50:30,415 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2019-01-14 15:50:30,416 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 32) no Hoare annotation was computed. [2019-01-14 15:50:30,416 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 21 32) no Hoare annotation was computed. [2019-01-14 15:50:30,416 INFO L444 ceAbstractionStarter]: At program point L11(lines 9 12) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (exists ((v_ULTIMATE.start_main_~i~0_18 Int)) (let ((.cse0 (select (select |#memory_int| |ULTIMATE.start_main_~#ad1~0.base|) (+ |ULTIMATE.start_main_~#ad1~0.offset| (* 8 v_ULTIMATE.start_main_~i~0_18))))) (and (<= ULTIMATE.start_main_~i~0 .cse0) (<= .cse0 ULTIMATE.start_main_~i~0) (= v_ULTIMATE.start_main_~i~0_18 .cse0)))) (= |ULTIMATE.start_main_~#ad1~0.offset| 0) (exists ((v_ULTIMATE.start_main_~i~0_18 Int)) (let ((.cse1 (+ |ULTIMATE.start_main_~#ad1~0.offset| (* 8 v_ULTIMATE.start_main_~i~0_18)))) (and (= ULTIMATE.start_main_~pa~0.offset .cse1) (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse1) v_ULTIMATE.start_main_~i~0_18)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|) (= 1 |ULTIMATE.start_check_#res|)) [2019-01-14 15:50:30,416 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 15:50:30,417 INFO L444 ceAbstractionStarter]: At program point L30(lines 15 38) the Hoare annotation is: false [2019-01-14 15:50:30,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:50:30,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:50:30,417 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 28) no Hoare annotation was computed. [2019-01-14 15:50:30,417 INFO L444 ceAbstractionStarter]: At program point L26-3(lines 26 28) the Hoare annotation is: (and (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset)) (= |ULTIMATE.start_main_~#ad1~0.offset| 0) (exists ((v_ULTIMATE.start_main_~i~0_18 Int)) (let ((.cse0 (+ |ULTIMATE.start_main_~#ad1~0.offset| (* 8 v_ULTIMATE.start_main_~i~0_18)))) (and (= ULTIMATE.start_main_~pa~0.offset .cse0) (= (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) .cse0) v_ULTIMATE.start_main_~i~0_18)))) (= ULTIMATE.start_main_~pa~0.base |ULTIMATE.start_main_~#ad1~0.base|)) [2019-01-14 15:50:30,417 INFO L448 ceAbstractionStarter]: For program point L26-4(lines 26 28) no Hoare annotation was computed. [2019-01-14 15:50:30,417 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 36) no Hoare annotation was computed. [2019-01-14 15:50:30,418 INFO L451 ceAbstractionStarter]: At program point L37(lines 14 38) the Hoare annotation is: true [2019-01-14 15:50:30,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,435 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,436 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,442 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,443 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,444 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,446 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,447 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,448 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:50:30 BoogieIcfgContainer [2019-01-14 15:50:30,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:50:30,451 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:50:30,451 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:50:30,452 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:50:30,452 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:25" (3/4) ... [2019-01-14 15:50:30,456 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:50:30,468 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-14 15:50:30,468 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-01-14 15:50:30,468 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 15:50:30,494 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((i <= unknown-#memory_int-unknown[pa][pa] && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1 [2019-01-14 15:50:30,495 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: (i <= unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] && unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] <= i) && v_ULTIMATE.start_main_~i~0_18 == unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18])) && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1) && 1 == \result [2019-01-14 15:50:30,520 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:50:30,520 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:50:30,521 INFO L168 Benchmark]: Toolchain (without parser) took 6088.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.0 MB in the beginning and 831.5 MB in the end (delta: 118.5 MB). Peak memory consumption was 245.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:30,522 INFO L168 Benchmark]: CDTParser took 0.23 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. [2019-01-14 15:50:30,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:30,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.03 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:50:30,524 INFO L168 Benchmark]: Boogie Preprocessor took 95.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:30,524 INFO L168 Benchmark]: RCFGBuilder took 424.29 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:30,525 INFO L168 Benchmark]: TraceAbstraction took 5108.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.5 MB in the end (delta: 269.8 MB). Peak memory consumption was 269.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:30,526 INFO L168 Benchmark]: Witness Printer took 68.92 ms. Allocated memory is still 1.2 GB. Free memory is still 831.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:50:30,530 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.23 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 340.95 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 939.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.03 ms. Allocated memory is still 1.0 GB. Free memory is still 939.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 424.29 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: 20.7 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5108.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 831.5 MB in the end (delta: 269.8 MB). Peak memory consumption was 269.8 MB. Max. memory is 11.5 GB. * Witness Printer took 68.92 ms. Allocated memory is still 1.2 GB. Free memory is still 831.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 36]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 9]: Loop Invariant [2019-01-14 15:50:30,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,539 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,540 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,541 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,542 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,543 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,544 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,546 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((i <= unknown-#memory_int-unknown[pa][pa] && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: (i <= unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] && unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] <= i) && v_ULTIMATE.start_main_~i~0_18 == unknown-#memory_int-unknown[ad1][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18])) && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1) && 1 == \result - InvariantResult [Line: 26]: Loop Invariant [2019-01-14 15:50:30,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,547 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,548 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,548 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,549 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_main_~i~0_18,QUANTIFIED] [2019-01-14 15:50:30,549 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:30,550 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((i <= unknown-#memory_int-unknown[pa][pa] && ad1 == 0) && (\exists v_ULTIMATE.start_main_~i~0_18 : int :: pa == ad1 + 8 * v_ULTIMATE.start_main_~i~0_18 && unknown-#memory_int-unknown[pa][ad1 + 8 * v_ULTIMATE.start_main_~i~0_18] == v_ULTIMATE.start_main_~i~0_18)) && pa == ad1 - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. SAFE Result, 4.9s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 40 SDtfs, 38 SDslu, 38 SDs, 0 SdLazy, 116 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=4, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 108 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 221 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 103 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 95 ConstructedInterpolants, 11 QuantifiedInterpolants, 10041 SizeOfPredicates, 29 NumberOfNonLiveVariables, 198 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 16/68 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...