./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_security.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_security.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 8cc1f38a976dda42d71f86348e088e61d77f90eb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:30:14,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:30:14,241 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:30:14,253 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:30:14,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:30:14,254 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:30:14,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:30:14,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:30:14,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:30:14,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:30:14,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:30:14,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:30:14,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:30:14,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:30:14,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:30:14,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:30:14,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:30:14,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:30:14,271 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:30:14,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:30:14,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:30:14,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:30:14,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:30:14,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:30:14,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:30:14,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:30:14,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:30:14,290 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:30:14,293 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:30:14,294 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:30:14,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:30:14,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:30:14,297 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:30:14,298 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:30:14,299 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:30:14,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:30:14,304 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:30:14,304 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:30:14,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:30:14,306 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:30:14,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:30:14,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:30:14,343 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:30:14,343 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:30:14,345 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:30:14,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:30:14,346 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:30:14,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:30:14,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:30:14,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:30:14,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:30:14,348 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:30:14,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:30:14,349 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:30:14,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:30:14,350 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:30:14,351 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:30:14,351 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:30:14,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:30:14,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:30:14,352 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:30:14,352 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:30:14,353 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:30:14,353 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:30:14,353 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:30:14,353 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:30:14,354 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:30:14,354 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:30:14,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:30:14,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:30:14,355 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:30:14,355 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 -> 8cc1f38a976dda42d71f86348e088e61d77f90eb [2019-11-28 16:30:14,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:30:14,683 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:30:14,686 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:30:14,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:30:14,688 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:30:14,689 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_security.c [2019-11-28 16:30:14,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f352e58/4485d33b21884d919e5d3b1ca0eebae9/FLAG6a475df71 [2019-11-28 16:30:15,220 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:30:15,221 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_security.c [2019-11-28 16:30:15,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f352e58/4485d33b21884d919e5d3b1ca0eebae9/FLAG6a475df71 [2019-11-28 16:30:15,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99f352e58/4485d33b21884d919e5d3b1ca0eebae9 [2019-11-28 16:30:15,607 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:30:15,608 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:30:15,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:30:15,610 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:30:15,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:30:15,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:30:15" (1/1) ... [2019-11-28 16:30:15,618 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a467b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:15, skipping insertion in model container [2019-11-28 16:30:15,619 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:30:15" (1/1) ... [2019-11-28 16:30:15,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:30:15,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:30:15,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:30:15,891 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:30:15,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:30:16,000 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:30:16,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16 WrapperNode [2019-11-28 16:30:16,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:30:16,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:30:16,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:30:16,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:30:16,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:30:16,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:30:16,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:30:16,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:30:16,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... [2019-11-28 16:30:16,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:30:16,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:30:16,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:30:16,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:30:16,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:30:16,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:30:16,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:30:16,639 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:30:16,639 INFO L287 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-28 16:30:16,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:30:16 BoogieIcfgContainer [2019-11-28 16:30:16,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:30:16,642 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:30:16,642 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:30:16,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:30:16,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:30:15" (1/3) ... [2019-11-28 16:30:16,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153d0b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:30:16, skipping insertion in model container [2019-11-28 16:30:16,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:30:16" (2/3) ... [2019-11-28 16:30:16,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@153d0b0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:30:16, skipping insertion in model container [2019-11-28 16:30:16,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:30:16" (3/3) ... [2019-11-28 16:30:16,649 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-11-28 16:30:16,659 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:30:16,667 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:30:16,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:30:16,701 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:30:16,702 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:30:16,702 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:30:16,702 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:30:16,702 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:30:16,703 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:30:16,703 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:30:16,703 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:30:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-28 16:30:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 16:30:16,723 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:16,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:16,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:16,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:16,730 INFO L82 PathProgramCache]: Analyzing trace with hash 352571364, now seen corresponding path program 1 times [2019-11-28 16:30:16,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:16,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996808586] [2019-11-28 16:30:16,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:16,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:16,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996808586] [2019-11-28 16:30:16,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:16,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:30:16,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710818929] [2019-11-28 16:30:16,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:30:16,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:16,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:30:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:30:16,881 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-28 16:30:16,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:16,911 INFO L93 Difference]: Finished difference Result 154 states and 292 transitions. [2019-11-28 16:30:16,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:30:16,913 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-28 16:30:16,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:16,926 INFO L225 Difference]: With dead ends: 154 [2019-11-28 16:30:16,926 INFO L226 Difference]: Without dead ends: 74 [2019-11-28 16:30:16,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:30:16,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-28 16:30:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-28 16:30:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-28 16:30:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-11-28 16:30:16,976 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 9 [2019-11-28 16:30:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:16,977 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-28 16:30:16,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:30:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2019-11-28 16:30:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:30:16,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:16,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:16,979 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:16,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:16,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697708, now seen corresponding path program 1 times [2019-11-28 16:30:16,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:16,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014291229] [2019-11-28 16:30:16,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:17,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014291229] [2019-11-28 16:30:17,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834725202] [2019-11-28 16:30:17,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,020 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 3 states. [2019-11-28 16:30:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:17,082 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2019-11-28 16:30:17,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:17,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 16:30:17,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:17,084 INFO L225 Difference]: With dead ends: 149 [2019-11-28 16:30:17,085 INFO L226 Difference]: Without dead ends: 77 [2019-11-28 16:30:17,086 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-28 16:30:17,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-28 16:30:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-28 16:30:17,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-11-28 16:30:17,097 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 10 [2019-11-28 16:30:17,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:17,098 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-11-28 16:30:17,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2019-11-28 16:30:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:30:17,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:17,100 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:17,100 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:17,101 INFO L82 PathProgramCache]: Analyzing trace with hash 658032583, now seen corresponding path program 1 times [2019-11-28 16:30:17,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:17,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599906185] [2019-11-28 16:30:17,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:17,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599906185] [2019-11-28 16:30:17,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577028637] [2019-11-28 16:30:17,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,149 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 3 states. [2019-11-28 16:30:17,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:17,242 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2019-11-28 16:30:17,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:17,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 16:30:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:17,246 INFO L225 Difference]: With dead ends: 142 [2019-11-28 16:30:17,247 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 16:30:17,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 16:30:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 16:30:17,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 16:30:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2019-11-28 16:30:17,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2019-11-28 16:30:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:17,268 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2019-11-28 16:30:17,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2019-11-28 16:30:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:30:17,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:17,271 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:17,271 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:17,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2066489199, now seen corresponding path program 1 times [2019-11-28 16:30:17,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:17,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153966177] [2019-11-28 16:30:17,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:17,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153966177] [2019-11-28 16:30:17,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910814659] [2019-11-28 16:30:17,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,337 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 3 states. [2019-11-28 16:30:17,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:17,444 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-11-28 16:30:17,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:17,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 16:30:17,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:17,447 INFO L225 Difference]: With dead ends: 188 [2019-11-28 16:30:17,447 INFO L226 Difference]: Without dead ends: 118 [2019-11-28 16:30:17,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-28 16:30:17,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2019-11-28 16:30:17,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 16:30:17,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2019-11-28 16:30:17,460 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 18 [2019-11-28 16:30:17,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:17,460 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2019-11-28 16:30:17,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:17,461 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2019-11-28 16:30:17,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:30:17,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:17,462 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:17,463 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:17,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:17,463 INFO L82 PathProgramCache]: Analyzing trace with hash 290326405, now seen corresponding path program 1 times [2019-11-28 16:30:17,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:17,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586796912] [2019-11-28 16:30:17,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:17,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586796912] [2019-11-28 16:30:17,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720716515] [2019-11-28 16:30:17,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,493 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand 3 states. [2019-11-28 16:30:17,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:17,542 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2019-11-28 16:30:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:17,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 16:30:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:17,544 INFO L225 Difference]: With dead ends: 179 [2019-11-28 16:30:17,544 INFO L226 Difference]: Without dead ends: 83 [2019-11-28 16:30:17,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-28 16:30:17,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-28 16:30:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-28 16:30:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2019-11-28 16:30:17,554 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 19 [2019-11-28 16:30:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:17,554 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2019-11-28 16:30:17,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2019-11-28 16:30:17,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:30:17,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:17,556 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:17,557 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:17,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:17,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1696736468, now seen corresponding path program 1 times [2019-11-28 16:30:17,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:17,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117293847] [2019-11-28 16:30:17,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:17,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117293847] [2019-11-28 16:30:17,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241500402] [2019-11-28 16:30:17,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,612 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 3 states. [2019-11-28 16:30:17,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:17,666 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2019-11-28 16:30:17,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:17,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 16:30:17,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:17,667 INFO L225 Difference]: With dead ends: 130 [2019-11-28 16:30:17,668 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 16:30:17,669 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 16:30:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-28 16:30:17,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 16:30:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2019-11-28 16:30:17,676 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 25 [2019-11-28 16:30:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:17,676 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2019-11-28 16:30:17,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:17,677 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2019-11-28 16:30:17,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 16:30:17,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:17,678 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:17,679 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:17,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:17,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1712893632, now seen corresponding path program 1 times [2019-11-28 16:30:17,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:17,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035710441] [2019-11-28 16:30:17,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:17,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035710441] [2019-11-28 16:30:17,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117863223] [2019-11-28 16:30:17,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,719 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand 3 states. [2019-11-28 16:30:17,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:17,801 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2019-11-28 16:30:17,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:17,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 16:30:17,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:17,803 INFO L225 Difference]: With dead ends: 154 [2019-11-28 16:30:17,803 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 16:30:17,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 16:30:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-28 16:30:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-28 16:30:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2019-11-28 16:30:17,813 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 26 [2019-11-28 16:30:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:17,813 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2019-11-28 16:30:17,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2019-11-28 16:30:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:30:17,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:17,817 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:17,817 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1584038971, now seen corresponding path program 1 times [2019-11-28 16:30:17,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:17,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009944167] [2019-11-28 16:30:17,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,875 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:17,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009944167] [2019-11-28 16:30:17,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682607647] [2019-11-28 16:30:17,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,877 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand 3 states. [2019-11-28 16:30:17,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:17,919 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2019-11-28 16:30:17,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:17,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 16:30:17,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:17,920 INFO L225 Difference]: With dead ends: 162 [2019-11-28 16:30:17,920 INFO L226 Difference]: Without dead ends: 88 [2019-11-28 16:30:17,921 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-28 16:30:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-28 16:30:17,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-28 16:30:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2019-11-28 16:30:17,939 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 27 [2019-11-28 16:30:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:17,940 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2019-11-28 16:30:17,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2019-11-28 16:30:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:30:17,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:17,941 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:17,941 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:17,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:17,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1447684816, now seen corresponding path program 1 times [2019-11-28 16:30:17,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:17,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174984786] [2019-11-28 16:30:17,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:17,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:17,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174984786] [2019-11-28 16:30:17,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:17,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:17,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715167672] [2019-11-28 16:30:17,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:17,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:17,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:17,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:17,998 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 3 states. [2019-11-28 16:30:18,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:18,036 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2019-11-28 16:30:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:18,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 16:30:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:18,037 INFO L225 Difference]: With dead ends: 135 [2019-11-28 16:30:18,037 INFO L226 Difference]: Without dead ends: 68 [2019-11-28 16:30:18,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-28 16:30:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-28 16:30:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 16:30:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-11-28 16:30:18,043 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 27 [2019-11-28 16:30:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:18,044 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-11-28 16:30:18,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2019-11-28 16:30:18,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 16:30:18,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:18,045 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:18,045 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:18,046 INFO L82 PathProgramCache]: Analyzing trace with hash -573380405, now seen corresponding path program 1 times [2019-11-28 16:30:18,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:18,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930603750] [2019-11-28 16:30:18,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:18,075 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:18,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930603750] [2019-11-28 16:30:18,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:18,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:18,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780021913] [2019-11-28 16:30:18,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:18,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:18,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:18,078 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 3 states. [2019-11-28 16:30:18,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:18,123 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-28 16:30:18,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:18,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 16:30:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:18,127 INFO L225 Difference]: With dead ends: 70 [2019-11-28 16:30:18,128 INFO L226 Difference]: Without dead ends: 66 [2019-11-28 16:30:18,128 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-28 16:30:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-28 16:30:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-28 16:30:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-28 16:30:18,133 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 28 [2019-11-28 16:30:18,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:18,133 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-28 16:30:18,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-28 16:30:18,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 16:30:18,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:18,135 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:18,135 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:18,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:18,135 INFO L82 PathProgramCache]: Analyzing trace with hash -583473182, now seen corresponding path program 1 times [2019-11-28 16:30:18,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:18,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69656055] [2019-11-28 16:30:18,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:18,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:30:18,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69656055] [2019-11-28 16:30:18,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:18,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:18,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418553452] [2019-11-28 16:30:18,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:18,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:18,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:18,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:18,201 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-28 16:30:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:18,229 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2019-11-28 16:30:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:18,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 16:30:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:18,230 INFO L225 Difference]: With dead ends: 107 [2019-11-28 16:30:18,231 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:30:18,231 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:30:18,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:30:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:30:18,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:30:18,235 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-28 16:30:18,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:18,235 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:30:18,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:18,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:30:18,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:30:18,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:30:18,357 INFO L246 CegarLoopResult]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-11-28 16:30:18,358 INFO L246 CegarLoopResult]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-11-28 16:30:18,358 INFO L246 CegarLoopResult]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-11-28 16:30:18,358 INFO L246 CegarLoopResult]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-11-28 16:30:18,358 INFO L246 CegarLoopResult]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-11-28 16:30:18,358 INFO L246 CegarLoopResult]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-11-28 16:30:18,358 INFO L246 CegarLoopResult]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-11-28 16:30:18,358 INFO L246 CegarLoopResult]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-11-28 16:30:18,359 INFO L246 CegarLoopResult]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-11-28 16:30:18,360 INFO L246 CegarLoopResult]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-11-28 16:30:18,360 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:30:18,361 INFO L246 CegarLoopResult]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-11-28 16:30:18,361 INFO L246 CegarLoopResult]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-11-28 16:30:18,361 INFO L246 CegarLoopResult]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-28 16:30:18,361 INFO L246 CegarLoopResult]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-11-28 16:30:18,362 INFO L246 CegarLoopResult]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-11-28 16:30:18,362 INFO L246 CegarLoopResult]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-11-28 16:30:18,362 INFO L246 CegarLoopResult]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-11-28 16:30:18,362 INFO L246 CegarLoopResult]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-11-28 16:30:18,362 INFO L246 CegarLoopResult]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-11-28 16:30:18,363 INFO L246 CegarLoopResult]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-11-28 16:30:18,363 INFO L246 CegarLoopResult]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-11-28 16:30:18,363 INFO L246 CegarLoopResult]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-11-28 16:30:18,364 INFO L246 CegarLoopResult]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-11-28 16:30:18,365 INFO L242 CegarLoopResult]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and (<= ULTIMATE.start_main_~this_state~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-28 16:30:18,365 INFO L246 CegarLoopResult]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-11-28 16:30:18,365 INFO L246 CegarLoopResult]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-11-28 16:30:18,366 INFO L246 CegarLoopResult]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-11-28 16:30:18,366 INFO L246 CegarLoopResult]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-11-28 16:30:18,366 INFO L246 CegarLoopResult]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-11-28 16:30:18,366 INFO L246 CegarLoopResult]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-28 16:30:18,367 INFO L246 CegarLoopResult]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-11-28 16:30:18,367 INFO L246 CegarLoopResult]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-11-28 16:30:18,367 INFO L246 CegarLoopResult]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-11-28 16:30:18,367 INFO L246 CegarLoopResult]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-11-28 16:30:18,367 INFO L242 CegarLoopResult]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-11-28 16:30:18,368 INFO L246 CegarLoopResult]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-11-28 16:30:18,368 INFO L246 CegarLoopResult]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-11-28 16:30:18,368 INFO L246 CegarLoopResult]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-11-28 16:30:18,368 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:30:18,368 INFO L246 CegarLoopResult]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-11-28 16:30:18,369 INFO L246 CegarLoopResult]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-11-28 16:30:18,369 INFO L246 CegarLoopResult]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-28 16:30:18,369 INFO L246 CegarLoopResult]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-11-28 16:30:18,370 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:30:18,370 INFO L246 CegarLoopResult]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-11-28 16:30:18,370 INFO L249 CegarLoopResult]: At program point L13(lines 13 390) the Hoare annotation is: true [2019-11-28 16:30:18,370 INFO L246 CegarLoopResult]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-28 16:30:18,370 INFO L246 CegarLoopResult]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-11-28 16:30:18,371 INFO L246 CegarLoopResult]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-11-28 16:30:18,371 INFO L246 CegarLoopResult]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-11-28 16:30:18,371 INFO L246 CegarLoopResult]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-11-28 16:30:18,372 INFO L246 CegarLoopResult]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-11-28 16:30:18,372 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:30:18,372 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-11-28 16:30:18,372 INFO L246 CegarLoopResult]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-11-28 16:30:18,373 INFO L246 CegarLoopResult]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-11-28 16:30:18,373 INFO L246 CegarLoopResult]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-11-28 16:30:18,373 INFO L246 CegarLoopResult]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-11-28 16:30:18,374 INFO L246 CegarLoopResult]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-11-28 16:30:18,374 INFO L246 CegarLoopResult]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-11-28 16:30:18,374 INFO L246 CegarLoopResult]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-11-28 16:30:18,374 INFO L246 CegarLoopResult]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-11-28 16:30:18,375 INFO L246 CegarLoopResult]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-11-28 16:30:18,376 INFO L246 CegarLoopResult]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-11-28 16:30:18,376 INFO L246 CegarLoopResult]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-11-28 16:30:18,376 INFO L246 CegarLoopResult]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-11-28 16:30:18,376 INFO L246 CegarLoopResult]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-11-28 16:30:18,377 INFO L246 CegarLoopResult]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-11-28 16:30:18,377 INFO L242 CegarLoopResult]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~this_state~0 0))) (or (and (= ULTIMATE.start_main_~q~0 3) (= 2 ULTIMATE.start_main_~this_state~0)) (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-28 16:30:18,377 INFO L246 CegarLoopResult]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-11-28 16:30:18,377 INFO L246 CegarLoopResult]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-11-28 16:30:18,378 INFO L246 CegarLoopResult]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-11-28 16:30:18,378 INFO L246 CegarLoopResult]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-11-28 16:30:18,378 INFO L246 CegarLoopResult]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-11-28 16:30:18,378 INFO L246 CegarLoopResult]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-11-28 16:30:18,378 INFO L246 CegarLoopResult]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-11-28 16:30:18,379 INFO L246 CegarLoopResult]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-11-28 16:30:18,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:30:18 BoogieIcfgContainer [2019-11-28 16:30:18,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:30:18,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:30:18,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:30:18,408 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:30:18,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:30:16" (3/4) ... [2019-11-28 16:30:18,413 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:30:18,439 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 16:30:18,440 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 16:30:18,523 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:30:18,524 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:30:18,528 INFO L168 Benchmark]: Toolchain (without parser) took 2917.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 956.3 MB in the beginning and 955.6 MB in the end (delta: 698.3 kB). Peak memory consumption was 151.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:18,529 INFO L168 Benchmark]: CDTParser took 1.10 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:18,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:18,532 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:18,536 INFO L168 Benchmark]: Boogie Preprocessor took 28.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:18,537 INFO L168 Benchmark]: RCFGBuilder took 563.59 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:18,539 INFO L168 Benchmark]: TraceAbstraction took 1765.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.6 MB in the end (delta: 152.8 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:18,542 INFO L168 Benchmark]: Witness Printer took 117.02 ms. Allocated memory is still 1.2 GB. Free memory is still 955.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:18,552 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.10 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 393.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -184.6 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.16 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 563.59 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: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1765.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 955.6 MB in the end (delta: 152.8 MB). Peak memory consumption was 152.8 MB. Max. memory is 11.5 GB. * Witness Printer took 117.02 ms. Allocated memory is still 1.2 GB. Free memory is still 955.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((q == 3 && 2 == this_state) || (4 <= q && 3 == this_state)) || (this_state <= 0 && q == 2)) || (this_state <= 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (4 <= q && 3 == this_state) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 963 SDtfs, 337 SDslu, 415 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 46 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 8086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 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...