./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/ldv-regression/test22_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/ldv-regression/test22_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash efd11941ceab8dc56d9aa56f1950f714738654ba ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 15:50:20,367 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 15:50:20,369 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 15:50:20,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 15:50:20,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 15:50:20,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 15:50:20,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 15:50:20,386 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 15:50:20,388 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 15:50:20,389 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 15:50:20,390 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 15:50:20,391 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 15:50:20,391 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 15:50:20,393 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 15:50:20,394 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 15:50:20,395 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 15:50:20,396 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 15:50:20,398 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 15:50:20,401 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 15:50:20,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 15:50:20,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 15:50:20,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 15:50:20,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 15:50:20,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 15:50:20,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 15:50:20,410 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 15:50:20,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 15:50:20,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 15:50:20,413 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 15:50:20,414 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 15:50:20,414 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 15:50:20,415 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 15:50:20,415 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 15:50:20,416 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 15:50:20,417 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 15:50:20,417 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 15:50:20,418 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-14 15:50:20,433 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 15:50:20,433 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 15:50:20,434 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 15:50:20,434 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 15:50:20,434 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 15:50:20,435 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 15:50:20,436 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 15:50:20,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 15:50:20,436 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 15:50:20,436 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 15:50:20,436 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 15:50:20,436 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 15:50:20,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 15:50:20,437 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 15:50:20,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 15:50:20,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 15:50:20,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 15:50:20,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 15:50:20,438 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 15:50:20,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 15:50:20,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:50:20,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 15:50:20,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 15:50:20,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 15:50:20,441 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 15:50:20,441 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 15:50:20,441 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 15:50:20,441 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> efd11941ceab8dc56d9aa56f1950f714738654ba [2019-01-14 15:50:20,478 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 15:50:20,490 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 15:50:20,494 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 15:50:20,496 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 15:50:20,496 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 15:50:20,497 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/ldv-regression/test22_true-unreach-call.c [2019-01-14 15:50:20,554 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b00a61ec/bc0f45a794d64d1fa0d8580e0c5fffb2/FLAG1b24e4a05 [2019-01-14 15:50:20,972 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 15:50:20,973 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/ldv-regression/test22_true-unreach-call.c [2019-01-14 15:50:20,979 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b00a61ec/bc0f45a794d64d1fa0d8580e0c5fffb2/FLAG1b24e4a05 [2019-01-14 15:50:21,346 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b00a61ec/bc0f45a794d64d1fa0d8580e0c5fffb2 [2019-01-14 15:50:21,351 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 15:50:21,352 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 15:50:21,353 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 15:50:21,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 15:50:21,358 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 15:50:21,359 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fe1756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21, skipping insertion in model container [2019-01-14 15:50:21,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 15:50:21,393 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 15:50:21,638 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:50:21,657 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 15:50:21,683 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 15:50:21,702 INFO L195 MainTranslator]: Completed translation [2019-01-14 15:50:21,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21 WrapperNode [2019-01-14 15:50:21,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 15:50:21,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 15:50:21,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 15:50:21,704 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 15:50:21,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 15:50:21,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 15:50:21,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 15:50:21,747 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 15:50:21,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... [2019-01-14 15:50:21,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 15:50:21,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 15:50:21,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 15:50:21,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 15:50:21,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 15:50:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-14 15:50:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 15:50:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 15:50:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 15:50:21,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 15:50:21,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 15:50:22,371 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 15:50:22,372 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-14 15:50:22,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:22 BoogieIcfgContainer [2019-01-14 15:50:22,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 15:50:22,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 15:50:22,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 15:50:22,378 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 15:50:22,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 03:50:21" (1/3) ... [2019-01-14 15:50:22,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69498132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:50:22, skipping insertion in model container [2019-01-14 15:50:22,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:21" (2/3) ... [2019-01-14 15:50:22,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69498132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 03:50:22, skipping insertion in model container [2019-01-14 15:50:22,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:22" (3/3) ... [2019-01-14 15:50:22,382 INFO L112 eAbstractionObserver]: Analyzing ICFG test22_true-unreach-call.c [2019-01-14 15:50:22,392 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 15:50:22,401 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-14 15:50:22,419 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-14 15:50:22,448 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 15:50:22,449 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 15:50:22,449 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 15:50:22,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 15:50:22,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 15:50:22,450 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 15:50:22,450 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 15:50:22,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 15:50:22,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 15:50:22,462 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-01-14 15:50:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 15:50:22,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:22,469 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:22,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:22,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:22,476 INFO L82 PathProgramCache]: Analyzing trace with hash 164664103, now seen corresponding path program 1 times [2019-01-14 15:50:22,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:22,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:22,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:22,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:22,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:22,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:50:22,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 15:50:22,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 15:50:22,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 15:50:22,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:50:22,703 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-01-14 15:50:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:22,722 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2019-01-14 15:50:22,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 15:50:22,724 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-01-14 15:50:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:22,736 INFO L225 Difference]: With dead ends: 34 [2019-01-14 15:50:22,736 INFO L226 Difference]: Without dead ends: 21 [2019-01-14 15:50:22,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 15:50:22,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-14 15:50:22,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-14 15:50:22,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 15:50:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-01-14 15:50:22,783 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 19 [2019-01-14 15:50:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:22,784 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-01-14 15:50:22,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 15:50:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-01-14 15:50:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:50:22,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:22,787 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:22,787 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:22,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:22,788 INFO L82 PathProgramCache]: Analyzing trace with hash 603612068, now seen corresponding path program 1 times [2019-01-14 15:50:22,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:22,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:22,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:23,589 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 15 [2019-01-14 15:50:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:23,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:50:23,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 15:50:23,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 15:50:23,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 15:50:23,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:50:23,676 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 10 states. [2019-01-14 15:50:24,114 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-14 15:50:24,549 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-14 15:50:24,960 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-01-14 15:50:25,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:25,061 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2019-01-14 15:50:25,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 15:50:25,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-14 15:50:25,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:25,063 INFO L225 Difference]: With dead ends: 96 [2019-01-14 15:50:25,064 INFO L226 Difference]: Without dead ends: 91 [2019-01-14 15:50:25,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-01-14 15:50:25,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-14 15:50:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 33. [2019-01-14 15:50:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 15:50:25,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-01-14 15:50:25,077 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2019-01-14 15:50:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:25,078 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-01-14 15:50:25,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 15:50:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-01-14 15:50:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:50:25,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:25,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:25,080 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:25,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:25,080 INFO L82 PathProgramCache]: Analyzing trace with hash -407505182, now seen corresponding path program 1 times [2019-01-14 15:50:25,081 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:25,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:25,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:25,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:25,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:25,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:25,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:50:25,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 15:50:25,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 15:50:25,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 15:50:25,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:50:25,269 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 10 states. [2019-01-14 15:50:25,961 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-14 15:50:26,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:26,155 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2019-01-14 15:50:26,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-14 15:50:26,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-14 15:50:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:26,159 INFO L225 Difference]: With dead ends: 91 [2019-01-14 15:50:26,160 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 15:50:26,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-01-14 15:50:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 15:50:26,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 33. [2019-01-14 15:50:26,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 15:50:26,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-01-14 15:50:26,171 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2019-01-14 15:50:26,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:26,172 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-01-14 15:50:26,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 15:50:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-01-14 15:50:26,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:50:26,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:26,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:26,174 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:26,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:26,174 INFO L82 PathProgramCache]: Analyzing trace with hash -984735834, now seen corresponding path program 1 times [2019-01-14 15:50:26,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:26,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:26,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:26,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:26,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:26,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:50:26,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-14 15:50:26,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 15:50:26,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 15:50:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:50:26,319 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 10 states. [2019-01-14 15:50:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:26,764 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-01-14 15:50:26,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-14 15:50:26,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-14 15:50:26,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:26,768 INFO L225 Difference]: With dead ends: 81 [2019-01-14 15:50:26,768 INFO L226 Difference]: Without dead ends: 64 [2019-01-14 15:50:26,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-01-14 15:50:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-14 15:50:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 33. [2019-01-14 15:50:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 15:50:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2019-01-14 15:50:26,780 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 20 [2019-01-14 15:50:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:26,780 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2019-01-14 15:50:26,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 15:50:26,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2019-01-14 15:50:26,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-14 15:50:26,781 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:26,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:26,782 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:26,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:26,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1995853084, now seen corresponding path program 1 times [2019-01-14 15:50:26,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:26,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:26,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:26,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:26,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:26,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:26,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 15:50:26,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-14 15:50:26,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 15:50:26,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 15:50:26,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-14 15:50:26,974 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 10 states. [2019-01-14 15:50:27,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:27,698 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2019-01-14 15:50:27,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-14 15:50:27,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-01-14 15:50:27,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:27,700 INFO L225 Difference]: With dead ends: 73 [2019-01-14 15:50:27,700 INFO L226 Difference]: Without dead ends: 68 [2019-01-14 15:50:27,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2019-01-14 15:50:27,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-14 15:50:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 26. [2019-01-14 15:50:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 15:50:27,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 15:50:27,710 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 20 [2019-01-14 15:50:27,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:27,710 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 15:50:27,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 15:50:27,710 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 15:50:27,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-14 15:50:27,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:27,711 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:27,711 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:27,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1760411593, now seen corresponding path program 1 times [2019-01-14 15:50:27,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:27,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:27,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:28,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:28,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:28,154 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:50:28,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:28,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:28,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:28,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:28,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:28,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:28,568 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:28,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2019-01-14 15:50:28,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:28,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:28,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 16 [2019-01-14 15:50:28,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-14 15:50:28,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-14 15:50:28,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-01-14 15:50:28,671 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 16 states. [2019-01-14 15:50:29,363 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-14 15:50:30,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:30,788 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2019-01-14 15:50:30,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 15:50:30,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-01-14 15:50:30,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:30,789 INFO L225 Difference]: With dead ends: 81 [2019-01-14 15:50:30,790 INFO L226 Difference]: Without dead ends: 76 [2019-01-14 15:50:30,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=356, Invalid=1450, Unknown=0, NotChecked=0, Total=1806 [2019-01-14 15:50:30,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-14 15:50:30,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 28. [2019-01-14 15:50:30,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 15:50:30,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-01-14 15:50:30,803 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-01-14 15:50:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:30,803 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-01-14 15:50:30,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-14 15:50:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-01-14 15:50:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-14 15:50:30,806 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:30,806 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:30,806 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:30,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:30,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1048225454, now seen corresponding path program 2 times [2019-01-14 15:50:30,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:30,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:30,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:30,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:30,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:31,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:31,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:50:31,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:50:31,149 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:50:31,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:31,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:31,773 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-14 15:50:32,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:32,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:32,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:32,204 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:32,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:32,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:32,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:32,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:32,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:32,246 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2019-01-14 15:50:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:32,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:32,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 18 [2019-01-14 15:50:32,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-14 15:50:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-14 15:50:32,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-01-14 15:50:32,270 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 18 states. [2019-01-14 15:50:34,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:34,505 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-01-14 15:50:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-14 15:50:34,512 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-01-14 15:50:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:34,514 INFO L225 Difference]: With dead ends: 89 [2019-01-14 15:50:34,514 INFO L226 Difference]: Without dead ends: 84 [2019-01-14 15:50:34,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=553, Invalid=2203, Unknown=0, NotChecked=0, Total=2756 [2019-01-14 15:50:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-14 15:50:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 30. [2019-01-14 15:50:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 15:50:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-01-14 15:50:34,536 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 24 [2019-01-14 15:50:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:34,536 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-01-14 15:50:34,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-14 15:50:34,537 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-01-14 15:50:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 15:50:34,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:34,542 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:34,542 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:34,542 INFO L82 PathProgramCache]: Analyzing trace with hash -462854061, now seen corresponding path program 3 times [2019-01-14 15:50:34,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:34,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:34,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:34,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:50:34,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:34,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:35,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 15:50:35,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:50:35,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 15:50:35,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:35,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:35,817 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 15:50:35,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:35,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 30 [2019-01-14 15:50:35,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-14 15:50:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-14 15:50:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2019-01-14 15:50:35,838 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 30 states. [2019-01-14 15:50:37,606 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 31 [2019-01-14 15:50:38,812 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 29 [2019-01-14 15:50:39,567 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 34 [2019-01-14 15:50:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:39,651 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2019-01-14 15:50:39,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-14 15:50:39,651 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 26 [2019-01-14 15:50:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:39,652 INFO L225 Difference]: With dead ends: 89 [2019-01-14 15:50:39,653 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 15:50:39,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=804, Invalid=3356, Unknown=0, NotChecked=0, Total=4160 [2019-01-14 15:50:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 15:50:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 27. [2019-01-14 15:50:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 15:50:39,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-14 15:50:39,664 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 26 [2019-01-14 15:50:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:39,664 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-14 15:50:39,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-14 15:50:39,664 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-14 15:50:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-14 15:50:39,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:39,666 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:39,667 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1209026451, now seen corresponding path program 1 times [2019-01-14 15:50:39,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:39,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:39,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:50:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:39,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:39,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:39,970 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-01-14 15:50:39,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:40,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:40,126 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 15:50:40,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2019-01-14 15:50:40,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-14 15:50:40,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 39 [2019-01-14 15:50:40,143 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,152 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-01-14 15:50:40,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 44 [2019-01-14 15:50:40,230 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 15:50:40,230 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 28 treesize of output 59 [2019-01-14 15:50:40,313 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2019-01-14 15:50:40,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 47 [2019-01-14 15:50:40,404 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,476 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 15:50:40,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 39 [2019-01-14 15:50:40,482 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,540 INFO L267 ElimStorePlain]: Start of recursive call 6: 4 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:50:40,580 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:50:40,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-01-14 15:50:40,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2019-01-14 15:50:40,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:50:40,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2019-01-14 15:50:40,646 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,653 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2019-01-14 15:50:40,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 15:50:40,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 15:50:40,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 23 [2019-01-14 15:50:40,700 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,731 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,740 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,750 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:40,813 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 8 variables, input treesize:42, output treesize:1 [2019-01-14 15:50:41,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:41,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:41,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:41,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:41,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:41,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:41,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:41,079 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:41,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:41,089 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2019-01-14 15:50:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:41,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:41,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 20 [2019-01-14 15:50:41,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-14 15:50:41,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-14 15:50:41,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2019-01-14 15:50:41,113 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 20 states. [2019-01-14 15:50:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:42,696 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2019-01-14 15:50:42,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-14 15:50:42,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 26 [2019-01-14 15:50:42,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:42,697 INFO L225 Difference]: With dead ends: 53 [2019-01-14 15:50:42,698 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 15:50:42,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=443, Invalid=1537, Unknown=0, NotChecked=0, Total=1980 [2019-01-14 15:50:42,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 15:50:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 29. [2019-01-14 15:50:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 15:50:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-14 15:50:42,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-14 15:50:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:42,709 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-14 15:50:42,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-14 15:50:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-14 15:50:42,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-14 15:50:42,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:42,711 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:42,712 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:42,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:42,712 INFO L82 PathProgramCache]: Analyzing trace with hash -551918600, now seen corresponding path program 2 times [2019-01-14 15:50:42,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:42,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:42,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:42,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 15:50:42,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:42,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:43,000 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-01-14 15:50:43,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 15:50:43,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 15:50:43,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:43,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:43,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:43,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:43,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:43,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:43,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-01-14 15:50:43,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-01-14 15:50:43,290 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 15:50:43,295 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:43,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 15:50:43,307 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:43, output treesize:5 [2019-01-14 15:50:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:43,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:43,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 22 [2019-01-14 15:50:43,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 15:50:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 15:50:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2019-01-14 15:50:43,333 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 22 states. [2019-01-14 15:50:45,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:45,275 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2019-01-14 15:50:45,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 15:50:45,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-01-14 15:50:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:45,277 INFO L225 Difference]: With dead ends: 57 [2019-01-14 15:50:45,277 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 15:50:45,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=582, Invalid=1968, Unknown=0, NotChecked=0, Total=2550 [2019-01-14 15:50:45,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 15:50:45,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 31. [2019-01-14 15:50:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 15:50:45,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-14 15:50:45,287 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-14 15:50:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:45,288 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-14 15:50:45,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 15:50:45,288 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-14 15:50:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-14 15:50:45,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 15:50:45,291 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 15:50:45,292 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-14 15:50:45,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 15:50:45,292 INFO L82 PathProgramCache]: Analyzing trace with hash -602997987, now seen corresponding path program 3 times [2019-01-14 15:50:45,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 15:50:45,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 15:50:45,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:45,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 15:50:45,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 15:50:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 15:50:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 15:50:45,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 15:50:45,690 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-01-14 15:50:45,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 15:50:45,726 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 15:50:45,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 15:50:45,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 15:50:46,277 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-14 15:50:46,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 15:50:46,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 32 [2019-01-14 15:50:46,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-14 15:50:46,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-14 15:50:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2019-01-14 15:50:46,298 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 32 states. [2019-01-14 15:50:49,148 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-14 15:50:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 15:50:50,054 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2019-01-14 15:50:50,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-14 15:50:50,054 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 30 [2019-01-14 15:50:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 15:50:50,055 INFO L225 Difference]: With dead ends: 57 [2019-01-14 15:50:50,055 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 15:50:50,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1159 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1108, Invalid=4442, Unknown=0, NotChecked=0, Total=5550 [2019-01-14 15:50:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 15:50:50,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 15:50:50,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 15:50:50,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 15:50:50,059 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2019-01-14 15:50:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 15:50:50,059 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 15:50:50,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-14 15:50:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 15:50:50,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 15:50:50,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 15:50:50,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,143 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,152 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,196 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 62 [2019-01-14 15:50:50,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,306 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 82 [2019-01-14 15:50:50,331 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,353 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,375 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,666 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,771 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-14 15:50:50,869 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 165 [2019-01-14 15:50:52,415 WARN L181 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 39 DAG size of output: 28 [2019-01-14 15:50:52,787 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-01-14 15:50:53,154 WARN L181 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 27 [2019-01-14 15:50:53,891 WARN L181 SmtUtils]: Spent 734.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 35 [2019-01-14 15:50:53,935 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 44) no Hoare annotation was computed. [2019-01-14 15:50:53,935 INFO L448 ceAbstractionStarter]: For program point L35-4(lines 35 44) no Hoare annotation was computed. [2019-01-14 15:50:53,936 INFO L444 ceAbstractionStarter]: At program point L27(lines 25 28) the Hoare annotation is: (let ((.cse8 (select (select |#memory_int| ULTIMATE.start_main_~pd2~0.base) ULTIMATE.start_main_~pd2~0.offset))) (let ((.cse0 (<= .cse8 ULTIMATE.start_main_~i~0)) (.cse2 (<= ULTIMATE.start_main_~i~0 .cse8)) (.cse1 (and (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (not (= |~#d1~0.base| |~#d2~0.base|)) (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (not (= ULTIMATE.start_main_~pd1~0.base 0)))) (.cse3 (= 0 |~#d1~0.offset|)) (.cse4 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse5 (= 0 ULTIMATE.start_main_~pd1~0.offset)) (.cse6 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset)) (.cse7 (= 1 |ULTIMATE.start_check_#res|))) (or (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse2 (and (= ULTIMATE.start_main_~pd1~0.offset |~#d2~0.offset|) (and .cse1 .cse3)) .cse4 .cse5 .cse6 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|) .cse7)))) [2019-01-14 15:50:53,937 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 18) no Hoare annotation was computed. [2019-01-14 15:50:53,937 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-14 15:50:53,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 15:50:53,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 15:50:53,937 INFO L451 ceAbstractionStarter]: At program point L49(lines 30 50) the Hoare annotation is: true [2019-01-14 15:50:53,937 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-01-14 15:50:53,937 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-01-14 15:50:53,938 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 15:50:53,938 INFO L444 ceAbstractionStarter]: At program point L42(lines 31 50) the Hoare annotation is: false [2019-01-14 15:50:53,938 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 38 40) no Hoare annotation was computed. [2019-01-14 15:50:53,938 INFO L444 ceAbstractionStarter]: At program point L38-3(lines 38 40) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~i~0 (select (select |#memory_int| ULTIMATE.start_main_~pa~0.base) ULTIMATE.start_main_~pa~0.offset))) (.cse0 (and (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base) (not (= |~#d1~0.base| |~#d2~0.base|)) (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset) (not (= ULTIMATE.start_main_~pd1~0.base 0)))) (.cse2 (= 0 |~#d1~0.offset|)) (.cse3 (= ULTIMATE.start_main_~pd2~0.base ULTIMATE.start_main_~pa~0.base)) (.cse4 (= 0 ULTIMATE.start_main_~pd1~0.offset)) (.cse5 (= ULTIMATE.start_main_~pa~0.offset ULTIMATE.start_main_~pd2~0.offset))) (or (and (= ULTIMATE.start_main_~pd1~0.base |~#d1~0.base|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse1 (and (= ULTIMATE.start_main_~pd1~0.offset |~#d2~0.offset|) (and .cse0 .cse2)) .cse3 .cse4 .cse5 (= ULTIMATE.start_main_~pd1~0.base |~#d2~0.base|)))) [2019-01-14 15:50:53,938 INFO L448 ceAbstractionStarter]: For program point L38-4(lines 38 40) no Hoare annotation was computed. [2019-01-14 15:50:53,938 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-14 15:50:53,939 INFO L448 ceAbstractionStarter]: For program point L22-2(line 22) no Hoare annotation was computed. [2019-01-14 15:50:53,939 INFO L444 ceAbstractionStarter]: At program point L22-3(lines 20 23) the Hoare annotation is: (let ((.cse0 (= 0 |~#d1~0.offset|))) (or (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) .cse0 (= |ULTIMATE.start_get_dummy_#res.base| |~#d1~0.base|)) (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= 0 |~#d2~0.offset|) (= |~#d2~0.base| |ULTIMATE.start_get_dummy_#res.base|) .cse0 (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))))) [2019-01-14 15:50:53,939 INFO L448 ceAbstractionStarter]: For program point L22-4(line 22) no Hoare annotation was computed. [2019-01-14 15:50:53,939 INFO L448 ceAbstractionStarter]: For program point L22-6(line 22) no Hoare annotation was computed. [2019-01-14 15:50:53,939 INFO L444 ceAbstractionStarter]: At program point L22-7(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and (not (= ULTIMATE.start_main_~pd1~0.base |ULTIMATE.start_get_dummy_#res.base|)) .cse0) (and (= 0 |~#d1~0.offset|) (= 0 ULTIMATE.start_main_~pd1~0.offset) (or (and .cse0 (= |~#d1~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |ULTIMATE.start_get_dummy_#res.base| |~#d1~0.base|)) (and (= |~#d2~0.offset| |ULTIMATE.start_get_dummy_#res.offset|) (= |~#d2~0.base| |ULTIMATE.start_get_dummy_#res.base|) (= |ULTIMATE.start_get_dummy_#res.offset| ULTIMATE.start_main_~pd1~0.offset) (not (= |~#d1~0.base| |ULTIMATE.start_get_dummy_#res.base|))))))) [2019-01-14 15:50:53,939 INFO L448 ceAbstractionStarter]: For program point L22-8(line 22) no Hoare annotation was computed. [2019-01-14 15:50:53,939 INFO L448 ceAbstractionStarter]: For program point L22-10(line 22) no Hoare annotation was computed. [2019-01-14 15:50:53,940 INFO L444 ceAbstractionStarter]: At program point L22-11(lines 20 23) the Hoare annotation is: (let ((.cse0 (not (= |~#d1~0.base| |~#d2~0.base|)))) (or (and .cse0 (not (= ULTIMATE.start_main_~pd1~0.base ULTIMATE.start_main_~pd2~0.base))) (and (and (let ((.cse1 (= ULTIMATE.start_main_~pd2~0.offset ULTIMATE.start_main_~pd1~0.offset))) (or (and (= |~#d2~0.base| ULTIMATE.start_main_~pd1~0.base) (= |~#d2~0.offset| ULTIMATE.start_main_~pd1~0.offset) .cse1 .cse0) (and .cse0 (and (= |~#d1~0.base| ULTIMATE.start_main_~pd1~0.base) .cse1)))) (= 0 |~#d1~0.offset|)) (= 0 ULTIMATE.start_main_~pd1~0.offset)))) [2019-01-14 15:50:53,940 INFO L448 ceAbstractionStarter]: For program point L35(line 35) no Hoare annotation was computed. [2019-01-14 15:50:53,966 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,968 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,969 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,972 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,973 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,978 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,981 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:53,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 03:50:53 BoogieIcfgContainer [2019-01-14 15:50:53,985 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 15:50:53,985 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 15:50:53,985 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 15:50:53,988 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 15:50:53,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:22" (3/4) ... [2019-01-14 15:50:53,999 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 15:50:54,014 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 15:50:54,015 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-14 15:50:54,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(d1 == d2) && d1 == \result) && 0 == d1) && \result == d1) || ((((d2 == \result && 0 == d2) && d2 == \result) && 0 == d1) && !(d1 == \result)) [2019-01-14 15:50:54,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(pd1 == \result) && !(d1 == d2)) || ((0 == d1 && 0 == pd1) && (((!(d1 == d2) && d1 == \result) && \result == d1) || (((d2 == \result && d2 == \result) && \result == pd1) && !(d1 == \result)))) [2019-01-14 15:50:54,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((pd1 == d1 && unknown-#memory_int-unknown[pd2][pd2] <= i) && ((pd1 == pd2 && !(d1 == d2)) && pd2 == pd1) && !(pd1 == 0)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && 1 == \result) || (((((((unknown-#memory_int-unknown[pd2][pd2] <= i && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd1 == d2 && (((pd1 == pd2 && !(d1 == d2)) && pd2 == pd1) && !(pd1 == 0)) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && pd1 == d2) && 1 == \result) [2019-01-14 15:50:54,078 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 15:50:54,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 15:50:54,080 INFO L168 Benchmark]: Toolchain (without parser) took 32728.30 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 394.8 MB). Free memory was 951.4 MB in the beginning and 815.7 MB in the end (delta: 135.7 MB). Peak memory consumption was 530.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:54,081 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:50:54,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.73 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:54,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.38 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:54,084 INFO L168 Benchmark]: Boogie Preprocessor took 32.62 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 15:50:54,084 INFO L168 Benchmark]: RCFGBuilder took 594.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:54,085 INFO L168 Benchmark]: TraceAbstraction took 31610.49 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 281.0 MB). Free memory was 1.1 GB in the beginning and 827.8 MB in the end (delta: 252.8 MB). Peak memory consumption was 533.8 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:54,086 INFO L168 Benchmark]: Witness Printer took 93.47 ms. Allocated memory is still 1.4 GB. Free memory was 827.8 MB in the beginning and 815.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2019-01-14 15:50:54,091 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.73 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.38 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.62 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 594.22 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -145.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31610.49 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 281.0 MB). Free memory was 1.1 GB in the beginning and 827.8 MB in the end (delta: 252.8 MB). Peak memory consumption was 533.8 MB. Max. memory is 11.5 GB. * Witness Printer took 93.47 ms. Allocated memory is still 1.4 GB. Free memory was 827.8 MB in the beginning and 815.7 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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: 20]: Loop Invariant Derived loop invariant: (!(pd1 == \result) && !(d1 == d2)) || ((0 == d1 && 0 == pd1) && (((!(d1 == d2) && d1 == \result) && \result == d1) || (((d2 == \result && d2 == \result) && \result == pd1) && !(d1 == \result)))) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(d1 == d2) && !(pd1 == pd2)) || ((((((d2 == pd1 && d2 == pd1) && pd2 == pd1) && !(d1 == d2)) || (!(d1 == d2) && d1 == pd1 && pd2 == pd1)) && 0 == d1) && 0 == pd1) - InvariantResult [Line: 25]: Loop Invariant [2019-01-14 15:50:54,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,113 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,114 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((((pd1 == d1 && unknown-#memory_int-unknown[pd2][pd2] <= i) && ((pd1 == pd2 && !(d1 == d2)) && pd2 == pd1) && !(pd1 == 0)) && i <= unknown-#memory_int-unknown[pd2][pd2]) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && 1 == \result) || (((((((unknown-#memory_int-unknown[pd2][pd2] <= i && i <= unknown-#memory_int-unknown[pd2][pd2]) && pd1 == d2 && (((pd1 == pd2 && !(d1 == d2)) && pd2 == pd1) && !(pd1 == 0)) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && pd1 == d2) && 1 == \result) - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((!(d1 == d2) && d1 == \result) && 0 == d1) && \result == d1) || ((((d2 == \result && 0 == d2) && d2 == \result) && 0 == d1) && !(d1 == \result)) - InvariantResult [Line: 38]: Loop Invariant [2019-01-14 15:50:54,123 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,124 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,126 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-14 15:50:54,127 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((pd1 == d1 && ((pd1 == pd2 && !(d1 == d2)) && pd2 == pd1) && !(pd1 == 0)) && i <= unknown-#memory_int-unknown[pa][pa]) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) || (((((i <= unknown-#memory_int-unknown[pa][pa] && pd1 == d2 && (((pd1 == pd2 && !(d1 == d2)) && pd2 == pd1) && !(pd1 == 0)) && 0 == d1) && pd2 == pa) && 0 == pd1) && pa == pd2) && pd1 == d2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 1 error locations. SAFE Result, 31.5s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 18.9s AutomataDifference, 0.0s DeadEndRemovalTime, 3.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 210 SDtfs, 1029 SDslu, 1303 SDs, 0 SdLazy, 2760 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 126 SyntacticMatches, 8 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3968 ImplicationChecksByTransitivity, 20.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=2, 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 323 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 47 NumberOfFragments, 306 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1935137 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 132102 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 65612 SizeOfPredicates, 70 NumberOfNonLiveVariables, 778 ConjunctsInSsa, 163 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 34/164 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...