./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/fibo_7-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 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/recursive-simple/fibo_7-1.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 f612eebc128d68e9b4bc81ed92184f640c3b9bd4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:23:11,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:23:11,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:23:11,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:23:11,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:23:11,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:23:11,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:23:11,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:23:11,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:23:11,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:23:11,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:23:11,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:23:11,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:23:11,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:23:11,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:23:11,333 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:23:11,333 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:23:11,335 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:23:11,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:23:11,339 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:23:11,341 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:23:11,342 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:23:11,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:23:11,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:23:11,347 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:23:11,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:23:11,348 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:23:11,349 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:23:11,350 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:23:11,351 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:23:11,351 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:23:11,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:23:11,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:23:11,359 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:23:11,360 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:23:11,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:23:11,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:23:11,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:23:11,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:23:11,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:23:11,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:23:11,367 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:23:11,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:23:11,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:23:11,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:23:11,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:23:11,385 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:23:11,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:23:11,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:23:11,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:23:11,386 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:23:11,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:23:11,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:23:11,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:23:11,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:23:11,387 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:23:11,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:23:11,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:23:11,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:23:11,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:23:11,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:23:11,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:23:11,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:23:11,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:23:11,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:23:11,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:23:11,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:23:11,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:23:11,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:23:11,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:23:11,390 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 -> f612eebc128d68e9b4bc81ed92184f640c3b9bd4 [2019-11-19 21:23:11,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:23:11,721 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:23:11,724 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:23:11,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:23:11,727 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:23:11,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-1.c [2019-11-19 21:23:11,807 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05ba1fab/9e9b2a9466f14dc2945dd3b4fff783ee/FLAG5007f521b [2019-11-19 21:23:12,254 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:23:12,256 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-1.c [2019-11-19 21:23:12,263 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05ba1fab/9e9b2a9466f14dc2945dd3b4fff783ee/FLAG5007f521b [2019-11-19 21:23:12,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a05ba1fab/9e9b2a9466f14dc2945dd3b4fff783ee [2019-11-19 21:23:12,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:23:12,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:23:12,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:23:12,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:23:12,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:23:12,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:12,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f78e138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12, skipping insertion in model container [2019-11-19 21:23:12,680 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:12,688 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:23:12,706 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:23:12,880 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:23:12,884 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:23:12,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:23:12,910 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:23:12,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12 WrapperNode [2019-11-19 21:23:12,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:23:12,912 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:23:12,912 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:23:12,912 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:23:12,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:12,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:12,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:23:12,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:23:12,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:23:12,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:23:13,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:13,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:13,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:13,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:13,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:13,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:13,024 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (1/1) ... [2019-11-19 21:23:13,025 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:23:13,026 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:23:13,026 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:23:13,026 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:23:13,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (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-19 21:23:13,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:23:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:23:13,081 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-11-19 21:23:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-11-19 21:23:13,249 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:23:13,249 INFO L285 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-19 21:23:13,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:23:13 BoogieIcfgContainer [2019-11-19 21:23:13,251 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:23:13,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:23:13,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:23:13,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:23:13,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:23:12" (1/3) ... [2019-11-19 21:23:13,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8c94fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:23:13, skipping insertion in model container [2019-11-19 21:23:13,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:23:12" (2/3) ... [2019-11-19 21:23:13,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8c94fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:23:13, skipping insertion in model container [2019-11-19 21:23:13,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:23:13" (3/3) ... [2019-11-19 21:23:13,259 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-1.c [2019-11-19 21:23:13,270 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:23:13,278 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:23:13,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:23:13,350 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:23:13,364 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:23:13,364 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:23:13,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:23:13,365 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:23:13,365 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:23:13,365 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:23:13,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:23:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-19 21:23:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-19 21:23:13,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:13,406 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:13,407 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:13,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-11-19 21:23:13,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:13,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525524267] [2019-11-19 21:23:13,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:13,619 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-19 21:23:13,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525524267] [2019-11-19 21:23:13,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:23:13,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:23:13,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303721685] [2019-11-19 21:23:13,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:23:13,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:13,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:23:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:23:13,647 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 5 states. [2019-11-19 21:23:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:13,789 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-11-19 21:23:13,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:23:13,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-19 21:23:13,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:13,808 INFO L225 Difference]: With dead ends: 29 [2019-11-19 21:23:13,809 INFO L226 Difference]: Without dead ends: 17 [2019-11-19 21:23:13,815 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:23:13,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-19 21:23:13,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-19 21:23:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 21:23:13,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-19 21:23:13,875 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-11-19 21:23:13,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:13,875 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-19 21:23:13,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:23:13,877 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-19 21:23:13,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-19 21:23:13,880 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:13,880 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:13,881 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:13,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:13,882 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-11-19 21:23:13,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:13,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258891071] [2019-11-19 21:23:13,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:13,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:13,947 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-19 21:23:13,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258891071] [2019-11-19 21:23:13,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:23:13,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:23:13,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839698296] [2019-11-19 21:23:13,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:23:13,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:13,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:23:13,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:23:13,951 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 5 states. [2019-11-19 21:23:14,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:14,003 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-11-19 21:23:14,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:23:14,004 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-11-19 21:23:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:14,005 INFO L225 Difference]: With dead ends: 23 [2019-11-19 21:23:14,006 INFO L226 Difference]: Without dead ends: 19 [2019-11-19 21:23:14,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:23:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-11-19 21:23:14,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-11-19 21:23:14,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-19 21:23:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-19 21:23:14,013 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-11-19 21:23:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:14,014 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-19 21:23:14,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:23:14,014 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-19 21:23:14,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:23:14,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:14,015 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:14,016 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-11-19 21:23:14,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:14,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871927354] [2019-11-19 21:23:14,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:23:14,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871927354] [2019-11-19 21:23:14,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890418106] [2019-11-19 21:23:14,185 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-19 21:23:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:23:14,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:23:14,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:14,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-19 21:23:14,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608324367] [2019-11-19 21:23:14,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:23:14,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:14,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:23:14,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:23:14,326 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-11-19 21:23:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:14,413 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-11-19 21:23:14,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:23:14,415 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-19 21:23:14,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:14,417 INFO L225 Difference]: With dead ends: 41 [2019-11-19 21:23:14,417 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 21:23:14,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:23:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 21:23:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-11-19 21:23:14,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-19 21:23:14,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-19 21:23:14,427 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2019-11-19 21:23:14,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:14,428 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-19 21:23:14,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:23:14,428 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-11-19 21:23:14,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 21:23:14,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:14,430 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:14,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:14,634 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-11-19 21:23:14,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:14,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361314192] [2019-11-19 21:23:14,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 21:23:14,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361314192] [2019-11-19 21:23:14,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707611245] [2019-11-19 21:23:14,787 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) [2019-11-19 21:23:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:14,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 21:23:14,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 21:23:14,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:14,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-19 21:23:14,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53695658] [2019-11-19 21:23:14,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:23:14,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:23:14,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:23:14,854 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 8 states. [2019-11-19 21:23:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:14,999 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-11-19 21:23:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:23:15,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2019-11-19 21:23:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:15,006 INFO L225 Difference]: With dead ends: 47 [2019-11-19 21:23:15,007 INFO L226 Difference]: Without dead ends: 43 [2019-11-19 21:23:15,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:23:15,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-19 21:23:15,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-19 21:23:15,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 21:23:15,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-11-19 21:23:15,037 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 23 [2019-11-19 21:23:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:15,037 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-11-19 21:23:15,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:23:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-11-19 21:23:15,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 21:23:15,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:15,043 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:15,246 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:15,248 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:15,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:15,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1840059703, now seen corresponding path program 2 times [2019-11-19 21:23:15,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:15,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964303722] [2019-11-19 21:23:15,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:15,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:15,397 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 21:23:15,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964303722] [2019-11-19 21:23:15,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729690833] [2019-11-19 21:23:15,398 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-19 21:23:15,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:23:15,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:15,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:23:15,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 21:23:15,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:15,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2019-11-19 21:23:15,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668512475] [2019-11-19 21:23:15,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:23:15,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:15,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:23:15,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:23:15,490 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 10 states. [2019-11-19 21:23:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:15,654 INFO L93 Difference]: Finished difference Result 67 states and 101 transitions. [2019-11-19 21:23:15,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:23:15,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-11-19 21:23:15,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:15,656 INFO L225 Difference]: With dead ends: 67 [2019-11-19 21:23:15,656 INFO L226 Difference]: Without dead ends: 29 [2019-11-19 21:23:15,658 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:23:15,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-19 21:23:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-11-19 21:23:15,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 21:23:15,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-11-19 21:23:15,665 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 35 [2019-11-19 21:23:15,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:15,665 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-11-19 21:23:15,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:23:15,666 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-11-19 21:23:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-19 21:23:15,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:15,667 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:15,879 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:15,881 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:15,881 INFO L82 PathProgramCache]: Analyzing trace with hash 624826665, now seen corresponding path program 2 times [2019-11-19 21:23:15,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:15,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270702652] [2019-11-19 21:23:15,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:15,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-19 21:23:16,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270702652] [2019-11-19 21:23:16,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118738089] [2019-11-19 21:23:16,106 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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-19 21:23:16,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:23:16,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:16,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:23:16,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:16,184 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-19 21:23:16,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:16,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-19 21:23:16,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734712712] [2019-11-19 21:23:16,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:23:16,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:16,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:23:16,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:23:16,187 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 10 states. [2019-11-19 21:23:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:16,324 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-11-19 21:23:16,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:23:16,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-11-19 21:23:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:16,328 INFO L225 Difference]: With dead ends: 52 [2019-11-19 21:23:16,328 INFO L226 Difference]: Without dead ends: 48 [2019-11-19 21:23:16,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:23:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-19 21:23:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-11-19 21:23:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-19 21:23:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2019-11-19 21:23:16,341 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 37 [2019-11-19 21:23:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:16,342 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-11-19 21:23:16,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:23:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2019-11-19 21:23:16,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 21:23:16,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:16,345 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:16,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:16,551 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:16,552 INFO L82 PathProgramCache]: Analyzing trace with hash -99212631, now seen corresponding path program 3 times [2019-11-19 21:23:16,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:16,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281665257] [2019-11-19 21:23:16,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:16,796 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 36 proven. 66 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-11-19 21:23:16,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281665257] [2019-11-19 21:23:16,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240779896] [2019-11-19 21:23:16,797 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-19 21:23:16,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-11-19 21:23:16,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:16,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 21:23:16,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 64 proven. 24 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-19 21:23:16,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:16,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 15 [2019-11-19 21:23:16,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854319214] [2019-11-19 21:23:16,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 21:23:16,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 21:23:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:23:16,931 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand 15 states. [2019-11-19 21:23:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:17,294 INFO L93 Difference]: Finished difference Result 89 states and 139 transitions. [2019-11-19 21:23:17,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 21:23:17,296 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2019-11-19 21:23:17,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:17,303 INFO L225 Difference]: With dead ends: 89 [2019-11-19 21:23:17,303 INFO L226 Difference]: Without dead ends: 49 [2019-11-19 21:23:17,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-11-19 21:23:17,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-19 21:23:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-11-19 21:23:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-19 21:23:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2019-11-19 21:23:17,328 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 63 [2019-11-19 21:23:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:17,329 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2019-11-19 21:23:17,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 21:23:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2019-11-19 21:23:17,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 21:23:17,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:17,338 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:17,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:17,540 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:17,540 INFO L82 PathProgramCache]: Analyzing trace with hash 548614988, now seen corresponding path program 4 times [2019-11-19 21:23:17,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:17,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274764040] [2019-11-19 21:23:17,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:17,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-19 21:23:17,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274764040] [2019-11-19 21:23:17,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990839234] [2019-11-19 21:23:17,842 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-19 21:23:17,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:23:17,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:17,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 21:23:17,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2019-11-19 21:23:17,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:17,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 14 [2019-11-19 21:23:17,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298851883] [2019-11-19 21:23:17,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 21:23:17,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:17,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 21:23:17,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:23:17,954 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand 14 states. [2019-11-19 21:23:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:18,131 INFO L93 Difference]: Finished difference Result 116 states and 175 transitions. [2019-11-19 21:23:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 21:23:18,132 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2019-11-19 21:23:18,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:18,134 INFO L225 Difference]: With dead ends: 116 [2019-11-19 21:23:18,135 INFO L226 Difference]: Without dead ends: 112 [2019-11-19 21:23:18,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:23:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-19 21:23:18,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 103. [2019-11-19 21:23:18,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-19 21:23:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 158 transitions. [2019-11-19 21:23:18,154 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 158 transitions. Word has length 105 [2019-11-19 21:23:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:18,155 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 158 transitions. [2019-11-19 21:23:18,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 21:23:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 158 transitions. [2019-11-19 21:23:18,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-19 21:23:18,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:18,160 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:18,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:18,371 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:18,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash -2009245247, now seen corresponding path program 5 times [2019-11-19 21:23:18,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:18,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136517484] [2019-11-19 21:23:18,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:18,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-11-19 21:23:18,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136517484] [2019-11-19 21:23:18,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309851692] [2019-11-19 21:23:18,889 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:18,996 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-11-19 21:23:18,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:18,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 21:23:19,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-11-19 21:23:19,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:19,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8] total 16 [2019-11-19 21:23:19,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864152062] [2019-11-19 21:23:19,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 21:23:19,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:19,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 21:23:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:23:19,116 INFO L87 Difference]: Start difference. First operand 103 states and 158 transitions. Second operand 16 states. [2019-11-19 21:23:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:19,409 INFO L93 Difference]: Finished difference Result 240 states and 405 transitions. [2019-11-19 21:23:19,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:23:19,410 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-11-19 21:23:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:19,414 INFO L225 Difference]: With dead ends: 240 [2019-11-19 21:23:19,415 INFO L226 Difference]: Without dead ends: 236 [2019-11-19 21:23:19,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:23:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-11-19 21:23:19,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 224. [2019-11-19 21:23:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-19 21:23:19,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 384 transitions. [2019-11-19 21:23:19,453 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 384 transitions. Word has length 173 [2019-11-19 21:23:19,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:19,454 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 384 transitions. [2019-11-19 21:23:19,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 21:23:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 384 transitions. [2019-11-19 21:23:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-19 21:23:19,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:19,460 INFO L410 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:19,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:19,665 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:19,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:19,666 INFO L82 PathProgramCache]: Analyzing trace with hash 960836894, now seen corresponding path program 6 times [2019-11-19 21:23:19,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:19,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919291266] [2019-11-19 21:23:19,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:21,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2019-11-19 21:23:21,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919291266] [2019-11-19 21:23:21,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16988265] [2019-11-19 21:23:21,150 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:21,304 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-11-19 21:23:21,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:23:21,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 167 conjunts are in the unsatisfiable core [2019-11-19 21:23:21,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:22,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 0 proven. 1500 refuted. 0 times theorem prover too weak. 3068 trivial. 0 not checked. [2019-11-19 21:23:22,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:22,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 28 [2019-11-19 21:23:22,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703812051] [2019-11-19 21:23:22,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 21:23:22,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 21:23:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=691, Unknown=0, NotChecked=0, Total=756 [2019-11-19 21:23:22,167 INFO L87 Difference]: Start difference. First operand 224 states and 384 transitions. Second operand 28 states. [2019-11-19 21:23:22,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:22,753 INFO L93 Difference]: Finished difference Result 595 states and 1265 transitions. [2019-11-19 21:23:22,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 21:23:22,753 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 282 [2019-11-19 21:23:22,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:22,764 INFO L225 Difference]: With dead ends: 595 [2019-11-19 21:23:22,764 INFO L226 Difference]: Without dead ends: 591 [2019-11-19 21:23:22,766 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 400 SyntacticMatches, 22 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=797, Unknown=0, NotChecked=0, Total=870 [2019-11-19 21:23:22,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-11-19 21:23:22,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 244. [2019-11-19 21:23:22,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-11-19 21:23:22,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 437 transitions. [2019-11-19 21:23:22,822 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 437 transitions. Word has length 282 [2019-11-19 21:23:22,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:22,823 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 437 transitions. [2019-11-19 21:23:22,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 21:23:22,823 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 437 transitions. [2019-11-19 21:23:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-11-19 21:23:22,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:23:22,830 INFO L410 BasicCegarLoop]: trace histogram [51, 51, 42, 25, 25, 25, 25, 25, 25, 25, 17, 9, 1, 1, 1, 1, 1, 1] [2019-11-19 21:23:23,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:23,034 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:23:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:23:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash -300076824, now seen corresponding path program 7 times [2019-11-19 21:23:23,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:23:23,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038557619] [2019-11-19 21:23:23,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:23:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 1781 proven. 1378 refuted. 0 times theorem prover too weak. 4002 trivial. 0 not checked. [2019-11-19 21:23:24,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038557619] [2019-11-19 21:23:24,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304809756] [2019-11-19 21:23:24,153 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:23:24,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 21:23:24,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:23:24,400 INFO L134 CoverageAnalysis]: Checked inductivity of 7161 backedges. 348 proven. 1442 refuted. 0 times theorem prover too weak. 5371 trivial. 0 not checked. [2019-11-19 21:23:24,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:23:24,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 12] total 28 [2019-11-19 21:23:24,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595294462] [2019-11-19 21:23:24,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-19 21:23:24,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:23:24,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-19 21:23:24,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2019-11-19 21:23:24,404 INFO L87 Difference]: Start difference. First operand 244 states and 437 transitions. Second operand 28 states. [2019-11-19 21:23:25,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:23:25,047 INFO L93 Difference]: Finished difference Result 819 states and 2077 transitions. [2019-11-19 21:23:25,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-19 21:23:25,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 351 [2019-11-19 21:23:25,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:23:25,049 INFO L225 Difference]: With dead ends: 819 [2019-11-19 21:23:25,049 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:23:25,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 458 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=285, Invalid=975, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 21:23:25,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:23:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:23:25,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:23:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:23:25,060 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 351 [2019-11-19 21:23:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:23:25,060 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:23:25,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-19 21:23:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:23:25,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:23:25,268 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:23:25,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:23:26,733 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 47 [2019-11-19 21:23:26,873 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2019-11-19 21:23:26,880 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:23:26,881 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:23:26,881 INFO L440 ceAbstractionStarter]: At program point L29(lines 23 30) the Hoare annotation is: (<= 7 ULTIMATE.start_main_~x~0) [2019-11-19 21:23:26,881 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:23:26,881 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-19 21:23:26,881 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2019-11-19 21:23:26,882 INFO L440 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (and (<= 7 ULTIMATE.start_main_~x~0) (<= ULTIMATE.start_main_~x~0 7)) [2019-11-19 21:23:26,882 INFO L444 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2019-11-19 21:23:26,882 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 27) no Hoare annotation was computed. [2019-11-19 21:23:26,882 INFO L444 ceAbstractionStarter]: For program point L26-2(lines 26 28) no Hoare annotation was computed. [2019-11-19 21:23:26,882 INFO L444 ceAbstractionStarter]: For program point fiboEXIT(lines 5 13) no Hoare annotation was computed. [2019-11-19 21:23:26,883 INFO L444 ceAbstractionStarter]: For program point fiboFINAL(lines 5 13) no Hoare annotation was computed. [2019-11-19 21:23:26,883 INFO L440 ceAbstractionStarter]: At program point L11(line 11) the Hoare annotation is: (and (= fibo_~n |fibo_#in~n|) (not (<= |fibo_#in~n| 1))) [2019-11-19 21:23:26,883 INFO L444 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-11-19 21:23:26,883 INFO L440 ceAbstractionStarter]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse0 (= fibo_~n |fibo_#in~n|)) (.cse3 (<= |fibo_#t~ret0| 1)) (.cse4 (<= 1 |fibo_#t~ret0|)) (.cse1 (<= 3 fibo_~n))) (let ((.cse2 (and .cse0 (<= fibo_~n 3) .cse3 .cse4 .cse1))) (and (or (and (<= fibo_~n 4) .cse0 (<= 2 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 2) .cse1) .cse2 (and (<= 8 |fibo_#in~n|) .cse0) (and .cse0 (<= 3 |fibo_#t~ret0|) (<= |fibo_#t~ret0| 3) (<= fibo_~n 5) (<= 5 fibo_~n)) (and .cse0 .cse3 .cse4 (<= fibo_~n 2) (< 1 fibo_~n)) (and (<= |fibo_#t~ret0| 5) (<= 6 fibo_~n) .cse0 (<= 5 |fibo_#t~ret0|) (<= fibo_~n 6)) (and (<= |fibo_#t~ret0| 8) .cse0 (<= 8 |fibo_#t~ret0|) (<= 7 fibo_~n))) (or (not (<= 3 |fibo_#in~n|)) .cse2 (not (<= |fibo_#in~n| 3)))))) [2019-11-19 21:23:26,883 INFO L444 ceAbstractionStarter]: For program point L8(lines 8 12) no Hoare annotation was computed. [2019-11-19 21:23:26,883 INFO L444 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2019-11-19 21:23:26,883 INFO L444 ceAbstractionStarter]: For program point L6(lines 6 12) no Hoare annotation was computed. [2019-11-19 21:23:26,884 INFO L447 ceAbstractionStarter]: At program point fiboENTRY(lines 5 13) the Hoare annotation is: true [2019-11-19 21:23:26,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:23:26 BoogieIcfgContainer [2019-11-19 21:23:26,896 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:23:26,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:23:26,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:23:26,897 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:23:26,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:23:13" (3/4) ... [2019-11-19 21:23:26,902 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:23:26,907 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibo [2019-11-19 21:23:26,912 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-19 21:23:26,913 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 21:23:26,954 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:23:26,954 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:23:26,956 INFO L168 Benchmark]: Toolchain (without parser) took 14285.26 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 518.5 MB). Free memory was 961.7 MB in the beginning and 1.4 GB in the end (delta: -416.5 MB). Peak memory consumption was 102.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:26,956 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:23:26,962 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.30 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:26,963 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.29 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:23:26,963 INFO L168 Benchmark]: Boogie Preprocessor took 80.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:26,964 INFO L168 Benchmark]: RCFGBuilder took 225.26 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:26,965 INFO L168 Benchmark]: TraceAbstraction took 13644.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -274.3 MB). Peak memory consumption was 557.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:23:26,965 INFO L168 Benchmark]: Witness Printer took 57.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:23:26,972 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.30 ms. Allocated memory is still 1.0 GB. Free memory was 961.7 MB in the beginning and 951.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.29 ms. Allocated memory is still 1.0 GB. Free memory is still 951.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.26 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13644.30 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 390.6 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -274.3 MB). Peak memory consumption was 557.7 MB. Max. memory is 11.5 GB. * Witness Printer took 57.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: 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: 23]: Loop Invariant Derived loop invariant: 7 <= x - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Result: SAFE, OverallTime: 13.5s, OverallIterations: 11, TraceHistogramMax: 51, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, HoareTripleCheckerStatistics: 225 SDtfs, 419 SDslu, 1262 SDs, 0 SdLazy, 2002 SolverSat, 500 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1620 GetRequests, 1441 SyntacticMatches, 23 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 387 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 566 PreInvPairs, 1154 NumberOfFragments, 146 HoareAnnotationTreeSize, 566 FomulaSimplifications, 23456 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 5 FomulaSimplificationsInter, 5547 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 2201 NumberOfCodeBlocks, 2162 NumberOfCodeBlocksAsserted, 82 NumberOfCheckSat, 2181 ConstructedInterpolants, 0 QuantifiedInterpolants, 1246379 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2341 ConjunctsInSsa, 242 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 21385/28512 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...