./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 30f4e4ab 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.24-30f4e4a [2019-11-27 22:34:38,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 22:34:38,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 22:34:38,855 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 22:34:38,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 22:34:38,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 22:34:38,858 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 22:34:38,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 22:34:38,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 22:34:38,864 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 22:34:38,865 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 22:34:38,866 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 22:34:38,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 22:34:38,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 22:34:38,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 22:34:38,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 22:34:38,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 22:34:38,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 22:34:38,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 22:34:38,879 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 22:34:38,881 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 22:34:38,882 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 22:34:38,883 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 22:34:38,884 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 22:34:38,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 22:34:38,887 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 22:34:38,887 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 22:34:38,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 22:34:38,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 22:34:38,890 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 22:34:38,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 22:34:38,891 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 22:34:38,892 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 22:34:38,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 22:34:38,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 22:34:38,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 22:34:38,895 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 22:34:38,896 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 22:34:38,896 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 22:34:38,897 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 22:34:38,898 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 22:34:38,899 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 22:34:38,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 22:34:38,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 22:34:38,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 22:34:38,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 22:34:38,916 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 22:34:38,916 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 22:34:38,916 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 22:34:38,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 22:34:38,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 22:34:38,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 22:34:38,918 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 22:34:38,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 22:34:38,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 22:34:38,918 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 22:34:38,919 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 22:34:38,919 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 22:34:38,919 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 22:34:38,920 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 22:34:38,920 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 22:34:38,920 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 22:34:38,920 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 22:34:38,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 22:34:38,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 22:34:38,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 22:34:38,922 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 22:34:38,922 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 22:34:38,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 22:34:38,922 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 22:34:38,923 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-27 22:34:39,211 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 22:34:39,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 22:34:39,229 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 22:34:39,231 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 22:34:39,231 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 22:34:39,232 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-27 22:34:39,289 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adf5f375/3bfe3dea3f9340e0936d194f123fd7b3/FLAGea41eb94f [2019-11-27 22:34:39,734 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 22:34:39,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_5a.c.cil.c [2019-11-27 22:34:39,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adf5f375/3bfe3dea3f9340e0936d194f123fd7b3/FLAGea41eb94f [2019-11-27 22:34:40,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1adf5f375/3bfe3dea3f9340e0936d194f123fd7b3 [2019-11-27 22:34:40,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 22:34:40,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 22:34:40,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:40,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 22:34:40,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 22:34:40,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cff6e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40, skipping insertion in model container [2019-11-27 22:34:40,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 22:34:40,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 22:34:40,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:40,405 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 22:34:40,512 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 22:34:40,531 INFO L208 MainTranslator]: Completed translation [2019-11-27 22:34:40,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40 WrapperNode [2019-11-27 22:34:40,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 22:34:40,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:40,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 22:34:40,536 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 22:34:40,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,553 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 22:34:40,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 22:34:40,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 22:34:40,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 22:34:40,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (1/1) ... [2019-11-27 22:34:40,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 22:34:40,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 22:34:40,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 22:34:40,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 22:34:40,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (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-27 22:34:40,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 22:34:40,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 22:34:41,191 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 22:34:41,191 INFO L297 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-27 22:34:41,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:41 BoogieIcfgContainer [2019-11-27 22:34:41,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 22:34:41,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 22:34:41,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 22:34:41,197 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 22:34:41,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 10:34:40" (1/3) ... [2019-11-27 22:34:41,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435e52c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:41, skipping insertion in model container [2019-11-27 22:34:41,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 10:34:40" (2/3) ... [2019-11-27 22:34:41,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435e52c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 10:34:41, skipping insertion in model container [2019-11-27 22:34:41,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:41" (3/3) ... [2019-11-27 22:34:41,200 INFO L109 eAbstractionObserver]: Analyzing ICFG soft_float_5a.c.cil.c [2019-11-27 22:34:41,210 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 22:34:41,221 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 22:34:41,233 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 22:34:41,261 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 22:34:41,261 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 22:34:41,261 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 22:34:41,261 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 22:34:41,262 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 22:34:41,262 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 22:34:41,262 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 22:34:41,262 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 22:34:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2019-11-27 22:34:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 22:34:41,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:41,286 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-27 22:34:41,286 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:41,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash -991589482, now seen corresponding path program 1 times [2019-11-27 22:34:41,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:41,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134445647] [2019-11-27 22:34:41,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:41,513 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-27 22:34:41,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134445647] [2019-11-27 22:34:41,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:41,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:41,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695631589] [2019-11-27 22:34:41,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:41,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:41,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:41,546 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 3 states. [2019-11-27 22:34:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:41,619 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2019-11-27 22:34:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:41,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 22:34:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:41,637 INFO L225 Difference]: With dead ends: 149 [2019-11-27 22:34:41,638 INFO L226 Difference]: Without dead ends: 67 [2019-11-27 22:34:41,643 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-27 22:34:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-27 22:34:41,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-27 22:34:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-27 22:34:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 100 transitions. [2019-11-27 22:34:41,680 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 100 transitions. Word has length 24 [2019-11-27 22:34:41,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:41,681 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 100 transitions. [2019-11-27 22:34:41,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 100 transitions. [2019-11-27 22:34:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:34:41,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:41,683 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-27 22:34:41,683 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:41,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1791855548, now seen corresponding path program 1 times [2019-11-27 22:34:41,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:41,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303712111] [2019-11-27 22:34:41,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:41,762 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-27 22:34:41,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303712111] [2019-11-27 22:34:41,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:41,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:34:41,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748387106] [2019-11-27 22:34:41,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:41,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:41,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:41,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:41,769 INFO L87 Difference]: Start difference. First operand 67 states and 100 transitions. Second operand 4 states. [2019-11-27 22:34:41,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:41,805 INFO L93 Difference]: Finished difference Result 87 states and 128 transitions. [2019-11-27 22:34:41,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:41,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-27 22:34:41,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:41,807 INFO L225 Difference]: With dead ends: 87 [2019-11-27 22:34:41,808 INFO L226 Difference]: Without dead ends: 67 [2019-11-27 22:34:41,809 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-27 22:34:41,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-27 22:34:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-27 22:34:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-27 22:34:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 99 transitions. [2019-11-27 22:34:41,819 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 99 transitions. Word has length 26 [2019-11-27 22:34:41,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:41,820 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 99 transitions. [2019-11-27 22:34:41,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 99 transitions. [2019-11-27 22:34:41,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 22:34:41,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:41,822 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-27 22:34:41,822 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:41,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:41,823 INFO L82 PathProgramCache]: Analyzing trace with hash 2050020986, now seen corresponding path program 1 times [2019-11-27 22:34:41,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:41,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345257417] [2019-11-27 22:34:41,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:41,923 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-27 22:34:41,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345257417] [2019-11-27 22:34:41,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:41,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:41,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981421317] [2019-11-27 22:34:41,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:41,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:41,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:41,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:41,926 INFO L87 Difference]: Start difference. First operand 67 states and 99 transitions. Second operand 3 states. [2019-11-27 22:34:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:42,052 INFO L93 Difference]: Finished difference Result 121 states and 176 transitions. [2019-11-27 22:34:42,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:42,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-27 22:34:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:42,056 INFO L225 Difference]: With dead ends: 121 [2019-11-27 22:34:42,056 INFO L226 Difference]: Without dead ends: 75 [2019-11-27 22:34:42,057 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-27 22:34:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-27 22:34:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2019-11-27 22:34:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-27 22:34:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 98 transitions. [2019-11-27 22:34:42,066 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 98 transitions. Word has length 26 [2019-11-27 22:34:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:42,066 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 98 transitions. [2019-11-27 22:34:42,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 98 transitions. [2019-11-27 22:34:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 22:34:42,068 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:42,069 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-27 22:34:42,069 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:42,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1329816874, now seen corresponding path program 1 times [2019-11-27 22:34:42,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:42,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772412184] [2019-11-27 22:34:42,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:42,126 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-27 22:34:42,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772412184] [2019-11-27 22:34:42,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:42,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:34:42,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379145242] [2019-11-27 22:34:42,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:42,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:42,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:42,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:42,131 INFO L87 Difference]: Start difference. First operand 67 states and 98 transitions. Second operand 4 states. [2019-11-27 22:34:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:42,244 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2019-11-27 22:34:42,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:42,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-27 22:34:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:42,247 INFO L225 Difference]: With dead ends: 155 [2019-11-27 22:34:42,247 INFO L226 Difference]: Without dead ends: 90 [2019-11-27 22:34:42,248 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-27 22:34:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-11-27 22:34:42,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 61. [2019-11-27 22:34:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-27 22:34:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 86 transitions. [2019-11-27 22:34:42,257 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 86 transitions. Word has length 29 [2019-11-27 22:34:42,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:42,258 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 86 transitions. [2019-11-27 22:34:42,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:42,258 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 86 transitions. [2019-11-27 22:34:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 22:34:42,259 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:42,260 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-27 22:34:42,260 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:42,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1760271131, now seen corresponding path program 1 times [2019-11-27 22:34:42,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:42,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857858893] [2019-11-27 22:34:42,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:42,370 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-27 22:34:42,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857858893] [2019-11-27 22:34:42,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:42,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 22:34:42,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737609138] [2019-11-27 22:34:42,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 22:34:42,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 22:34:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 22:34:42,374 INFO L87 Difference]: Start difference. First operand 61 states and 86 transitions. Second operand 3 states. [2019-11-27 22:34:42,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:42,436 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2019-11-27 22:34:42,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 22:34:42,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-27 22:34:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:42,439 INFO L225 Difference]: With dead ends: 108 [2019-11-27 22:34:42,439 INFO L226 Difference]: Without dead ends: 58 [2019-11-27 22:34:42,439 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-27 22:34:42,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-27 22:34:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-27 22:34:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-27 22:34:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2019-11-27 22:34:42,454 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 30 [2019-11-27 22:34:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:42,454 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2019-11-27 22:34:42,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 22:34:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2019-11-27 22:34:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-27 22:34:42,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:42,460 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-27 22:34:42,460 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash -171839511, now seen corresponding path program 1 times [2019-11-27 22:34:42,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:42,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79700724] [2019-11-27 22:34:42,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:42,564 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-27 22:34:42,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79700724] [2019-11-27 22:34:42,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:42,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 22:34:42,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819285752] [2019-11-27 22:34:42,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 22:34:42,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:42,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 22:34:42,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-27 22:34:42,567 INFO L87 Difference]: Start difference. First operand 58 states and 80 transitions. Second operand 4 states. [2019-11-27 22:34:42,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:42,674 INFO L93 Difference]: Finished difference Result 110 states and 154 transitions. [2019-11-27 22:34:42,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 22:34:42,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-27 22:34:42,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:42,676 INFO L225 Difference]: With dead ends: 110 [2019-11-27 22:34:42,676 INFO L226 Difference]: Without dead ends: 63 [2019-11-27 22:34:42,677 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-27 22:34:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-27 22:34:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2019-11-27 22:34:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-27 22:34:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2019-11-27 22:34:42,684 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 31 [2019-11-27 22:34:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:42,685 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2019-11-27 22:34:42,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 22:34:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2019-11-27 22:34:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 22:34:42,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:42,687 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-27 22:34:42,687 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:42,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2115361752, now seen corresponding path program 1 times [2019-11-27 22:34:42,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:42,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563973254] [2019-11-27 22:34:42,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:42,751 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-27 22:34:42,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563973254] [2019-11-27 22:34:42,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642467650] [2019-11-27 22:34:42,753 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-27 22:34:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:42,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-27 22:34:42,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:42,848 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-27 22:34:42,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 22:34:42,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-27 22:34:42,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74278509] [2019-11-27 22:34:42,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 22:34:42,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:42,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 22:34:42,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-27 22:34:42,851 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand 5 states. [2019-11-27 22:34:42,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:42,952 INFO L93 Difference]: Finished difference Result 133 states and 184 transitions. [2019-11-27 22:34:42,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 22:34:42,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-11-27 22:34:42,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:42,954 INFO L225 Difference]: With dead ends: 133 [2019-11-27 22:34:42,954 INFO L226 Difference]: Without dead ends: 87 [2019-11-27 22:34:42,955 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-27 22:34:42,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-27 22:34:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 61. [2019-11-27 22:34:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-27 22:34:42,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 83 transitions. [2019-11-27 22:34:42,962 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 83 transitions. Word has length 32 [2019-11-27 22:34:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:42,963 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 83 transitions. [2019-11-27 22:34:42,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 22:34:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 83 transitions. [2019-11-27 22:34:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 22:34:42,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:42,969 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-27 22:34:43,176 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:43,177 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:43,178 INFO L82 PathProgramCache]: Analyzing trace with hash 431286119, now seen corresponding path program 1 times [2019-11-27 22:34:43,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:43,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481746780] [2019-11-27 22:34:43,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:43,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:43,309 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-27 22:34:43,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481746780] [2019-11-27 22:34:43,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269277680] [2019-11-27 22:34:43,310 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-27 22:34:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:43,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 22:34:43,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:43,431 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-27 22:34:43,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:34:43,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2019-11-27 22:34:43,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024695104] [2019-11-27 22:34:43,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:43,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:43,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:43,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:34:43,437 INFO L87 Difference]: Start difference. First operand 61 states and 83 transitions. Second operand 6 states. [2019-11-27 22:34:43,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:43,609 INFO L93 Difference]: Finished difference Result 93 states and 122 transitions. [2019-11-27 22:34:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 22:34:43,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-11-27 22:34:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:43,610 INFO L225 Difference]: With dead ends: 93 [2019-11-27 22:34:43,611 INFO L226 Difference]: Without dead ends: 89 [2019-11-27 22:34:43,612 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-27 22:34:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-27 22:34:43,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2019-11-27 22:34:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-27 22:34:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2019-11-27 22:34:43,626 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 34 [2019-11-27 22:34:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:43,626 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2019-11-27 22:34:43,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2019-11-27 22:34:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:34:43,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:43,632 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-27 22:34:43,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:43,844 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:43,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2094293407, now seen corresponding path program 1 times [2019-11-27 22:34:43,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:43,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151216944] [2019-11-27 22:34:43,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:43,958 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-27 22:34:43,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151216944] [2019-11-27 22:34:43,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078249194] [2019-11-27 22:34:43,959 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-27 22:34:44,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:44,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 22:34:44,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:44,071 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-27 22:34:44,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:34:44,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-11-27 22:34:44,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477017440] [2019-11-27 22:34:44,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:44,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:44,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:44,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-27 22:34:44,074 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2019-11-27 22:34:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:44,175 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2019-11-27 22:34:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:34:44,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-27 22:34:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:44,177 INFO L225 Difference]: With dead ends: 76 [2019-11-27 22:34:44,177 INFO L226 Difference]: Without dead ends: 71 [2019-11-27 22:34:44,177 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-27 22:34:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-27 22:34:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 66. [2019-11-27 22:34:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-27 22:34:44,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2019-11-27 22:34:44,191 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 36 [2019-11-27 22:34:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:44,192 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2019-11-27 22:34:44,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:44,193 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2019-11-27 22:34:44,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 22:34:44,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:44,194 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-27 22:34:44,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:44,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:44,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -2092446365, now seen corresponding path program 1 times [2019-11-27 22:34:44,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:44,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617870912] [2019-11-27 22:34:44,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:44,455 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-27 22:34:44,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617870912] [2019-11-27 22:34:44,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 22:34:44,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 22:34:44,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067896464] [2019-11-27 22:34:44,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 22:34:44,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:44,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 22:34:44,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 22:34:44,458 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand 6 states. [2019-11-27 22:34:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:44,544 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2019-11-27 22:34:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 22:34:44,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-11-27 22:34:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:44,547 INFO L225 Difference]: With dead ends: 71 [2019-11-27 22:34:44,547 INFO L226 Difference]: Without dead ends: 61 [2019-11-27 22:34:44,548 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-27 22:34:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-27 22:34:44,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-11-27 22:34:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-27 22:34:44,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-11-27 22:34:44,555 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 36 [2019-11-27 22:34:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:44,555 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-11-27 22:34:44,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 22:34:44,556 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-11-27 22:34:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-27 22:34:44,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:44,557 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-27 22:34:44,557 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -828854686, now seen corresponding path program 1 times [2019-11-27 22:34:44,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:44,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982535529] [2019-11-27 22:34:44,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:44,679 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-27 22:34:44,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982535529] [2019-11-27 22:34:44,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465258673] [2019-11-27 22:34:44,680 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-27 22:34:44,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:44,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-27 22:34:44,736 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:44,785 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-27 22:34:44,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:34:44,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2019-11-27 22:34:44,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249685119] [2019-11-27 22:34:44,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 22:34:44,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:44,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 22:34:44,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-27 22:34:44,788 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-11-27 22:34:45,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:45,003 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2019-11-27 22:34:45,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 22:34:45,004 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-11-27 22:34:45,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:45,005 INFO L225 Difference]: With dead ends: 90 [2019-11-27 22:34:45,005 INFO L226 Difference]: Without dead ends: 65 [2019-11-27 22:34:45,005 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-27 22:34:45,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-27 22:34:45,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2019-11-27 22:34:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-27 22:34:45,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2019-11-27 22:34:45,015 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 37 [2019-11-27 22:34:45,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:45,016 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2019-11-27 22:34:45,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 22:34:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2019-11-27 22:34:45,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:34:45,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:45,016 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-27 22:34:45,217 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:45,218 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:45,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:45,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1188671725, now seen corresponding path program 1 times [2019-11-27 22:34:45,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:45,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258069812] [2019-11-27 22:34:45,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:45,287 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-27 22:34:45,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258069812] [2019-11-27 22:34:45,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300104753] [2019-11-27 22:34:45,288 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-27 22:34:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:45,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-27 22:34:45,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:45,461 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-27 22:34:45,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:34:45,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 12 [2019-11-27 22:34:45,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832758600] [2019-11-27 22:34:45,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 22:34:45,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:45,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 22:34:45,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-27 22:34:45,463 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 9 states. [2019-11-27 22:34:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:45,660 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2019-11-27 22:34:45,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 22:34:45,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-11-27 22:34:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:45,661 INFO L225 Difference]: With dead ends: 91 [2019-11-27 22:34:45,662 INFO L226 Difference]: Without dead ends: 67 [2019-11-27 22:34:45,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2019-11-27 22:34:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-27 22:34:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-27 22:34:45,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-27 22:34:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2019-11-27 22:34:45,668 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 41 [2019-11-27 22:34:45,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:45,668 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2019-11-27 22:34:45,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 22:34:45,668 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2019-11-27 22:34:45,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-27 22:34:45,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 22:34:45,669 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-27 22:34:45,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:45,874 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 22:34:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 22:34:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1516783191, now seen corresponding path program 1 times [2019-11-27 22:34:45,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 22:34:45,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262209823] [2019-11-27 22:34:45,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 22:34:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:45,937 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-27 22:34:45,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262209823] [2019-11-27 22:34:45,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788514718] [2019-11-27 22:34:45,938 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-27 22:34:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 22:34:45,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-27 22:34:45,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 22:34:46,069 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-27 22:34:46,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 22:34:46,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2019-11-27 22:34:46,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803889384] [2019-11-27 22:34:46,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 22:34:46,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 22:34:46,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 22:34:46,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-27 22:34:46,071 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand 8 states. [2019-11-27 22:34:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 22:34:46,240 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2019-11-27 22:34:46,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 22:34:46,240 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-11-27 22:34:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 22:34:46,241 INFO L225 Difference]: With dead ends: 66 [2019-11-27 22:34:46,241 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 22:34:46,242 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-27 22:34:46,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 22:34:46,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 22:34:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 22:34:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 22:34:46,243 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2019-11-27 22:34:46,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 22:34:46,244 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 22:34:46,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 22:34:46,244 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 22:34:46,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 22:34:46,445 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 22:34:46,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 22:34:46,571 INFO L246 CegarLoopResult]: For program point L250(lines 250 254) no Hoare annotation was computed. [2019-11-27 22:34:46,571 INFO L246 CegarLoopResult]: For program point L184(lines 184 201) no Hoare annotation was computed. [2019-11-27 22:34:46,571 INFO L246 CegarLoopResult]: For program point L250-2(lines 250 254) no Hoare annotation was computed. [2019-11-27 22:34:46,571 INFO L246 CegarLoopResult]: For program point L184-2(lines 184 201) no Hoare annotation was computed. [2019-11-27 22:34:46,571 INFO L246 CegarLoopResult]: For program point L19(lines 19 24) no Hoare annotation was computed. [2019-11-27 22:34:46,572 INFO L246 CegarLoopResult]: For program point L19-1(lines 19 24) no Hoare annotation was computed. [2019-11-27 22:34:46,572 INFO L246 CegarLoopResult]: For program point L19-2(lines 19 24) no Hoare annotation was computed. [2019-11-27 22:34:46,572 INFO L246 CegarLoopResult]: For program point L19-3(lines 19 24) no Hoare annotation was computed. [2019-11-27 22:34:46,572 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-27 22:34:46,572 INFO L242 CegarLoopResult]: At program point L69-1(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,572 INFO L242 CegarLoopResult]: At program point L69-2(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,572 INFO L242 CegarLoopResult]: At program point L69-3(lines 18 71) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,573 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 22:34:46,573 INFO L246 CegarLoopResult]: For program point L185(lines 185 190) no Hoare annotation was computed. [2019-11-27 22:34:46,573 INFO L246 CegarLoopResult]: For program point L169(lines 169 174) no Hoare annotation was computed. [2019-11-27 22:34:46,573 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-27 22:34:46,573 INFO L246 CegarLoopResult]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-27 22:34:46,573 INFO L242 CegarLoopResult]: At program point L70-1(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,573 INFO L242 CegarLoopResult]: At program point L37-1(lines 27 42) the Hoare annotation is: false [2019-11-27 22:34:46,574 INFO L242 CegarLoopResult]: At program point L70-2(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,577 INFO L246 CegarLoopResult]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-11-27 22:34:46,577 INFO L242 CegarLoopResult]: At program point L70-3(lines 14 72) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,577 INFO L242 CegarLoopResult]: At program point L37-3(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,577 INFO L246 CegarLoopResult]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-11-27 22:34:46,577 INFO L242 CegarLoopResult]: At program point L37-5(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,578 INFO L246 CegarLoopResult]: For program point L37-6(lines 37 41) no Hoare annotation was computed. [2019-11-27 22:34:46,578 INFO L242 CegarLoopResult]: At program point L37-7(lines 27 42) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,578 INFO L246 CegarLoopResult]: For program point L236(lines 236 240) no Hoare annotation was computed. [2019-11-27 22:34:46,578 INFO L246 CegarLoopResult]: For program point L236-2(lines 236 240) no Hoare annotation was computed. [2019-11-27 22:34:46,578 INFO L246 CegarLoopResult]: For program point L6(lines 6 8) no Hoare annotation was computed. [2019-11-27 22:34:46,578 INFO L246 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2019-11-27 22:34:46,579 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-27 22:34:46,579 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 22:34:46,579 INFO L246 CegarLoopResult]: For program point L25(lines 25 65) no Hoare annotation was computed. [2019-11-27 22:34:46,579 INFO L246 CegarLoopResult]: For program point L25-1(lines 25 65) no Hoare annotation was computed. [2019-11-27 22:34:46,579 INFO L246 CegarLoopResult]: For program point L25-2(lines 25 65) no Hoare annotation was computed. [2019-11-27 22:34:46,579 INFO L246 CegarLoopResult]: For program point L25-3(lines 25 65) no Hoare annotation was computed. [2019-11-27 22:34:46,579 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-27 22:34:46,580 INFO L246 CegarLoopResult]: For program point L175(lines 175 180) no Hoare annotation was computed. [2019-11-27 22:34:46,580 INFO L246 CegarLoopResult]: For program point L193(lines 193 198) no Hoare annotation was computed. [2019-11-27 22:34:46,580 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 22:34:46,580 INFO L246 CegarLoopResult]: For program point L28(lines 27 42) no Hoare annotation was computed. [2019-11-27 22:34:46,580 INFO L246 CegarLoopResult]: For program point L28-1(lines 27 42) no Hoare annotation was computed. [2019-11-27 22:34:46,580 INFO L246 CegarLoopResult]: For program point L28-2(lines 27 42) no Hoare annotation was computed. [2019-11-27 22:34:46,580 INFO L246 CegarLoopResult]: For program point L28-3(lines 27 42) no Hoare annotation was computed. [2019-11-27 22:34:46,580 INFO L242 CegarLoopResult]: At program point L63(lines 25 65) the Hoare annotation is: false [2019-11-27 22:34:46,581 INFO L242 CegarLoopResult]: At program point L63-1(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,581 INFO L242 CegarLoopResult]: At program point L63-2(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,581 INFO L242 CegarLoopResult]: At program point L63-3(lines 25 65) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,581 INFO L242 CegarLoopResult]: At program point L47-2(lines 47 62) the Hoare annotation is: false [2019-11-27 22:34:46,581 INFO L242 CegarLoopResult]: At program point L47-5(lines 47 62) the Hoare annotation is: false [2019-11-27 22:34:46,581 INFO L242 CegarLoopResult]: At program point L47-8(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,581 INFO L242 CegarLoopResult]: At program point L47-11(lines 47 62) the Hoare annotation is: (= 0 ULTIMATE.start_main_~zero~0) [2019-11-27 22:34:46,582 INFO L246 CegarLoopResult]: For program point L246(lines 246 262) no Hoare annotation was computed. [2019-11-27 22:34:46,582 INFO L249 CegarLoopResult]: At program point L246-1(lines 246 262) the Hoare annotation is: true [2019-11-27 22:34:46,582 INFO L246 CegarLoopResult]: For program point L48(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,582 INFO L246 CegarLoopResult]: For program point L48-1(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,582 INFO L246 CegarLoopResult]: For program point L48-2(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,582 INFO L246 CegarLoopResult]: For program point L48-3(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,582 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2019-11-27 22:34:46,583 INFO L246 CegarLoopResult]: For program point L247(lines 247 256) no Hoare annotation was computed. [2019-11-27 22:34:46,583 INFO L246 CegarLoopResult]: For program point L247-2(lines 247 256) no Hoare annotation was computed. [2019-11-27 22:34:46,583 INFO L246 CegarLoopResult]: For program point L148(lines 148 154) no Hoare annotation was computed. [2019-11-27 22:34:46,583 INFO L246 CegarLoopResult]: For program point L148-2(lines 147 208) no Hoare annotation was computed. [2019-11-27 22:34:46,583 INFO L246 CegarLoopResult]: For program point L49(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,583 INFO L246 CegarLoopResult]: For program point L49-1(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,584 INFO L246 CegarLoopResult]: For program point L49-2(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,584 INFO L246 CegarLoopResult]: For program point L49-3(lines 47 62) no Hoare annotation was computed. [2019-11-27 22:34:46,584 INFO L249 CegarLoopResult]: At program point L264(lines 210 266) the Hoare annotation is: true [2019-11-27 22:34:46,584 INFO L246 CegarLoopResult]: For program point L233(lines 233 242) no Hoare annotation was computed. [2019-11-27 22:34:46,585 INFO L246 CegarLoopResult]: For program point L233-2(lines 233 242) no Hoare annotation was computed. [2019-11-27 22:34:46,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 10:34:46 BoogieIcfgContainer [2019-11-27 22:34:46,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 22:34:46,610 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 22:34:46,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 22:34:46,611 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 22:34:46,612 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 10:34:41" (3/4) ... [2019-11-27 22:34:46,616 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 22:34:46,632 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-27 22:34:46,633 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-27 22:34:46,665 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((0 == \result && 0 == m) && 0 <= e) && __retres4 == 0 [2019-11-27 22:34:46,669 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-27 22:34:46,731 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 22:34:46,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 22:34:46,737 INFO L168 Benchmark]: Toolchain (without parser) took 6630.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 214.4 MB). Free memory was 952.3 MB in the beginning and 987.5 MB in the end (delta: -35.2 MB). Peak memory consumption was 179.2 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:46,738 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:46,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:46,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:46,739 INFO L168 Benchmark]: Boogie Preprocessor took 39.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 22:34:46,740 INFO L168 Benchmark]: RCFGBuilder took 546.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:46,740 INFO L168 Benchmark]: TraceAbstraction took 5416.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 994.9 MB in the end (delta: 108.7 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:46,741 INFO L168 Benchmark]: Witness Printer took 121.30 ms. Allocated memory is still 1.2 GB. Free memory was 994.9 MB in the beginning and 987.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-27 22:34:46,743 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 427.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 546.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5416.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.4 MB). Free memory was 1.1 GB in the beginning and 994.9 MB in the end (delta: 108.7 MB). Peak memory consumption was 171.1 MB. Max. memory is 11.5 GB. * Witness Printer took 121.30 ms. Allocated memory is still 1.2 GB. Free memory was 994.9 MB in the beginning and 987.5 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 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.1s, 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.2s 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...