java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 01:35:56,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 01:35:56,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 01:35:56,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 01:35:56,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 01:35:56,469 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 01:35:56,471 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 01:35:56,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 01:35:56,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 01:35:56,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 01:35:56,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 01:35:56,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 01:35:56,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 01:35:56,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 01:35:56,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 01:35:56,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 01:35:56,494 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 01:35:56,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 01:35:56,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 01:35:56,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 01:35:56,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 01:35:56,510 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 01:35:56,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 01:35:56,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 01:35:56,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 01:35:56,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 01:35:56,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 01:35:56,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 01:35:56,522 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 01:35:56,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 01:35:56,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 01:35:56,527 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 01:35:56,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 01:35:56,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 01:35:56,534 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 01:35:56,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 01:35:56,535 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 01:35:56,536 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 01:35:56,536 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 01:35:56,537 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 01:35:56,537 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 01:35:56,539 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 01:35:56,565 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 01:35:56,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 01:35:56,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 01:35:56,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 01:35:56,568 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 01:35:56,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 01:35:56,569 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 01:35:56,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 01:35:56,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 01:35:56,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 01:35:56,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 01:35:56,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 01:35:56,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 01:35:56,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 01:35:56,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 01:35:56,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 01:35:56,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 01:35:56,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 01:35:56,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 01:35:56,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 01:35:56,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 01:35:56,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 01:35:56,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 01:35:56,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 01:35:56,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 01:35:56,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 01:35:56,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 01:35:56,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 01:35:56,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 01:35:56,630 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 01:35:56,643 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 01:35:56,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 01:35:56,649 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 01:35:56,649 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 01:35:56,650 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-2.c [2019-09-08 01:35:56,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fdc20f4e/7a218a58d1b9474d8f177c57aa23f733/FLAG0e1c4c5bb [2019-09-08 01:35:57,166 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 01:35:57,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-2.c [2019-09-08 01:35:57,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fdc20f4e/7a218a58d1b9474d8f177c57aa23f733/FLAG0e1c4c5bb [2019-09-08 01:35:57,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fdc20f4e/7a218a58d1b9474d8f177c57aa23f733 [2019-09-08 01:35:57,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 01:35:57,551 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 01:35:57,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:57,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 01:35:57,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 01:35:57,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ef5e474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57, skipping insertion in model container [2019-09-08 01:35:57,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,567 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 01:35:57,583 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 01:35:57,751 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:57,761 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 01:35:57,781 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 01:35:57,795 INFO L192 MainTranslator]: Completed translation [2019-09-08 01:35:57,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57 WrapperNode [2019-09-08 01:35:57,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 01:35:57,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 01:35:57,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 01:35:57,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 01:35:57,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (1/1) ... [2019-09-08 01:35:57,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 01:35:57,924 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 01:35:57,924 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 01:35:57,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 01:35:57,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (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-09-08 01:35:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 01:35:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 01:35:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 01:35:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 01:35:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 01:35:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 01:35:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 01:35:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 01:35:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 01:35:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 01:35:57,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 01:35:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 01:35:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 01:35:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 01:35:58,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 01:35:58,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 01:35:58,260 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 01:35:58,260 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 01:35:58,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:58 BoogieIcfgContainer [2019-09-08 01:35:58,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 01:35:58,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 01:35:58,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 01:35:58,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 01:35:58,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:35:57" (1/3) ... [2019-09-08 01:35:58,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4eee6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:58, skipping insertion in model container [2019-09-08 01:35:58,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:35:57" (2/3) ... [2019-09-08 01:35:58,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e4eee6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:35:58, skipping insertion in model container [2019-09-08 01:35:58,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:35:58" (3/3) ... [2019-09-08 01:35:58,272 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-2.c [2019-09-08 01:35:58,286 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 01:35:58,298 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 01:35:58,333 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 01:35:58,374 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 01:35:58,376 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 01:35:58,376 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 01:35:58,376 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 01:35:58,376 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 01:35:58,376 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 01:35:58,377 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 01:35:58,377 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 01:35:58,377 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 01:35:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-09-08 01:35:58,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 01:35:58,404 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:58,405 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:58,408 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:58,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:58,414 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2019-09-08 01:35:58,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:58,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:58,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:58,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:58,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:35:58,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 01:35:58,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 01:35:58,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 01:35:58,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 01:35:58,597 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-09-08 01:35:58,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:58,622 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-09-08 01:35:58,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 01:35:58,624 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-08 01:35:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:58,634 INFO L225 Difference]: With dead ends: 42 [2019-09-08 01:35:58,634 INFO L226 Difference]: Without dead ends: 20 [2019-09-08 01:35:58,638 INFO L628 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-09-08 01:35:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-09-08 01:35:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-09-08 01:35:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-09-08 01:35:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-09-08 01:35:58,686 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-09-08 01:35:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:58,688 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-09-08 01:35:58,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 01:35:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-09-08 01:35:58,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 01:35:58,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:58,692 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:58,692 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:58,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:58,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2019-09-08 01:35:58,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:58,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:58,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:58,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 01:35:58,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 01:35:58,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 01:35:58,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 01:35:58,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:35:58,861 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2019-09-08 01:35:58,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:58,916 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-09-08 01:35:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 01:35:58,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-08 01:35:58,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:58,918 INFO L225 Difference]: With dead ends: 34 [2019-09-08 01:35:58,918 INFO L226 Difference]: Without dead ends: 22 [2019-09-08 01:35:58,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 01:35:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-08 01:35:58,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-08 01:35:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-08 01:35:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-08 01:35:58,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-09-08 01:35:58,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:58,930 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-08 01:35:58,931 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 01:35:58,931 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-08 01:35:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-08 01:35:58,932 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:58,932 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:58,933 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:58,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:58,933 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2019-09-08 01:35:58,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:58,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:58,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:58,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:58,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:59,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:59,045 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-09-08 01:35:59,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:59,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 01:35:59,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:59,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-08 01:35:59,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 01:35:59,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 01:35:59,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:35:59,164 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-09-08 01:35:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:59,218 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-09-08 01:35:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 01:35:59,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-08 01:35:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:59,220 INFO L225 Difference]: With dead ends: 36 [2019-09-08 01:35:59,221 INFO L226 Difference]: Without dead ends: 24 [2019-09-08 01:35:59,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 01:35:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-09-08 01:35:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-09-08 01:35:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-08 01:35:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-08 01:35:59,227 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-09-08 01:35:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:59,227 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-08 01:35:59,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 01:35:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-08 01:35:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-08 01:35:59,230 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:59,230 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:59,230 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:59,231 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2019-09-08 01:35:59,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:59,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:59,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 01:35:59,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:59,311 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-09-08 01:35:59,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:35:59,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-08 01:35:59,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:35:59,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:35:59,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:59,482 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:35:59,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:59,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-08 01:35:59,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:35:59,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:35:59,511 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:35:59,511 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-09-08 01:35:59,530 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 01:35:59,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 01:35:59,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 01:35:59,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:35:59,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:35:59,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:35:59,536 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2019-09-08 01:35:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:59,660 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-09-08 01:35:59,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 01:35:59,661 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-09-08 01:35:59,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:59,662 INFO L225 Difference]: With dead ends: 40 [2019-09-08 01:35:59,662 INFO L226 Difference]: Without dead ends: 28 [2019-09-08 01:35:59,663 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 01:35:59,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-08 01:35:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-08 01:35:59,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-08 01:35:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-09-08 01:35:59,669 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2019-09-08 01:35:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:59,670 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-09-08 01:35:59,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:35:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-09-08 01:35:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 01:35:59,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:59,671 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:59,672 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 1 times [2019-09-08 01:35:59,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:59,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:59,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:35:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:35:59,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:35:59,786 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) [2019-09-08 01:35:59,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:35:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:35:59,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 01:35:59,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:35:59,870 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 01:35:59,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:35:59,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-08 01:35:59,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 01:35:59,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 01:35:59,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:35:59,876 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-09-08 01:35:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:35:59,929 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-09-08 01:35:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 01:35:59,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-08 01:35:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:35:59,932 INFO L225 Difference]: With dead ends: 44 [2019-09-08 01:35:59,932 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 01:35:59,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 01:35:59,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 01:35:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-09-08 01:35:59,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-08 01:35:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-09-08 01:35:59,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-09-08 01:35:59,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:35:59,947 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-09-08 01:35:59,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 01:35:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-09-08 01:35:59,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-08 01:35:59,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:35:59,950 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:35:59,950 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:35:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:35:59,952 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 2 times [2019-09-08 01:35:59,954 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:35:59,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:35:59,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:35:59,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 01:35:59,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:00,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:00,112 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:00,131 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 01:36:00,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 01:36:00,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:00,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 01:36:00,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:00,191 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:00,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:00,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-08 01:36:00,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 01:36:00,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 01:36:00,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:36:00,199 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2019-09-08 01:36:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:00,243 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-09-08 01:36:00,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 01:36:00,244 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-09-08 01:36:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:00,245 INFO L225 Difference]: With dead ends: 46 [2019-09-08 01:36:00,245 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 01:36:00,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 01:36:00,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 01:36:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-09-08 01:36:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-08 01:36:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-09-08 01:36:00,251 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-09-08 01:36:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:00,252 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-09-08 01:36:00,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 01:36:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-09-08 01:36:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-08 01:36:00,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:00,253 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:00,253 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 814278768, now seen corresponding path program 3 times [2019-09-08 01:36:00,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:00,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:00,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:00,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:00,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:00,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 01:36:00,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:00,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:00,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-08 01:36:00,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-08 01:36:00,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:00,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 01:36:00,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:01,068 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:36:01,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:01,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-08 01:36:01,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:01,102 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:01,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:01,105 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-09-08 01:36:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 01:36:01,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:01,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-08 01:36:01,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 01:36:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 01:36:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 01:36:01,126 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2019-09-08 01:36:01,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:01,904 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-09-08 01:36:01,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 01:36:01,905 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-09-08 01:36:01,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:01,906 INFO L225 Difference]: With dead ends: 50 [2019-09-08 01:36:01,906 INFO L226 Difference]: Without dead ends: 36 [2019-09-08 01:36:01,907 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:36:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-09-08 01:36:01,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-09-08 01:36:01,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-08 01:36:01,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-09-08 01:36:01,912 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2019-09-08 01:36:01,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:01,913 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-09-08 01:36:01,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 01:36:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-09-08 01:36:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-08 01:36:01,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:01,914 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:01,914 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:01,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1119042125, now seen corresponding path program 4 times [2019-09-08 01:36:01,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:01,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:01,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:01,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 01:36:02,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:02,018 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:02,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-08 01:36:02,068 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-08 01:36:02,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:02,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 01:36:02,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:02,583 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-08 01:36:02,586 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:02,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-09-08 01:36:02,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:02,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:02,608 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:02,608 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-09-08 01:36:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 01:36:02,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:02,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-09-08 01:36:02,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 01:36:02,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 01:36:02,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-09-08 01:36:02,630 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2019-09-08 01:36:08,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:08,904 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2019-09-08 01:36:08,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 01:36:08,905 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-09-08 01:36:08,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:08,906 INFO L225 Difference]: With dead ends: 56 [2019-09-08 01:36:08,908 INFO L226 Difference]: Without dead ends: 40 [2019-09-08 01:36:08,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=65, Invalid=205, Unknown=2, NotChecked=0, Total=272 [2019-09-08 01:36:08,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-08 01:36:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-09-08 01:36:08,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 01:36:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-09-08 01:36:08,917 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2019-09-08 01:36:08,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:08,918 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-09-08 01:36:08,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 01:36:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-09-08 01:36:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 01:36:08,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:08,923 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:08,927 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:08,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:08,928 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 5 times [2019-09-08 01:36:08,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:08,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:08,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:08,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:08,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:36:09,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:09,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:09,075 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-08 01:36:12,324 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-08 01:36:12,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:12,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 01:36:12,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:12,352 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:36:12,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:12,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-08 01:36:12,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 01:36:12,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 01:36:12,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:36:12,359 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2019-09-08 01:36:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:12,424 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-09-08 01:36:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 01:36:12,425 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-09-08 01:36:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:12,426 INFO L225 Difference]: With dead ends: 60 [2019-09-08 01:36:12,426 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 01:36:12,427 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-08 01:36:12,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 01:36:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-08 01:36:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-08 01:36:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-09-08 01:36:12,432 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-09-08 01:36:12,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:12,433 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-09-08 01:36:12,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 01:36:12,433 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-09-08 01:36:12,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 01:36:12,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 01:36:12,434 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 01:36:12,434 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 01:36:12,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 01:36:12,434 INFO L82 PathProgramCache]: Analyzing trace with hash 478163660, now seen corresponding path program 6 times [2019-09-08 01:36:12,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 01:36:12,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 01:36:12,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:12,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 01:36:12,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 01:36:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 01:36:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 01:36:12,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 01:36:12,539 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 01:36:12,566 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 01:36:12,647 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-08 01:36:12,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 01:36:12,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-08 01:36:12,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 01:36:12,670 INFO L375 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 10 treesize of output 8 [2019-09-08 01:36:12,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:12,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:12,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:12,676 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-09-08 01:36:12,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-08 01:36:12,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:12,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:12,743 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-09-08 01:36:12,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 01:36:12,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 01:36:12,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 01:36:12,764 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:28 [2019-09-08 01:36:14,936 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) is different from true [2019-09-08 01:36:21,019 WARN L188 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 30 [2019-09-08 01:36:21,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 01:36:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 01:36:21,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 01:36:21,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-09-08 01:36:21,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 01:36:21,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 01:36:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=270, Unknown=1, NotChecked=34, Total=380 [2019-09-08 01:36:21,133 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 20 states. [2019-09-08 01:36:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 01:36:21,713 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2019-09-08 01:36:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 01:36:21,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-09-08 01:36:21,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 01:36:21,714 INFO L225 Difference]: With dead ends: 60 [2019-09-08 01:36:21,714 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 01:36:21,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=227, Invalid=898, Unknown=1, NotChecked=64, Total=1190 [2019-09-08 01:36:21,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 01:36:21,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 01:36:21,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 01:36:21,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 01:36:21,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 40 [2019-09-08 01:36:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 01:36:21,716 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 01:36:21,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 01:36:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 01:36:21,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 01:36:21,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 01:36:21,827 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 01:36:21,828 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 01:36:21,828 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 01:36:21,828 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 01:36:21,828 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 01:36:21,828 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 01:36:21,828 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 01:36:21,829 INFO L439 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (let ((.cse2 (select (select |#memory_int| .cse0) .cse1))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset .cse1) (<= main_~i~0 .cse2) (not (= .cse0 |main_~#cont~0.base|)) (<= .cse2 main_~i~0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))))) [2019-09-08 01:36:21,829 INFO L443 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2019-09-08 01:36:21,829 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2019-09-08 01:36:21,829 INFO L439 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))) [2019-09-08 01:36:21,829 INFO L443 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2019-09-08 01:36:21,829 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2019-09-08 01:36:21,829 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-09-08 01:36:21,830 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2019-09-08 01:36:21,830 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2019-09-08 01:36:21,830 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: true [2019-09-08 01:36:21,830 INFO L439 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2019-09-08 01:36:21,830 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-09-08 01:36:21,830 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2019-09-08 01:36:21,831 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2019-09-08 01:36:21,831 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= .cse0 |main_~#cont~0.base|)) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))) [2019-09-08 01:36:21,831 INFO L446 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2019-09-08 01:36:21,831 INFO L443 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2019-09-08 01:36:21,831 INFO L443 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2019-09-08 01:36:21,841 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,842 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 01:36:21,843 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,844 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:36:21,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,845 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,848 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,848 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 01:36:21,849 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:36:21,849 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,850 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,853 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 01:36:21 BoogieIcfgContainer [2019-09-08 01:36:21,853 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 01:36:21,855 INFO L168 Benchmark]: Toolchain (without parser) took 24304.05 ms. Allocated memory was 133.2 MB in the beginning and 259.5 MB in the end (delta: 126.4 MB). Free memory was 89.0 MB in the beginning and 138.8 MB in the end (delta: -49.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:21,856 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 01:36:21,857 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.17 ms. Allocated memory is still 133.2 MB. Free memory was 88.6 MB in the beginning and 78.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:21,858 INFO L168 Benchmark]: Boogie Preprocessor took 127.40 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 78.3 MB in the beginning and 176.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:21,858 INFO L168 Benchmark]: RCFGBuilder took 337.72 ms. Allocated memory is still 200.3 MB. Free memory was 176.1 MB in the beginning and 159.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:21,859 INFO L168 Benchmark]: TraceAbstraction took 23589.91 ms. Allocated memory was 200.3 MB in the beginning and 259.5 MB in the end (delta: 59.2 MB). Free memory was 158.7 MB in the beginning and 138.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. [2019-09-08 01:36:21,863 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53 ms. Allocated memory is still 133.2 MB. Free memory was 107.5 MB in the beginning and 107.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 244.17 ms. Allocated memory is still 133.2 MB. Free memory was 88.6 MB in the beginning and 78.3 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.40 ms. Allocated memory was 133.2 MB in the beginning and 200.3 MB in the end (delta: 67.1 MB). Free memory was 78.3 MB in the beginning and 176.1 MB in the end (delta: -97.8 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.72 ms. Allocated memory is still 200.3 MB. Free memory was 176.1 MB in the beginning and 159.3 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 23589.91 ms. Allocated memory was 200.3 MB in the beginning and 259.5 MB in the end (delta: 59.2 MB). Free memory was 158.7 MB in the beginning and 138.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 79.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: 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: 37]: Loop Invariant [2019-09-08 01:36:21,872 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 01:36:21,873 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,873 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:36:21,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,874 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,874 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 01:36:21,875 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 01:36:21,875 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 01:36:21,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 01:36:21,876 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((pa == #memory_$Pointer$[cont][cont] && cont == 0) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == #memory_$Pointer$[cont][cont] + 4) && !(#memory_$Pointer$[cont][cont] == cont)) && !(array == cont) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0 && !(array == cont) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. SAFE Result, 23.4s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 8.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 180 SDtfs, 58 SDslu, 638 SDs, 0 SdLazy, 382 SolverSat, 18 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 224 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 14.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=9, 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, 8 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 19 PreInvPairs, 33 NumberOfFragments, 119 HoareAnnotationTreeSize, 19 FomulaSimplifications, 242 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 114 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 511 NumberOfCodeBlocks, 481 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 493 ConstructedInterpolants, 12 QuantifiedInterpolants, 54011 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1056 ConjunctsInSsa, 100 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 190/480 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...