./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.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 7e1b4e42babcfba0789bfa7cb90840c832d315a4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:39:02,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:39:02,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:39:02,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:39:02,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:39:02,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:39:02,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:39:02,468 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:39:02,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:39:02,472 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:39:02,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:39:02,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:39:02,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:39:02,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:39:02,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:39:02,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:39:02,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:39:02,481 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:39:02,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:39:02,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:39:02,487 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:39:02,488 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:39:02,489 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:39:02,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:39:02,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:39:02,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:39:02,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:39:02,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:39:02,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:39:02,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:39:02,497 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:39:02,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:39:02,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:39:02,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:39:02,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:39:02,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:39:02,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:39:02,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:39:02,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:39:02,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:39:02,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:39:02,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:39:02,520 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:39:02,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:39:02,522 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:39:02,522 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:39:02,523 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:39:02,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:39:02,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:39:02,523 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:39:02,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:39:02,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:39:02,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:39:02,525 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:39:02,525 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:39:02,525 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:39:02,525 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:39:02,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:39:02,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:39:02,526 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:39:02,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:39:02,527 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:39:02,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:39:02,527 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:39:02,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:39:02,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:39:02,528 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:39:02,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:39:02,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:39:02,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:39:02,529 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:39:02,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 7e1b4e42babcfba0789bfa7cb90840c832d315a4 [2019-11-28 15:39:02,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:39:02,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:39:02,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:39:02,852 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:39:02,852 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:39:02,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2019-11-28 15:39:02,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3187c3f4e/765b96a7ba3f423989e7dab65650573f/FLAG652af6fa9 [2019-11-28 15:39:03,466 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:39:03,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2019-11-28 15:39:03,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3187c3f4e/765b96a7ba3f423989e7dab65650573f/FLAG652af6fa9 [2019-11-28 15:39:03,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3187c3f4e/765b96a7ba3f423989e7dab65650573f [2019-11-28 15:39:03,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:39:03,861 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:39:03,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:03,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:39:03,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:39:03,867 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:03" (1/1) ... [2019-11-28 15:39:03,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eb63f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:03, skipping insertion in model container [2019-11-28 15:39:03,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:39:03" (1/1) ... [2019-11-28 15:39:03,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:39:03,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:39:04,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:04,216 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:39:04,314 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:39:04,329 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:39:04,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04 WrapperNode [2019-11-28 15:39:04,330 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:39:04,331 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:04,331 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:39:04,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:39:04,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,348 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,380 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:39:04,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:39:04,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:39:04,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:39:04,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (1/1) ... [2019-11-28 15:39:04,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:39:04,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:39:04,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:39:04,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:39:04,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (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-11-28 15:39:04,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:39:04,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:39:05,004 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:39:05,005 INFO L287 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-28 15:39:05,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:05 BoogieIcfgContainer [2019-11-28 15:39:05,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:39:05,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:39:05,007 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:39:05,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:39:05,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:39:03" (1/3) ... [2019-11-28 15:39:05,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb0af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:05, skipping insertion in model container [2019-11-28 15:39:05,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:39:04" (2/3) ... [2019-11-28 15:39:05,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb0af8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:39:05, skipping insertion in model container [2019-11-28 15:39:05,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:05" (3/3) ... [2019-11-28 15:39:05,013 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2019-11-28 15:39:05,020 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:39:05,027 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:39:05,038 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:39:05,062 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:39:05,062 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:39:05,063 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:39:05,063 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:39:05,063 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:39:05,063 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:39:05,064 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:39:05,064 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:39:05,077 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-28 15:39:05,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:39:05,084 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:05,085 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:05,086 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:05,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:05,092 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-11-28 15:39:05,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:05,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65054098] [2019-11-28 15:39:05,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:05,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65054098] [2019-11-28 15:39:05,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:05,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:05,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887019314] [2019-11-28 15:39:05,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:05,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:05,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:05,318 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-11-28 15:39:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:05,374 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-11-28 15:39:05,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:05,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:39:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:05,388 INFO L225 Difference]: With dead ends: 149 [2019-11-28 15:39:05,389 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 15:39:05,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 15:39:05,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-28 15:39:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 15:39:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-11-28 15:39:05,431 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-11-28 15:39:05,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:05,432 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-11-28 15:39:05,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:05,432 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-11-28 15:39:05,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:39:05,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:05,434 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:05,434 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:05,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:05,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-11-28 15:39:05,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:05,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803745429] [2019-11-28 15:39:05,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:05,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803745429] [2019-11-28 15:39:05,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:05,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:39:05,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532535380] [2019-11-28 15:39:05,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:05,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:05,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:05,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:05,556 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-11-28 15:39:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:05,616 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-11-28 15:39:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:05,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-28 15:39:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:05,618 INFO L225 Difference]: With dead ends: 87 [2019-11-28 15:39:05,619 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 15:39:05,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:05,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 15:39:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-28 15:39:05,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 15:39:05,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-11-28 15:39:05,639 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-11-28 15:39:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:05,642 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-11-28 15:39:05,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:05,642 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-11-28 15:39:05,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:39:05,643 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:05,643 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:05,644 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:05,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:05,644 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-11-28 15:39:05,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:05,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662891171] [2019-11-28 15:39:05,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662891171] [2019-11-28 15:39:05,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:05,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:05,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398496453] [2019-11-28 15:39:05,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:05,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:05,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:05,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:05,747 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-11-28 15:39:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:05,887 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-11-28 15:39:05,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:05,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:39:05,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:05,892 INFO L225 Difference]: With dead ends: 121 [2019-11-28 15:39:05,892 INFO L226 Difference]: Without dead ends: 75 [2019-11-28 15:39:05,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:05,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-28 15:39:05,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-11-28 15:39:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-28 15:39:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-11-28 15:39:05,911 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-11-28 15:39:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:05,912 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-11-28 15:39:05,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:05,913 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-11-28 15:39:05,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:39:05,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:05,915 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:05,916 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:05,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:05,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-11-28 15:39:05,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:05,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541690427] [2019-11-28 15:39:05,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:05,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:05,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541690427] [2019-11-28 15:39:05,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:05,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:39:05,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393746848] [2019-11-28 15:39:05,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:05,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:05,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:05,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:05,995 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-11-28 15:39:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:06,113 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-11-28 15:39:06,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:06,113 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-28 15:39:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:06,115 INFO L225 Difference]: With dead ends: 155 [2019-11-28 15:39:06,115 INFO L226 Difference]: Without dead ends: 90 [2019-11-28 15:39:06,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-28 15:39:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-11-28 15:39:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 15:39:06,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-11-28 15:39:06,125 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-11-28 15:39:06,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:06,126 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-11-28 15:39:06,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-11-28 15:39:06,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:39:06,128 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:06,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:06,128 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:06,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-11-28 15:39:06,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:06,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136426567] [2019-11-28 15:39:06,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:06,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136426567] [2019-11-28 15:39:06,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:06,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:39:06,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715455919] [2019-11-28 15:39:06,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:39:06,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:06,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:39:06,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:06,224 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-11-28 15:39:06,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:06,298 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-11-28 15:39:06,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:39:06,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 15:39:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:06,299 INFO L225 Difference]: With dead ends: 108 [2019-11-28 15:39:06,300 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 15:39:06,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:39:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 15:39:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-28 15:39:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-28 15:39:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-11-28 15:39:06,318 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-11-28 15:39:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:06,319 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-11-28 15:39:06,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:39:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-11-28 15:39:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:39:06,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:06,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:06,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:06,324 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-11-28 15:39:06,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:06,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437317167] [2019-11-28 15:39:06,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:06,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437317167] [2019-11-28 15:39:06,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:06,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 15:39:06,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717860093] [2019-11-28 15:39:06,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:39:06,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:39:06,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:06,436 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-11-28 15:39:06,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:06,524 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-11-28 15:39:06,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:39:06,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 15:39:06,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:06,526 INFO L225 Difference]: With dead ends: 110 [2019-11-28 15:39:06,526 INFO L226 Difference]: Without dead ends: 63 [2019-11-28 15:39:06,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:39:06,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-28 15:39:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-28 15:39:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-28 15:39:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-11-28 15:39:06,533 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-11-28 15:39:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:06,533 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-11-28 15:39:06,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:39:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-11-28 15:39:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 15:39:06,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:06,535 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:06,535 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:06,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:06,535 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-11-28 15:39:06,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:06,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546905888] [2019-11-28 15:39:06,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:06,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:06,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546905888] [2019-11-28 15:39:06,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834129117] [2019-11-28 15:39:06,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:06,665 INFO L264 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 15:39:06,672 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:06,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:06,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:39:06,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-28 15:39:06,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697402526] [2019-11-28 15:39:06,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 15:39:06,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 15:39:06,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:39:06,696 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-11-28 15:39:06,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:06,793 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-11-28 15:39:06,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:39:06,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-28 15:39:06,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:06,795 INFO L225 Difference]: With dead ends: 133 [2019-11-28 15:39:06,795 INFO L226 Difference]: Without dead ends: 87 [2019-11-28 15:39:06,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:39:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-28 15:39:06,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-11-28 15:39:06,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 15:39:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-11-28 15:39:06,802 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-11-28 15:39:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:06,802 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-11-28 15:39:06,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 15:39:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-11-28 15:39:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 15:39:06,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:06,804 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:07,009 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:07,014 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:07,015 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-11-28 15:39:07,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:07,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436546891] [2019-11-28 15:39:07,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:07,123 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436546891] [2019-11-28 15:39:07,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775844879] [2019-11-28 15:39:07,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,189 INFO L264 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 15:39:07,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:07,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:39:07,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:39:07,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-28 15:39:07,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233147940] [2019-11-28 15:39:07,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:07,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:07,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:07,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 15:39:07,257 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 6 states. [2019-11-28 15:39:07,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:07,432 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-28 15:39:07,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 15:39:07,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-28 15:39:07,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:07,434 INFO L225 Difference]: With dead ends: 93 [2019-11-28 15:39:07,434 INFO L226 Difference]: Without dead ends: 89 [2019-11-28 15:39:07,436 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-28 15:39:07,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-28 15:39:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-11-28 15:39:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 15:39:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-11-28 15:39:07,450 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 34 [2019-11-28 15:39:07,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:07,451 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-28 15:39:07,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:07,452 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-11-28 15:39:07,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:39:07,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:07,457 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:07,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:07,669 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:07,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:07,670 INFO L82 PathProgramCache]: Analyzing trace with hash -2094293407, now seen corresponding path program 1 times [2019-11-28 15:39:07,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:07,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785721932] [2019-11-28 15:39:07,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:07,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785721932] [2019-11-28 15:39:07,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689195400] [2019-11-28 15:39:07,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:07,804 INFO L264 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 15:39:07,808 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:07,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:39:07,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:39:07,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-11-28 15:39:07,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311032143] [2019-11-28 15:39:07,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:07,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:07,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:07,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 15:39:07,851 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2019-11-28 15:39:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:07,961 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-11-28 15:39:07,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:39:07,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-28 15:39:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:07,962 INFO L225 Difference]: With dead ends: 76 [2019-11-28 15:39:07,963 INFO L226 Difference]: Without dead ends: 71 [2019-11-28 15:39:07,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 15:39:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-28 15:39:07,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-11-28 15:39:07,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 15:39:07,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-11-28 15:39:07,974 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 36 [2019-11-28 15:39:07,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:07,974 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-11-28 15:39:07,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-11-28 15:39:07,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:39:07,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:07,975 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:08,182 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:08,183 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:08,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:08,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2092446365, now seen corresponding path program 1 times [2019-11-28 15:39:08,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:08,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477017440] [2019-11-28 15:39:08,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:39:08,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477017440] [2019-11-28 15:39:08,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:39:08,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 15:39:08,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503092573] [2019-11-28 15:39:08,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 15:39:08,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:08,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 15:39:08,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 15:39:08,245 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 6 states. [2019-11-28 15:39:08,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:08,343 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-11-28 15:39:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 15:39:08,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-28 15:39:08,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:08,345 INFO L225 Difference]: With dead ends: 71 [2019-11-28 15:39:08,345 INFO L226 Difference]: Without dead ends: 61 [2019-11-28 15:39:08,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-28 15:39:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-28 15:39:08,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-28 15:39:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 15:39:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-11-28 15:39:08,350 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 36 [2019-11-28 15:39:08,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:08,351 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-11-28 15:39:08,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 15:39:08,351 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-11-28 15:39:08,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 15:39:08,352 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:08,352 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:08,352 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:08,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:08,353 INFO L82 PathProgramCache]: Analyzing trace with hash -828854686, now seen corresponding path program 1 times [2019-11-28 15:39:08,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:08,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527074651] [2019-11-28 15:39:08,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:08,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:08,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527074651] [2019-11-28 15:39:08,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256443790] [2019-11-28 15:39:08,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:08,505 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 15:39:08,507 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:39:08,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:39:08,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-11-28 15:39:08,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793790672] [2019-11-28 15:39:08,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 15:39:08,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:08,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 15:39:08,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-28 15:39:08,566 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-11-28 15:39:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:08,761 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-11-28 15:39:08,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 15:39:08,762 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-28 15:39:08,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:08,763 INFO L225 Difference]: With dead ends: 90 [2019-11-28 15:39:08,763 INFO L226 Difference]: Without dead ends: 65 [2019-11-28 15:39:08,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-28 15:39:08,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-28 15:39:08,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-11-28 15:39:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 15:39:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-28 15:39:08,778 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2019-11-28 15:39:08,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:08,778 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-28 15:39:08,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 15:39:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-11-28 15:39:08,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 15:39:08,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:08,780 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:08,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:08,989 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:08,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:08,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1188671725, now seen corresponding path program 1 times [2019-11-28 15:39:08,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:08,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571148079] [2019-11-28 15:39:08,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:09,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571148079] [2019-11-28 15:39:09,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473201319] [2019-11-28 15:39:09,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:09,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 15:39:09,149 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:09,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:39:09,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:39:09,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2019-11-28 15:39:09,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284272607] [2019-11-28 15:39:09,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 15:39:09,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:09,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 15:39:09,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-28 15:39:09,259 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 9 states. [2019-11-28 15:39:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:09,459 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-11-28 15:39:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 15:39:09,459 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-28 15:39:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:09,460 INFO L225 Difference]: With dead ends: 91 [2019-11-28 15:39:09,460 INFO L226 Difference]: Without dead ends: 67 [2019-11-28 15:39:09,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-11-28 15:39:09,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-28 15:39:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-28 15:39:09,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-28 15:39:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2019-11-28 15:39:09,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 41 [2019-11-28 15:39:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:09,466 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2019-11-28 15:39:09,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 15:39:09,468 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2019-11-28 15:39:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 15:39:09,469 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:39:09,470 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:39:09,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:09,678 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:39:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:39:09,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1516783191, now seen corresponding path program 1 times [2019-11-28 15:39:09,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:39:09,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423605006] [2019-11-28 15:39:09,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:39:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:39:09,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423605006] [2019-11-28 15:39:09,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670041454] [2019-11-28 15:39:09,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:39:09,800 INFO L264 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 15:39:09,810 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:39:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:39:09,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:39:09,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2019-11-28 15:39:09,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146695365] [2019-11-28 15:39:09,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 15:39:09,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:39:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 15:39:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-28 15:39:09,886 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2019-11-28 15:39:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:39:10,060 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2019-11-28 15:39:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 15:39:10,061 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-28 15:39:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:39:10,061 INFO L225 Difference]: With dead ends: 66 [2019-11-28 15:39:10,061 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:39:10,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-11-28 15:39:10,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:39:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:39:10,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:39:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:39:10,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-28 15:39:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:39:10,064 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:39:10,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 15:39:10,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:39:10,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:39:10,265 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:39:10,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:39:10,394 INFO L246 CegarLoopResult]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-11-28 15:39:10,394 INFO L246 CegarLoopResult]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-11-28 15:39:10,395 INFO L246 CegarLoopResult]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-11-28 15:39:10,395 INFO L246 CegarLoopResult]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-11-28 15:39:10,395 INFO L246 CegarLoopResult]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-11-28 15:39:10,395 INFO L246 CegarLoopResult]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-11-28 15:39:10,395 INFO L246 CegarLoopResult]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-11-28 15:39:10,395 INFO L246 CegarLoopResult]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-11-28 15:39:10,395 INFO L242 CegarLoopResult]: At program point L69(lines 18 71) the Hoare annotation is: (and (= 0 ULTIMATE.start_base2flt_~m) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2019-11-28 15:39:10,396 INFO L242 CegarLoopResult]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,396 INFO L242 CegarLoopResult]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,397 INFO L242 CegarLoopResult]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,397 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:39:10,397 INFO L246 CegarLoopResult]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-11-28 15:39:10,397 INFO L246 CegarLoopResult]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-11-28 15:39:10,397 INFO L242 CegarLoopResult]: At program point L70(lines 14 72) the Hoare annotation is: (and (= 0 |ULTIMATE.start_base2flt_#res|) (= 0 ULTIMATE.start_base2flt_~m) (<= 0 ULTIMATE.start_base2flt_~e) (= ULTIMATE.start_base2flt_~__retres4~0 0)) [2019-11-28 15:39:10,397 INFO L246 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-28 15:39:10,397 INFO L242 CegarLoopResult]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,397 INFO L242 CegarLoopResult]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-11-28 15:39:10,398 INFO L242 CegarLoopResult]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,398 INFO L246 CegarLoopResult]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-11-28 15:39:10,398 INFO L242 CegarLoopResult]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,398 INFO L242 CegarLoopResult]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,398 INFO L246 CegarLoopResult]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-11-28 15:39:10,398 INFO L242 CegarLoopResult]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,398 INFO L246 CegarLoopResult]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-11-28 15:39:10,398 INFO L242 CegarLoopResult]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,398 INFO L246 CegarLoopResult]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-11-28 15:39:10,399 INFO L246 CegarLoopResult]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-11-28 15:39:10,399 INFO L246 CegarLoopResult]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-11-28 15:39:10,399 INFO L246 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2019-11-28 15:39:10,399 INFO L242 CegarLoopResult]: At program point L206(lines 147 208) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sb~0)) (<= (+ ULTIMATE.start_main_~sb~0 1) 0) (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 ULTIMATE.start_main_~zero~0))) [2019-11-28 15:39:10,399 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:39:10,399 INFO L246 CegarLoopResult]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-11-28 15:39:10,399 INFO L246 CegarLoopResult]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-11-28 15:39:10,399 INFO L246 CegarLoopResult]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L242 CegarLoopResult]: At program point L207(lines 137 209) the Hoare annotation is: (or (and (= 0 ULTIMATE.start_mulflt_~__retres10~1) (= 0 |ULTIMATE.start_mulflt_#res|) (= 0 ULTIMATE.start_main_~zero~0)) (and (<= 1 ULTIMATE.start_main_~tmp~2) (<= 1 ULTIMATE.start_main_~sb~0)) (<= (+ ULTIMATE.start_main_~sb~0 1) 0)) [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-11-28 15:39:10,400 INFO L246 CegarLoopResult]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,401 INFO L242 CegarLoopResult]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-11-28 15:39:10,402 INFO L249 CegarLoopResult]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-11-28 15:39:10,402 INFO L246 CegarLoopResult]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L249 CegarLoopResult]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-11-28 15:39:10,403 INFO L246 CegarLoopResult]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-11-28 15:39:10,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:39:10 BoogieIcfgContainer [2019-11-28 15:39:10,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:39:10,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:39:10,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:39:10,433 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:39:10,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:39:05" (3/4) ... [2019-11-28 15:39:10,438 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:39:10,453 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-28 15:39:10,454 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 15:39:10,479 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 [2019-11-28 15:39:10,482 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sb)) || sb + 1 <= 0 [2019-11-28 15:39:10,558 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:39:10,558 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:39:10,562 INFO L168 Benchmark]: Toolchain (without parser) took 6698.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 961.7 MB in the beginning and 968.6 MB in the end (delta: -6.9 MB). Peak memory consumption was 185.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:10,563 INFO L168 Benchmark]: CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:10,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 468.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -137.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:10,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:39:10,565 INFO L168 Benchmark]: Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:10,565 INFO L168 Benchmark]: RCFGBuilder took 589.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:10,566 INFO L168 Benchmark]: TraceAbstraction took 5425.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 83.2 MB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:10,566 INFO L168 Benchmark]: Witness Printer took 125.04 ms. Allocated memory is still 1.2 GB. Free memory was 976.4 MB in the beginning and 968.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:39:10,568 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.80 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 468.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -137.1 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.48 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.84 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 589.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5425.32 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 83.4 MB). Free memory was 1.1 GB in the beginning and 976.4 MB in the end (delta: 83.2 MB). Peak memory consumption was 166.6 MB. Max. memory is 11.5 GB. * Witness Printer took 125.04 ms. Allocated memory is still 1.2 GB. Free memory was 976.4 MB in the beginning and 968.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 7.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: 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: 137]: Loop Invariant Derived loop invariant: (((0 == __retres10 && 0 == \result) && 0 == zero) || (1 <= tmp && 1 <= sb)) || sb + 1 <= 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (0 == m && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 210]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 246]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 147]: Loop Invariant Derived loop invariant: ((1 <= tmp && 1 <= sb) || sb + 1 <= 0) || (0 == __retres10 && 0 == zero) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 0 == zero - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 == zero - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 71 locations, 1 error locations. Result: SAFE, OverallTime: 5.2s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 1042 SDtfs, 434 SDslu, 2213 SDs, 0 SdLazy, 814 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 303 GetRequests, 214 SyntacticMatches, 4 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 110 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 24 LocationsWithAnnotation, 24 PreInvPairs, 60 NumberOfFragments, 114 HoareAnnotationTreeSize, 24 FomulaSimplifications, 953 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 24 FomulaSimplificationsInter, 26 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 644 NumberOfCodeBlocks, 644 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 625 ConstructedInterpolants, 0 QuantifiedInterpolants, 43726 SizeOfPredicates, 33 NumberOfNonLiveVariables, 786 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 18/37 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...