./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.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/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.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 6f330f622534898bf170bbd5a7ac37bee3deb574 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-12 15:11:48,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 15:11:48,441 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 15:11:48,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 15:11:48,454 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 15:11:48,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 15:11:48,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 15:11:48,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 15:11:48,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 15:11:48,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 15:11:48,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 15:11:48,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 15:11:48,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 15:11:48,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 15:11:48,468 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 15:11:48,469 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 15:11:48,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 15:11:48,472 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 15:11:48,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 15:11:48,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 15:11:48,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 15:11:48,486 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 15:11:48,488 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 15:11:48,489 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 15:11:48,489 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 15:11:48,490 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 15:11:48,494 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 15:11:48,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 15:11:48,499 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 15:11:48,501 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 15:11:48,501 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 15:11:48,502 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 15:11:48,504 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 15:11:48,504 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 15:11:48,505 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 15:11:48,507 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 15:11:48,507 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 15:11:48,541 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 15:11:48,542 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 15:11:48,544 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 15:11:48,544 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 15:11:48,544 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 15:11:48,544 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 15:11:48,547 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 15:11:48,547 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 15:11:48,547 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 15:11:48,547 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 15:11:48,547 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 15:11:48,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 15:11:48,550 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 15:11:48,550 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 15:11:48,550 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 15:11:48,550 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 15:11:48,551 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 15:11:48,551 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 15:11:48,551 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 15:11:48,551 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 15:11:48,551 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 15:11:48,552 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 15:11:48,552 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 15:11:48,552 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 15:11:48,552 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 15:11:48,552 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 15:11:48,552 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 15:11:48,553 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 15:11:48,556 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 -> 6f330f622534898bf170bbd5a7ac37bee3deb574 [2019-01-12 15:11:48,628 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 15:11:48,654 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 15:11:48,659 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 15:11:48,660 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 15:11:48,661 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 15:11:48,661 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:11:48,722 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ad29a76/d5f9d2e8fabf4ae09186ade30d3adb0a/FLAG8272a919d [2019-01-12 15:11:49,202 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 15:11:49,203 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/recursive-simple/id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:11:49,209 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ad29a76/d5f9d2e8fabf4ae09186ade30d3adb0a/FLAG8272a919d [2019-01-12 15:11:49,577 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ad29a76/d5f9d2e8fabf4ae09186ade30d3adb0a [2019-01-12 15:11:49,581 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 15:11:49,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 15:11:49,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:49,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 15:11:49,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 15:11:49,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,596 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0317a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49, skipping insertion in model container [2019-01-12 15:11:49,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 15:11:49,631 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 15:11:49,829 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:49,835 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 15:11:49,858 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 15:11:49,881 INFO L195 MainTranslator]: Completed translation [2019-01-12 15:11:49,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49 WrapperNode [2019-01-12 15:11:49,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 15:11:49,883 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:49,883 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 15:11:49,883 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 15:11:49,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 15:11:49,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 15:11:49,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 15:11:49,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 15:11:49,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,952 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,959 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,960 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (1/1) ... [2019-01-12 15:11:49,963 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 15:11:49,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 15:11:49,964 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 15:11:49,964 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 15:11:49,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (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-12 15:11:50,126 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2019-01-12 15:11:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2019-01-12 15:11:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 15:11:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 15:11:50,127 INFO L130 BoogieDeclarations]: Found specification of procedure id [2019-01-12 15:11:50,127 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2019-01-12 15:11:50,512 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 15:11:50,512 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-12 15:11:50,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:50 BoogieIcfgContainer [2019-01-12 15:11:50,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 15:11:50,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 15:11:50,515 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 15:11:50,518 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 15:11:50,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:11:49" (1/3) ... [2019-01-12 15:11:50,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618a0ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:50, skipping insertion in model container [2019-01-12 15:11:50,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:11:49" (2/3) ... [2019-01-12 15:11:50,520 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618a0ec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:11:50, skipping insertion in model container [2019-01-12 15:11:50,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:50" (3/3) ... [2019-01-12 15:11:50,522 INFO L112 eAbstractionObserver]: Analyzing ICFG id2_b5_o10_true-unreach-call_true-termination_true-no-overflow.c [2019-01-12 15:11:50,540 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 15:11:50,556 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 15:11:50,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 15:11:50,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 15:11:50,603 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 15:11:50,604 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 15:11:50,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 15:11:50,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 15:11:50,604 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 15:11:50,604 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 15:11:50,604 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 15:11:50,604 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 15:11:50,628 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-01-12 15:11:50,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-12 15:11:50,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:50,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:50,638 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:50,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:50,645 INFO L82 PathProgramCache]: Analyzing trace with hash -394807891, now seen corresponding path program 1 times [2019-01-12 15:11:50,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:50,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:50,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:50,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:50,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:50,967 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-12 15:11:50,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:50,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:50,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:50,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:50,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:50,989 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-01-12 15:11:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:51,052 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-01-12 15:11:51,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:51,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-01-12 15:11:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:51,065 INFO L225 Difference]: With dead ends: 35 [2019-01-12 15:11:51,065 INFO L226 Difference]: Without dead ends: 22 [2019-01-12 15:11:51,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:51,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-12 15:11:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-12 15:11:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-12 15:11:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-01-12 15:11:51,116 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2019-01-12 15:11:51,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:51,117 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-01-12 15:11:51,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:51,117 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-01-12 15:11:51,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 15:11:51,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:51,119 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:51,120 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:51,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1343664860, now seen corresponding path program 1 times [2019-01-12 15:11:51,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:51,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:51,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:51,330 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-12 15:11:51,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:51,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:51,334 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states. [2019-01-12 15:11:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:51,417 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-01-12 15:11:51,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:51,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-01-12 15:11:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:51,420 INFO L225 Difference]: With dead ends: 40 [2019-01-12 15:11:51,420 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 15:11:51,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 15:11:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 15:11:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:11:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-12 15:11:51,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-01-12 15:11:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:51,431 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-12 15:11:51,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:51,431 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-12 15:11:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 15:11:51,434 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:51,434 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:51,434 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:51,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:51,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1372294011, now seen corresponding path program 1 times [2019-01-12 15:11:51,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:51,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:51,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:51,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:51,819 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-12 15:11:51,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:51,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 15:11:51,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 15:11:51,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 15:11:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 15:11:51,825 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 8 states. [2019-01-12 15:11:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:51,916 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2019-01-12 15:11:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 15:11:51,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2019-01-12 15:11:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:51,919 INFO L225 Difference]: With dead ends: 32 [2019-01-12 15:11:51,919 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 15:11:51,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-12 15:11:51,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 15:11:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 15:11:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 15:11:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-12 15:11:51,928 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 16 [2019-01-12 15:11:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:51,928 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-12 15:11:51,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 15:11:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-12 15:11:51,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:51,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:51,930 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:51,930 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:51,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1000474712, now seen corresponding path program 1 times [2019-01-12 15:11:51,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:51,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:51,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:51,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:51,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:52,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:52,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:52,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:52,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:52,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:52,128 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2019-01-12 15:11:52,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:52,157 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-01-12 15:11:52,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:52,159 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-12 15:11:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:52,160 INFO L225 Difference]: With dead ends: 44 [2019-01-12 15:11:52,160 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:11:52,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:52,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:11:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-12 15:11:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 15:11:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 15:11:52,168 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-01-12 15:11:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:52,168 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 15:11:52,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:52,169 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 15:11:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:52,170 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:52,170 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:52,170 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:52,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1196988217, now seen corresponding path program 1 times [2019-01-12 15:11:52,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:52,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:52,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:52,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:52,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:52,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:52,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:52,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:52,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:52,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:52,289 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-01-12 15:11:52,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:52,320 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-01-12 15:11:52,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:52,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-01-12 15:11:52,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:52,322 INFO L225 Difference]: With dead ends: 36 [2019-01-12 15:11:52,323 INFO L226 Difference]: Without dead ends: 32 [2019-01-12 15:11:52,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:52,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-12 15:11:52,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-12 15:11:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 15:11:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 15:11:52,330 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-01-12 15:11:52,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:52,331 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 15:11:52,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:52,331 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 15:11:52,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 15:11:52,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:52,332 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:52,332 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:52,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:52,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1168359066, now seen corresponding path program 1 times [2019-01-12 15:11:52,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:52,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:52,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:52,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:52,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:53,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:53,027 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-12 15:11:53,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:53,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 15:11:53,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:53,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-12 15:11:53,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 15:11:53,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 15:11:53,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-01-12 15:11:53,225 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 12 states. [2019-01-12 15:11:53,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:53,443 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-01-12 15:11:53,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 15:11:53,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-01-12 15:11:53,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:53,446 INFO L225 Difference]: With dead ends: 52 [2019-01-12 15:11:53,446 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 15:11:53,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-01-12 15:11:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 15:11:53,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-01-12 15:11:53,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-12 15:11:53,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-01-12 15:11:53,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 23 [2019-01-12 15:11:53,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:53,454 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-01-12 15:11:53,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 15:11:53,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-01-12 15:11:53,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 15:11:53,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:53,456 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:53,456 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:53,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:53,456 INFO L82 PathProgramCache]: Analyzing trace with hash -26461427, now seen corresponding path program 1 times [2019-01-12 15:11:53,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:53,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:53,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:53,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:53,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:53,675 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 15:11:53,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 15:11:53,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 15:11:53,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 15:11:53,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:53,676 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2019-01-12 15:11:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:53,754 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-01-12 15:11:53,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 15:11:53,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-01-12 15:11:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:53,756 INFO L225 Difference]: With dead ends: 50 [2019-01-12 15:11:53,756 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 15:11:53,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 15:11:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 15:11:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2019-01-12 15:11:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-12 15:11:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-01-12 15:11:53,762 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 30 [2019-01-12 15:11:53,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:53,763 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-01-12 15:11:53,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 15:11:53,763 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-01-12 15:11:53,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 15:11:53,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:53,764 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:53,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:53,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash -222974932, now seen corresponding path program 1 times [2019-01-12 15:11:53,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:53,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:53,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:53,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:53,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:54,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:54,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:54,152 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-12 15:11:54,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:54,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:54,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-12 15:11:54,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:54,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-01-12 15:11:54,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-12 15:11:54,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-12 15:11:54,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-01-12 15:11:54,274 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 15 states. [2019-01-12 15:11:54,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:54,826 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2019-01-12 15:11:54,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 15:11:54,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2019-01-12 15:11:54,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:54,829 INFO L225 Difference]: With dead ends: 68 [2019-01-12 15:11:54,829 INFO L226 Difference]: Without dead ends: 48 [2019-01-12 15:11:54,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:11:54,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-12 15:11:54,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 38. [2019-01-12 15:11:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-12 15:11:54,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2019-01-12 15:11:54,838 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 30 [2019-01-12 15:11:54,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:54,839 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2019-01-12 15:11:54,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-12 15:11:54,839 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2019-01-12 15:11:54,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-12 15:11:54,842 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:54,842 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:54,845 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:54,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:54,845 INFO L82 PathProgramCache]: Analyzing trace with hash -141607649, now seen corresponding path program 2 times [2019-01-12 15:11:54,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:54,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:54,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:54,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 15:11:54,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:55,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 15:11:55,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:55,339 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-12 15:11:55,360 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:55,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-12 15:11:55,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:55,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-12 15:11:55,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 15:11:55,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-01-12 15:11:55,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-12 15:11:55,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-12 15:11:55,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2019-01-12 15:11:55,515 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 18 states. [2019-01-12 15:11:55,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:55,761 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2019-01-12 15:11:55,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 15:11:55,762 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2019-01-12 15:11:55,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:55,764 INFO L225 Difference]: With dead ends: 76 [2019-01-12 15:11:55,764 INFO L226 Difference]: Without dead ends: 56 [2019-01-12 15:11:55,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2019-01-12 15:11:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-12 15:11:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 42. [2019-01-12 15:11:55,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 15:11:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-01-12 15:11:55,773 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 37 [2019-01-12 15:11:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:55,774 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-01-12 15:11:55,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-12 15:11:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-01-12 15:11:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 15:11:55,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 15:11:55,777 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 15:11:55,778 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 15:11:55,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 15:11:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash -90623267, now seen corresponding path program 2 times [2019-01-12 15:11:55,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 15:11:55,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 15:11:55,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:55,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-12 15:11:55,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 15:11:55,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 15:11:56,326 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 15:11:56,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 15:11:56,327 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-12 15:11:56,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-12 15:11:56,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-12 15:11:56,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-12 15:11:56,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 15:11:56,563 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-01-12 15:11:56,584 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 15:11:56,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [20] total 23 [2019-01-12 15:11:56,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-12 15:11:56,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-12 15:11:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=458, Unknown=0, NotChecked=0, Total=506 [2019-01-12 15:11:56,586 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 23 states. [2019-01-12 15:11:56,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 15:11:56,944 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2019-01-12 15:11:56,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 15:11:56,946 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-12 15:11:56,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 15:11:56,946 INFO L225 Difference]: With dead ends: 84 [2019-01-12 15:11:56,946 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 15:11:56,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2019-01-12 15:11:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 15:11:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 15:11:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 15:11:56,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 15:11:56,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2019-01-12 15:11:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 15:11:56,954 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 15:11:56,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-12 15:11:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 15:11:56,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 15:11:56,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 15:11:56,974 INFO L448 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-01-12 15:11:56,975 INFO L451 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: true [2019-01-12 15:11:56,975 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-01-12 15:11:56,975 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-01-12 15:11:56,975 INFO L448 ceAbstractionStarter]: For program point id2EXIT(lines 14 19) no Hoare annotation was computed. [2019-01-12 15:11:56,975 INFO L451 ceAbstractionStarter]: At program point id2ENTRY(lines 14 19) the Hoare annotation is: true [2019-01-12 15:11:56,975 INFO L448 ceAbstractionStarter]: For program point id2FINAL(lines 14 19) no Hoare annotation was computed. [2019-01-12 15:11:56,975 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 15:11:56,975 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 15:11:56,975 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 15:11:56,976 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 15:11:56,976 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 15:11:56,976 INFO L451 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: true [2019-01-12 15:11:56,976 INFO L448 ceAbstractionStarter]: For program point L23-1(line 23) no Hoare annotation was computed. [2019-01-12 15:11:56,976 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 25) no Hoare annotation was computed. [2019-01-12 15:11:56,976 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 27) no Hoare annotation was computed. [2019-01-12 15:11:56,976 INFO L448 ceAbstractionStarter]: For program point idFINAL(lines 7 12) no Hoare annotation was computed. [2019-01-12 15:11:56,976 INFO L448 ceAbstractionStarter]: For program point idEXIT(lines 7 12) no Hoare annotation was computed. [2019-01-12 15:11:56,977 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2019-01-12 15:11:56,977 INFO L451 ceAbstractionStarter]: At program point L9(line 9) the Hoare annotation is: true [2019-01-12 15:11:56,977 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2019-01-12 15:11:56,977 INFO L448 ceAbstractionStarter]: For program point L9-1(line 9) no Hoare annotation was computed. [2019-01-12 15:11:56,977 INFO L451 ceAbstractionStarter]: At program point idENTRY(lines 7 12) the Hoare annotation is: true [2019-01-12 15:11:56,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:11:56 BoogieIcfgContainer [2019-01-12 15:11:56,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 15:11:56,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 15:11:56,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 15:11:56,982 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 15:11:56,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:11:50" (3/4) ... [2019-01-12 15:11:56,986 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 15:11:56,992 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id2 [2019-01-12 15:11:56,993 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2019-01-12 15:11:56,998 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 15:11:56,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 15:11:57,048 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 15:11:57,048 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 15:11:57,049 INFO L168 Benchmark]: Toolchain (without parser) took 7467.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -146.0 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:57,052 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:57,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.18 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:57,053 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.79 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:57,053 INFO L168 Benchmark]: Boogie Preprocessor took 26.60 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 15:11:57,054 INFO L168 Benchmark]: RCFGBuilder took 550.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:57,055 INFO L168 Benchmark]: TraceAbstraction took 6465.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.2 MB). Peak memory consumption was 76.7 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:57,057 INFO L168 Benchmark]: Witness Printer took 67.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2019-01-12 15:11:57,062 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 298.18 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 52.79 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.60 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 550.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6465.83 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -7.2 MB). Peak memory consumption was 76.7 MB. Max. memory is 11.5 GB. * Witness Printer took 67.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 25]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 23 locations, 1 error locations. SAFE Result, 6.3s OverallTime, 10 OverallIterations, 3 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 263 SDtfs, 39 SDslu, 1901 SDs, 0 SdLazy, 676 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 240 GetRequests, 138 SyntacticMatches, 6 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 40 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 5 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 385 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 39417 SizeOfPredicates, 14 NumberOfNonLiveVariables, 238 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 105/165 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...