./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-3.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_abp_1-3.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 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:29:51,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:29:51,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:29:51,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:29:51,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:29:51,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:29:51,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:29:51,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:29:51,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:29:51,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:29:51,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:29:51,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:29:51,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:29:51,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:29:51,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:29:51,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:29:51,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:29:51,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:29:51,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:29:51,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:29:51,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:29:51,208 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:29:51,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:29:51,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:29:51,216 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:29:51,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:29:51,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:29:51,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:29:51,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:29:51,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:29:51,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:29:51,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:29:51,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:29:51,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:29:51,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:29:51,227 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:29:51,228 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:29:51,228 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:29:51,228 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:29:51,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:29:51,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:29:51,233 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:29:51,255 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:29:51,255 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:29:51,257 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:29:51,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:29:51,258 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:29:51,258 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:29:51,258 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:29:51,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:29:51,259 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:29:51,259 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:29:51,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:29:51,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:29:51,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:29:51,261 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:29:51,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:29:51,262 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:29:51,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:29:51,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:29:51,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:29:51,263 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:29:51,263 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:29:51,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:29:51,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:29:51,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:29:51,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:29:51,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:29:51,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:29:51,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:29:51,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:29:51,266 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 -> 45f0d0ab6d17adbe7cd7f36bcd9ec097795f4c36 [2019-11-28 16:29:51,562 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:29:51,580 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:29:51,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:29:51,585 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:29:51,586 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:29:51,586 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-28 16:29:51,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79988d0b9/02b3973f4215494fbad3249df8dcc820/FLAG638f51921 [2019-11-28 16:29:52,187 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:29:52,188 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2019-11-28 16:29:52,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79988d0b9/02b3973f4215494fbad3249df8dcc820/FLAG638f51921 [2019-11-28 16:29:52,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79988d0b9/02b3973f4215494fbad3249df8dcc820 [2019-11-28 16:29:52,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:29:52,476 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:29:52,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:29:52,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:29:52,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:29:52,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:29:52" (1/1) ... [2019-11-28 16:29:52,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3520c93b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:52, skipping insertion in model container [2019-11-28 16:29:52,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:29:52" (1/1) ... [2019-11-28 16:29:52,496 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:29:52,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:29:52,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:29:52,916 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:29:52,985 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:29:52,999 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:29:53,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53 WrapperNode [2019-11-28 16:29:53,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:29:53,001 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:29:53,001 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:29:53,001 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:29:53,010 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:29:53" (1/1) ... [2019-11-28 16:29:53,022 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:29:53" (1/1) ... [2019-11-28 16:29:53,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:29:53,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:29:53,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:29:53,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:29:53,086 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (1/1) ... [2019-11-28 16:29:53,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (1/1) ... [2019-11-28 16:29:53,090 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (1/1) ... [2019-11-28 16:29:53,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (1/1) ... [2019-11-28 16:29:53,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (1/1) ... [2019-11-28 16:29:53,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (1/1) ... [2019-11-28 16:29:53,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (1/1) ... [2019-11-28 16:29:53,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:29:53,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:29:53,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:29:53,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:29:53,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (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:29:53,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:29:53,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:29:54,211 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:29:54,211 INFO L287 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-28 16:29:54,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:29:54 BoogieIcfgContainer [2019-11-28 16:29:54,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:29:54,214 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:29:54,214 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:29:54,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:29:54,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:29:52" (1/3) ... [2019-11-28 16:29:54,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7745ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:29:54, skipping insertion in model container [2019-11-28 16:29:54,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:29:53" (2/3) ... [2019-11-28 16:29:54,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7745ebd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:29:54, skipping insertion in model container [2019-11-28 16:29:54,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:29:54" (3/3) ... [2019-11-28 16:29:54,221 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_abp_1-3.c [2019-11-28 16:29:54,231 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:29:54,239 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:29:54,249 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:29:54,276 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:29:54,276 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:29:54,276 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:29:54,277 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:29:54,277 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:29:54,277 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:29:54,277 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:29:54,278 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:29:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-28 16:29:54,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 16:29:54,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:54,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:29:54,303 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:54,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:54,307 INFO L82 PathProgramCache]: Analyzing trace with hash 352571511, now seen corresponding path program 1 times [2019-11-28 16:29:54,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:54,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375719928] [2019-11-28 16:29:54,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:54,475 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:29:54,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375719928] [2019-11-28 16:29:54,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:29:54,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:29:54,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128252426] [2019-11-28 16:29:54,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:29:54,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:54,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:29:54,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:29:54,501 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 2 states. [2019-11-28 16:29:54,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:54,535 INFO L93 Difference]: Finished difference Result 216 states and 416 transitions. [2019-11-28 16:29:54,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:29:54,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-28 16:29:54,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:54,548 INFO L225 Difference]: With dead ends: 216 [2019-11-28 16:29:54,549 INFO L226 Difference]: Without dead ends: 100 [2019-11-28 16:29:54,554 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:29:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-28 16:29:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-28 16:29:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 16:29:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 165 transitions. [2019-11-28 16:29:54,601 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 165 transitions. Word has length 9 [2019-11-28 16:29:54,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:54,602 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 165 transitions. [2019-11-28 16:29:54,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:29:54,602 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 165 transitions. [2019-11-28 16:29:54,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:29:54,603 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:54,603 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:29:54,603 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:54,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:54,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697561, now seen corresponding path program 1 times [2019-11-28 16:29:54,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:54,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183614039] [2019-11-28 16:29:54,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:54,679 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:29:54,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183614039] [2019-11-28 16:29:54,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:29:54,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:29:54,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41584451] [2019-11-28 16:29:54,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:29:54,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:54,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:29:54,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:29:54,687 INFO L87 Difference]: Start difference. First operand 100 states and 165 transitions. Second operand 3 states. [2019-11-28 16:29:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:54,760 INFO L93 Difference]: Finished difference Result 201 states and 332 transitions. [2019-11-28 16:29:54,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:29:54,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 16:29:54,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:54,762 INFO L225 Difference]: With dead ends: 201 [2019-11-28 16:29:54,763 INFO L226 Difference]: Without dead ends: 103 [2019-11-28 16:29:54,764 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:29:54,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-28 16:29:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-11-28 16:29:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 16:29:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 168 transitions. [2019-11-28 16:29:54,781 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 168 transitions. Word has length 10 [2019-11-28 16:29:54,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:54,782 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 168 transitions. [2019-11-28 16:29:54,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:29:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 168 transitions. [2019-11-28 16:29:54,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 16:29:54,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:54,784 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:29:54,785 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:54,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:54,785 INFO L82 PathProgramCache]: Analyzing trace with hash 658032730, now seen corresponding path program 1 times [2019-11-28 16:29:54,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:54,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067587426] [2019-11-28 16:29:54,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:55,308 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 32 [2019-11-28 16:29:55,318 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:29:55,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067587426] [2019-11-28 16:29:55,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:29:55,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:29:55,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569057874] [2019-11-28 16:29:55,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:29:55,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:29:55,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:29:55,322 INFO L87 Difference]: Start difference. First operand 103 states and 168 transitions. Second operand 4 states. [2019-11-28 16:29:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:55,745 INFO L93 Difference]: Finished difference Result 205 states and 334 transitions. [2019-11-28 16:29:55,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:29:55,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 16:29:55,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:55,749 INFO L225 Difference]: With dead ends: 205 [2019-11-28 16:29:55,749 INFO L226 Difference]: Without dead ends: 186 [2019-11-28 16:29:55,750 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:29:55,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-28 16:29:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 172. [2019-11-28 16:29:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-28 16:29:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 281 transitions. [2019-11-28 16:29:55,781 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 281 transitions. Word has length 15 [2019-11-28 16:29:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:55,782 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 281 transitions. [2019-11-28 16:29:55,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:29:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 281 transitions. [2019-11-28 16:29:55,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:29:55,785 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:55,785 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:29:55,785 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1675425412, now seen corresponding path program 1 times [2019-11-28 16:29:55,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:55,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994449138] [2019-11-28 16:29:55,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:55,851 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:29:55,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994449138] [2019-11-28 16:29:55,852 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:29:55,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:29:55,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385791384] [2019-11-28 16:29:55,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:29:55,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:55,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:29:55,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:29:55,856 INFO L87 Difference]: Start difference. First operand 172 states and 281 transitions. Second operand 3 states. [2019-11-28 16:29:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:55,893 INFO L93 Difference]: Finished difference Result 293 states and 477 transitions. [2019-11-28 16:29:55,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:29:55,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 16:29:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:55,895 INFO L225 Difference]: With dead ends: 293 [2019-11-28 16:29:55,896 INFO L226 Difference]: Without dead ends: 124 [2019-11-28 16:29:55,897 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:29:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-28 16:29:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-11-28 16:29:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 16:29:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 194 transitions. [2019-11-28 16:29:55,915 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 194 transitions. Word has length 16 [2019-11-28 16:29:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:55,915 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 194 transitions. [2019-11-28 16:29:55,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:29:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 194 transitions. [2019-11-28 16:29:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 16:29:55,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:55,920 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:29:55,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -843118083, now seen corresponding path program 1 times [2019-11-28 16:29:55,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:55,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873206372] [2019-11-28 16:29:55,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:55,982 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:29:55,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873206372] [2019-11-28 16:29:55,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:29:55,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:29:55,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343633057] [2019-11-28 16:29:55,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:29:55,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:55,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:29:55,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:29:55,986 INFO L87 Difference]: Start difference. First operand 122 states and 194 transitions. Second operand 3 states. [2019-11-28 16:29:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:56,020 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2019-11-28 16:29:56,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:29:56,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-28 16:29:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:56,022 INFO L225 Difference]: With dead ends: 226 [2019-11-28 16:29:56,022 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 16:29:56,023 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:29:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 16:29:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-28 16:29:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 16:29:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 163 transitions. [2019-11-28 16:29:56,030 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 163 transitions. Word has length 21 [2019-11-28 16:29:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:56,031 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 163 transitions. [2019-11-28 16:29:56,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:29:56,031 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 163 transitions. [2019-11-28 16:29:56,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 16:29:56,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:56,032 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:29:56,033 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:56,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:56,033 INFO L82 PathProgramCache]: Analyzing trace with hash -671640130, now seen corresponding path program 1 times [2019-11-28 16:29:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:56,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583502353] [2019-11-28 16:29:56,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:58,364 WARN L192 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 80 DAG size of output: 27 [2019-11-28 16:29:58,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:29:58,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583502353] [2019-11-28 16:29:58,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024112402] [2019-11-28 16:29:58,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:29:58,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:58,470 INFO L264 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 16:29:58,477 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:29:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:29:58,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:29:58,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-28 16:29:58,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460981060] [2019-11-28 16:29:58,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 16:29:58,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:58,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 16:29:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:29:58,535 INFO L87 Difference]: Start difference. First operand 105 states and 163 transitions. Second operand 7 states. [2019-11-28 16:29:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:59,289 INFO L93 Difference]: Finished difference Result 359 states and 564 transitions. [2019-11-28 16:29:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 16:29:59,289 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-11-28 16:29:59,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:59,292 INFO L225 Difference]: With dead ends: 359 [2019-11-28 16:29:59,292 INFO L226 Difference]: Without dead ends: 319 [2019-11-28 16:29:59,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2019-11-28 16:29:59,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-11-28 16:29:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 275. [2019-11-28 16:29:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-28 16:29:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 434 transitions. [2019-11-28 16:29:59,320 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 434 transitions. Word has length 23 [2019-11-28 16:29:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:59,320 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 434 transitions. [2019-11-28 16:29:59,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 16:29:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 434 transitions. [2019-11-28 16:29:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 16:29:59,323 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:59,323 INFO L410 BasicCegarLoop]: trace histogram [3, 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:29:59,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:29:59,536 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:59,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1800121285, now seen corresponding path program 1 times [2019-11-28 16:29:59,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:59,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355516294] [2019-11-28 16:29:59,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 16:29:59,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355516294] [2019-11-28 16:29:59,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:29:59,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:29:59,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955663605] [2019-11-28 16:29:59,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:29:59,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:59,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:29:59,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:29:59,582 INFO L87 Difference]: Start difference. First operand 275 states and 434 transitions. Second operand 3 states. [2019-11-28 16:29:59,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:59,611 INFO L93 Difference]: Finished difference Result 548 states and 861 transitions. [2019-11-28 16:29:59,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:29:59,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 16:29:59,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:59,614 INFO L225 Difference]: With dead ends: 548 [2019-11-28 16:29:59,614 INFO L226 Difference]: Without dead ends: 297 [2019-11-28 16:29:59,615 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:29:59,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-11-28 16:29:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2019-11-28 16:29:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-28 16:29:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 454 transitions. [2019-11-28 16:29:59,625 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 454 transitions. Word has length 25 [2019-11-28 16:29:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:59,626 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 454 transitions. [2019-11-28 16:29:59,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:29:59,626 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 454 transitions. [2019-11-28 16:29:59,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 16:29:59,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:59,627 INFO L410 BasicCegarLoop]: trace histogram [3, 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:29:59,627 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:29:59,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:29:59,627 INFO L82 PathProgramCache]: Analyzing trace with hash 2124865792, now seen corresponding path program 1 times [2019-11-28 16:29:59,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:29:59,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686494477] [2019-11-28 16:29:59,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:29:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:29:59,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686494477] [2019-11-28 16:29:59,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883631098] [2019-11-28 16:29:59,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:29:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:29:59,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 16:29:59,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:29:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 16:29:59,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 16:29:59,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-11-28 16:29:59,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407166058] [2019-11-28 16:29:59,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:29:59,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:29:59,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:29:59,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:29:59,919 INFO L87 Difference]: Start difference. First operand 295 states and 454 transitions. Second operand 3 states. [2019-11-28 16:29:59,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:29:59,939 INFO L93 Difference]: Finished difference Result 298 states and 456 transitions. [2019-11-28 16:29:59,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:29:59,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 16:29:59,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:29:59,942 INFO L225 Difference]: With dead ends: 298 [2019-11-28 16:29:59,942 INFO L226 Difference]: Without dead ends: 292 [2019-11-28 16:29:59,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:29:59,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-11-28 16:29:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2019-11-28 16:29:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-28 16:29:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 442 transitions. [2019-11-28 16:29:59,952 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 442 transitions. Word has length 27 [2019-11-28 16:29:59,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:29:59,954 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 442 transitions. [2019-11-28 16:29:59,954 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:29:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 442 transitions. [2019-11-28 16:29:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 16:29:59,956 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:29:59,956 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:00,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:00,163 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:00,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:00,164 INFO L82 PathProgramCache]: Analyzing trace with hash -917092134, now seen corresponding path program 1 times [2019-11-28 16:30:00,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:00,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740138949] [2019-11-28 16:30:00,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 16:30:00,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740138949] [2019-11-28 16:30:00,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:00,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:00,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087877910] [2019-11-28 16:30:00,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:00,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:00,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:00,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:00,203 INFO L87 Difference]: Start difference. First operand 291 states and 442 transitions. Second operand 3 states. [2019-11-28 16:30:00,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:00,235 INFO L93 Difference]: Finished difference Result 510 states and 775 transitions. [2019-11-28 16:30:00,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:00,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 16:30:00,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:00,238 INFO L225 Difference]: With dead ends: 510 [2019-11-28 16:30:00,238 INFO L226 Difference]: Without dead ends: 243 [2019-11-28 16:30:00,239 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:00,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-11-28 16:30:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2019-11-28 16:30:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-28 16:30:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 361 transitions. [2019-11-28 16:30:00,247 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 361 transitions. Word has length 33 [2019-11-28 16:30:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:00,247 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 361 transitions. [2019-11-28 16:30:00,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 361 transitions. [2019-11-28 16:30:00,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-28 16:30:00,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:00,255 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1] [2019-11-28 16:30:00,256 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:00,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:00,256 INFO L82 PathProgramCache]: Analyzing trace with hash 272165387, now seen corresponding path program 1 times [2019-11-28 16:30:00,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:00,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650614041] [2019-11-28 16:30:00,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:00,290 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-28 16:30:00,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650614041] [2019-11-28 16:30:00,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:00,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:00,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824852735] [2019-11-28 16:30:00,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:00,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:00,292 INFO L87 Difference]: Start difference. First operand 241 states and 361 transitions. Second operand 3 states. [2019-11-28 16:30:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:00,322 INFO L93 Difference]: Finished difference Result 424 states and 632 transitions. [2019-11-28 16:30:00,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:00,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-11-28 16:30:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:00,325 INFO L225 Difference]: With dead ends: 424 [2019-11-28 16:30:00,325 INFO L226 Difference]: Without dead ends: 225 [2019-11-28 16:30:00,325 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:00,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-11-28 16:30:00,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2019-11-28 16:30:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-28 16:30:00,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 324 transitions. [2019-11-28 16:30:00,332 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 324 transitions. Word has length 37 [2019-11-28 16:30:00,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:00,333 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 324 transitions. [2019-11-28 16:30:00,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:00,333 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 324 transitions. [2019-11-28 16:30:00,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 16:30:00,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:00,334 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:00,334 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:00,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -140510671, now seen corresponding path program 1 times [2019-11-28 16:30:00,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:00,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036192559] [2019-11-28 16:30:00,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-28 16:30:00,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036192559] [2019-11-28 16:30:00,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:30:00,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 16:30:00,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237549470] [2019-11-28 16:30:00,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 16:30:00,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:00,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 16:30:00,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 16:30:00,377 INFO L87 Difference]: Start difference. First operand 223 states and 324 transitions. Second operand 3 states. [2019-11-28 16:30:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:00,405 INFO L93 Difference]: Finished difference Result 305 states and 442 transitions. [2019-11-28 16:30:00,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:30:00,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-11-28 16:30:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:00,407 INFO L225 Difference]: With dead ends: 305 [2019-11-28 16:30:00,407 INFO L226 Difference]: Without dead ends: 143 [2019-11-28 16:30:00,407 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:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-28 16:30:00,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2019-11-28 16:30:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-28 16:30:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 199 transitions. [2019-11-28 16:30:00,413 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 199 transitions. Word has length 46 [2019-11-28 16:30:00,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:00,413 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 199 transitions. [2019-11-28 16:30:00,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 16:30:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 199 transitions. [2019-11-28 16:30:00,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-28 16:30:00,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:00,414 INFO L410 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:00,414 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:00,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1014660280, now seen corresponding path program 1 times [2019-11-28 16:30:00,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:00,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899149295] [2019-11-28 16:30:00,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-28 16:30:00,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899149295] [2019-11-28 16:30:00,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593693071] [2019-11-28 16:30:00,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:00,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-28 16:30:00,691 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:30:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:00,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:30:00,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 16:30:00,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759661550] [2019-11-28 16:30:00,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:30:00,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:30:00,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:30:00,761 INFO L87 Difference]: Start difference. First operand 141 states and 199 transitions. Second operand 10 states. [2019-11-28 16:30:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:00,879 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2019-11-28 16:30:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:30:00,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-11-28 16:30:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:00,881 INFO L225 Difference]: With dead ends: 167 [2019-11-28 16:30:00,881 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 16:30:00,882 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:30:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 16:30:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2019-11-28 16:30:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-11-28 16:30:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 220 transitions. [2019-11-28 16:30:00,890 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 220 transitions. Word has length 47 [2019-11-28 16:30:00,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:00,891 INFO L462 AbstractCegarLoop]: Abstraction has 158 states and 220 transitions. [2019-11-28 16:30:00,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:30:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 220 transitions. [2019-11-28 16:30:00,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-28 16:30:00,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:00,893 INFO L410 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:01,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:01,099 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:01,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:01,099 INFO L82 PathProgramCache]: Analyzing trace with hash 751253453, now seen corresponding path program 1 times [2019-11-28 16:30:01,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:01,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166181511] [2019-11-28 16:30:01,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:01,622 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 31 [2019-11-28 16:30:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:01,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166181511] [2019-11-28 16:30:01,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39327681] [2019-11-28 16:30:01,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:01,785 INFO L264 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-28 16:30:01,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:30:01,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-28 16:30:01,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:30:01,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:30:01,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:30:01,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 16:30:01,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:01,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:02,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:30:02,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2019-11-28 16:30:02,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997985945] [2019-11-28 16:30:02,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 16:30:02,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 16:30:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:30:02,008 INFO L87 Difference]: Start difference. First operand 158 states and 220 transitions. Second operand 10 states. [2019-11-28 16:30:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:02,368 INFO L93 Difference]: Finished difference Result 177 states and 246 transitions. [2019-11-28 16:30:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:30:02,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-11-28 16:30:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:02,370 INFO L225 Difference]: With dead ends: 177 [2019-11-28 16:30:02,370 INFO L226 Difference]: Without dead ends: 175 [2019-11-28 16:30:02,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 16:30:02,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-28 16:30:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-11-28 16:30:02,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-28 16:30:02,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 243 transitions. [2019-11-28 16:30:02,378 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 243 transitions. Word has length 57 [2019-11-28 16:30:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:02,379 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 243 transitions. [2019-11-28 16:30:02,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 16:30:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 243 transitions. [2019-11-28 16:30:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-28 16:30:02,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:02,380 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:30:02,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:02,595 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:02,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:02,595 INFO L82 PathProgramCache]: Analyzing trace with hash 384172331, now seen corresponding path program 1 times [2019-11-28 16:30:02,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:02,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497819201] [2019-11-28 16:30:02,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:03,079 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 31 [2019-11-28 16:30:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:03,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497819201] [2019-11-28 16:30:03,104 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765462520] [2019-11-28 16:30:03,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:03,222 INFO L264 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-28 16:30:03,225 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:30:03,276 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 12 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:03,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:30:03,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-11-28 16:30:03,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130697627] [2019-11-28 16:30:03,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:30:03,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:03,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:30:03,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:30:03,278 INFO L87 Difference]: Start difference. First operand 174 states and 243 transitions. Second operand 9 states. [2019-11-28 16:30:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:03,403 INFO L93 Difference]: Finished difference Result 194 states and 270 transitions. [2019-11-28 16:30:03,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 16:30:03,404 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-28 16:30:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:03,405 INFO L225 Difference]: With dead ends: 194 [2019-11-28 16:30:03,405 INFO L226 Difference]: Without dead ends: 192 [2019-11-28 16:30:03,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:30:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-28 16:30:03,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-11-28 16:30:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-28 16:30:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 268 transitions. [2019-11-28 16:30:03,412 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 268 transitions. Word has length 66 [2019-11-28 16:30:03,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:03,413 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 268 transitions. [2019-11-28 16:30:03,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:30:03,413 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 268 transitions. [2019-11-28 16:30:03,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 16:30:03,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:30:03,414 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:03,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:03,614 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:30:03,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:30:03,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2057891779, now seen corresponding path program 1 times [2019-11-28 16:30:03,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:30:03,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495856363] [2019-11-28 16:30:03,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:30:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:06,101 WARN L192 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 74 DAG size of output: 21 [2019-11-28 16:30:08,434 WARN L192 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 169 DAG size of output: 31 [2019-11-28 16:30:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 90 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-28 16:30:08,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495856363] [2019-11-28 16:30:08,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748461145] [2019-11-28 16:30:08,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:30:08,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 16:30:08,603 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:30:08,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:30:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 14 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:30:08,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 16:30:08,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2019-11-28 16:30:08,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483162251] [2019-11-28 16:30:08,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 16:30:08,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:30:08,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 16:30:08,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:30:08,820 INFO L87 Difference]: Start difference. First operand 192 states and 268 transitions. Second operand 16 states. [2019-11-28 16:30:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:30:08,985 INFO L93 Difference]: Finished difference Result 211 states and 295 transitions. [2019-11-28 16:30:08,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 16:30:08,986 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 78 [2019-11-28 16:30:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:30:08,987 INFO L225 Difference]: With dead ends: 211 [2019-11-28 16:30:08,987 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:30:08,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:30:08,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:30:08,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:30:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:30:08,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:30:08,988 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-11-28 16:30:08,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:30:08,989 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:30:08,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 16:30:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:30:08,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:30:09,193 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 16:30:09,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:30:09,422 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 42 [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L498(lines 498 500) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L366(lines 366 368) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L466(lines 466 468) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L39(lines 39 58) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L40(lines 40 55) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L140(lines 140 155) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L240(lines 240 255) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L108(lines 108 123) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L42(lines 42 53) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L340(lines 340 355) no Hoare annotation was computed. [2019-11-28 16:30:09,479 INFO L246 CegarLoopResult]: For program point L208(lines 208 223) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L142(lines 142 153) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L76(lines 76 91) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L440(lines 440 455) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L308(lines 308 323) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L242(lines 242 253) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L176(lines 176 191) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L110(lines 110 121) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L540(lines 540 555) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L408(lines 408 423) no Hoare annotation was computed. [2019-11-28 16:30:09,480 INFO L246 CegarLoopResult]: For program point L342(lines 342 353) no Hoare annotation was computed. [2019-11-28 16:30:09,481 INFO L246 CegarLoopResult]: For program point L276(lines 276 291) no Hoare annotation was computed. [2019-11-28 16:30:09,481 INFO L246 CegarLoopResult]: For program point L210(lines 210 221) no Hoare annotation was computed. [2019-11-28 16:30:09,482 INFO L246 CegarLoopResult]: For program point L78(lines 78 89) no Hoare annotation was computed. [2019-11-28 16:30:09,482 INFO L246 CegarLoopResult]: For program point L508(lines 508 523) no Hoare annotation was computed. [2019-11-28 16:30:09,482 INFO L246 CegarLoopResult]: For program point L442(lines 442 453) no Hoare annotation was computed. [2019-11-28 16:30:09,482 INFO L246 CegarLoopResult]: For program point L376(lines 376 391) no Hoare annotation was computed. [2019-11-28 16:30:09,482 INFO L246 CegarLoopResult]: For program point L310(lines 310 321) no Hoare annotation was computed. [2019-11-28 16:30:09,482 INFO L246 CegarLoopResult]: For program point L178(lines 178 189) no Hoare annotation was computed. [2019-11-28 16:30:09,483 INFO L246 CegarLoopResult]: For program point L46(lines 46 48) no Hoare annotation was computed. [2019-11-28 16:30:09,483 INFO L246 CegarLoopResult]: For program point L542(lines 542 553) no Hoare annotation was computed. [2019-11-28 16:30:09,483 INFO L246 CegarLoopResult]: For program point L476(lines 476 491) no Hoare annotation was computed. [2019-11-28 16:30:09,483 INFO L246 CegarLoopResult]: For program point L410(lines 410 421) no Hoare annotation was computed. [2019-11-28 16:30:09,483 INFO L246 CegarLoopResult]: For program point L278(lines 278 289) no Hoare annotation was computed. [2019-11-28 16:30:09,483 INFO L246 CegarLoopResult]: For program point L146(lines 146 148) no Hoare annotation was computed. [2019-11-28 16:30:09,483 INFO L249 CegarLoopResult]: At program point L14(lines 14 566) the Hoare annotation is: true [2019-11-28 16:30:09,484 INFO L246 CegarLoopResult]: For program point L510(lines 510 521) no Hoare annotation was computed. [2019-11-28 16:30:09,485 INFO L246 CegarLoopResult]: For program point L378(lines 378 389) no Hoare annotation was computed. [2019-11-28 16:30:09,486 INFO L246 CegarLoopResult]: For program point L246(lines 246 248) no Hoare annotation was computed. [2019-11-28 16:30:09,486 INFO L246 CegarLoopResult]: For program point L114(lines 114 116) no Hoare annotation was computed. [2019-11-28 16:30:09,486 INFO L246 CegarLoopResult]: For program point L478(lines 478 489) no Hoare annotation was computed. [2019-11-28 16:30:09,486 INFO L246 CegarLoopResult]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-28 16:30:09,486 INFO L246 CegarLoopResult]: For program point L214(lines 214 216) no Hoare annotation was computed. [2019-11-28 16:30:09,487 INFO L246 CegarLoopResult]: For program point L82(lines 82 84) no Hoare annotation was computed. [2019-11-28 16:30:09,487 INFO L246 CegarLoopResult]: For program point L446(lines 446 448) no Hoare annotation was computed. [2019-11-28 16:30:09,488 INFO L246 CegarLoopResult]: For program point L314(lines 314 316) no Hoare annotation was computed. [2019-11-28 16:30:09,488 INFO L246 CegarLoopResult]: For program point L182(lines 182 184) no Hoare annotation was computed. [2019-11-28 16:30:09,488 INFO L246 CegarLoopResult]: For program point L546(lines 546 548) no Hoare annotation was computed. [2019-11-28 16:30:09,488 INFO L246 CegarLoopResult]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-28 16:30:09,489 INFO L246 CegarLoopResult]: For program point L282(lines 282 284) no Hoare annotation was computed. [2019-11-28 16:30:09,489 INFO L242 CegarLoopResult]: At program point L547(lines 14 566) the Hoare annotation is: false [2019-11-28 16:30:09,489 INFO L246 CegarLoopResult]: For program point L514(lines 514 516) no Hoare annotation was computed. [2019-11-28 16:30:09,489 INFO L246 CegarLoopResult]: For program point L382(lines 382 384) no Hoare annotation was computed. [2019-11-28 16:30:09,489 INFO L246 CegarLoopResult]: For program point L482(lines 482 484) no Hoare annotation was computed. [2019-11-28 16:30:09,490 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:30:09,490 INFO L242 CegarLoopResult]: At program point L24-2(lines 24 561) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2)) (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648)) (<= ULTIMATE.start_main_~P8~0 2147483647)) (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)))) [2019-11-28 16:30:09,490 INFO L246 CegarLoopResult]: For program point L24-3(lines 24 561) no Hoare annotation was computed. [2019-11-28 16:30:09,490 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:30:09,490 INFO L246 CegarLoopResult]: For program point L124(lines 124 139) no Hoare annotation was computed. [2019-11-28 16:30:09,491 INFO L246 CegarLoopResult]: For program point L224(lines 224 239) no Hoare annotation was computed. [2019-11-28 16:30:09,491 INFO L246 CegarLoopResult]: For program point L92(lines 92 107) no Hoare annotation was computed. [2019-11-28 16:30:09,491 INFO L246 CegarLoopResult]: For program point L59(lines 59 158) no Hoare annotation was computed. [2019-11-28 16:30:09,491 INFO L246 CegarLoopResult]: For program point L324(lines 324 339) no Hoare annotation was computed. [2019-11-28 16:30:09,491 INFO L246 CegarLoopResult]: For program point L192(lines 192 207) no Hoare annotation was computed. [2019-11-28 16:30:09,492 INFO L246 CegarLoopResult]: For program point L159(lines 159 258) no Hoare annotation was computed. [2019-11-28 16:30:09,492 INFO L246 CegarLoopResult]: For program point L126(lines 126 137) no Hoare annotation was computed. [2019-11-28 16:30:09,492 INFO L246 CegarLoopResult]: For program point L60(lines 60 75) no Hoare annotation was computed. [2019-11-28 16:30:09,492 INFO L246 CegarLoopResult]: For program point L424(lines 424 439) no Hoare annotation was computed. [2019-11-28 16:30:09,492 INFO L246 CegarLoopResult]: For program point L292(lines 292 307) no Hoare annotation was computed. [2019-11-28 16:30:09,492 INFO L246 CegarLoopResult]: For program point L259(lines 259 358) no Hoare annotation was computed. [2019-11-28 16:30:09,493 INFO L246 CegarLoopResult]: For program point L226(lines 226 237) no Hoare annotation was computed. [2019-11-28 16:30:09,493 INFO L246 CegarLoopResult]: For program point L160(lines 160 175) no Hoare annotation was computed. [2019-11-28 16:30:09,493 INFO L246 CegarLoopResult]: For program point L94(lines 94 105) no Hoare annotation was computed. [2019-11-28 16:30:09,493 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:30:09,493 INFO L242 CegarLoopResult]: At program point L557(lines 24 561) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 2)) 2)) 2))) (.cse0 (= ULTIMATE.start_main_~this_buffer_empty~0 0)) (.cse5 (<= ULTIMATE.start_main_~this_expect~0 (+ (* 2 (div (+ ULTIMATE.start_main_~this_expect~0 (- 1)) 2)) 1))) (.cse4 (= ULTIMATE.start_main_~this_buffer_empty~0 1)) (.cse2 (<= 0 (+ ULTIMATE.start_main_~P8~0 2147483648))) (.cse3 (<= ULTIMATE.start_main_~P8~0 2147483647))) (or (and (<= 5 ULTIMATE.start_main_~q~0) .cse0 .cse1 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 1) .cse1 .cse4 .cse2 .cse3) (and (= ULTIMATE.start_main_~q~0 3) .cse0 .cse5 .cse2 .cse3) (and .cse0 (<= 0 ULTIMATE.start_main_~this_expect~0) (<= ULTIMATE.start_main_~this_expect~0 0) (= ULTIMATE.start_main_~q~0 0)) (and .cse5 (= ULTIMATE.start_main_~q~0 4) .cse4 .cse2 .cse3))) [2019-11-28 16:30:09,494 INFO L246 CegarLoopResult]: For program point L524(lines 524 539) no Hoare annotation was computed. [2019-11-28 16:30:09,494 INFO L246 CegarLoopResult]: For program point L392(lines 392 407) no Hoare annotation was computed. [2019-11-28 16:30:09,494 INFO L246 CegarLoopResult]: For program point L359(lines 359 458) no Hoare annotation was computed. [2019-11-28 16:30:09,494 INFO L246 CegarLoopResult]: For program point L326(lines 326 337) no Hoare annotation was computed. [2019-11-28 16:30:09,495 INFO L246 CegarLoopResult]: For program point L260(lines 260 275) no Hoare annotation was computed. [2019-11-28 16:30:09,495 INFO L246 CegarLoopResult]: For program point L194(lines 194 205) no Hoare annotation was computed. [2019-11-28 16:30:09,495 INFO L246 CegarLoopResult]: For program point L62(lines 62 73) no Hoare annotation was computed. [2019-11-28 16:30:09,495 INFO L246 CegarLoopResult]: For program point L492(lines 492 507) no Hoare annotation was computed. [2019-11-28 16:30:09,495 INFO L246 CegarLoopResult]: For program point L459(lines 459 558) no Hoare annotation was computed. [2019-11-28 16:30:09,495 INFO L246 CegarLoopResult]: For program point L426(lines 426 437) no Hoare annotation was computed. [2019-11-28 16:30:09,496 INFO L246 CegarLoopResult]: For program point L360(lines 360 375) no Hoare annotation was computed. [2019-11-28 16:30:09,496 INFO L246 CegarLoopResult]: For program point L294(lines 294 305) no Hoare annotation was computed. [2019-11-28 16:30:09,496 INFO L246 CegarLoopResult]: For program point L162(lines 162 173) no Hoare annotation was computed. [2019-11-28 16:30:09,496 INFO L246 CegarLoopResult]: For program point L526(lines 526 537) no Hoare annotation was computed. [2019-11-28 16:30:09,496 INFO L246 CegarLoopResult]: For program point L460(lines 460 475) no Hoare annotation was computed. [2019-11-28 16:30:09,497 INFO L246 CegarLoopResult]: For program point L394(lines 394 405) no Hoare annotation was computed. [2019-11-28 16:30:09,497 INFO L246 CegarLoopResult]: For program point L262(lines 262 273) no Hoare annotation was computed. [2019-11-28 16:30:09,497 INFO L246 CegarLoopResult]: For program point L130(lines 130 132) no Hoare annotation was computed. [2019-11-28 16:30:09,497 INFO L246 CegarLoopResult]: For program point L494(lines 494 505) no Hoare annotation was computed. [2019-11-28 16:30:09,497 INFO L246 CegarLoopResult]: For program point L362(lines 362 373) no Hoare annotation was computed. [2019-11-28 16:30:09,498 INFO L246 CegarLoopResult]: For program point L230(lines 230 232) no Hoare annotation was computed. [2019-11-28 16:30:09,498 INFO L246 CegarLoopResult]: For program point L98(lines 98 100) no Hoare annotation was computed. [2019-11-28 16:30:09,498 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:30:09,498 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 565) no Hoare annotation was computed. [2019-11-28 16:30:09,498 INFO L246 CegarLoopResult]: For program point L462(lines 462 473) no Hoare annotation was computed. [2019-11-28 16:30:09,499 INFO L246 CegarLoopResult]: For program point L330(lines 330 332) no Hoare annotation was computed. [2019-11-28 16:30:09,499 INFO L246 CegarLoopResult]: For program point L198(lines 198 200) no Hoare annotation was computed. [2019-11-28 16:30:09,499 INFO L246 CegarLoopResult]: For program point L66(lines 66 68) no Hoare annotation was computed. [2019-11-28 16:30:09,499 INFO L246 CegarLoopResult]: For program point L430(lines 430 432) no Hoare annotation was computed. [2019-11-28 16:30:09,499 INFO L246 CegarLoopResult]: For program point L298(lines 298 300) no Hoare annotation was computed. [2019-11-28 16:30:09,500 INFO L246 CegarLoopResult]: For program point L166(lines 166 168) no Hoare annotation was computed. [2019-11-28 16:30:09,500 INFO L246 CegarLoopResult]: For program point L530(lines 530 532) no Hoare annotation was computed. [2019-11-28 16:30:09,501 INFO L246 CegarLoopResult]: For program point L398(lines 398 400) no Hoare annotation was computed. [2019-11-28 16:30:09,501 INFO L246 CegarLoopResult]: For program point L266(lines 266 268) no Hoare annotation was computed. [2019-11-28 16:30:09,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:30:09 BoogieIcfgContainer [2019-11-28 16:30:09,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:30:09,545 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:30:09,545 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:30:09,545 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:30:09,546 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:29:54" (3/4) ... [2019-11-28 16:30:09,551 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:30:09,584 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 16:30:09,585 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 16:30:09,651 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:30:09,651 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:30:09,653 INFO L168 Benchmark]: Toolchain (without parser) took 17177.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.3 MB). Free memory was 955.0 MB in the beginning and 886.2 MB in the end (delta: 68.8 MB). Peak memory consumption was 355.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:09,653 INFO L168 Benchmark]: CDTParser took 0.76 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:09,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:09,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.83 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:09,655 INFO L168 Benchmark]: Boogie Preprocessor took 77.61 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:09,657 INFO L168 Benchmark]: RCFGBuilder took 1056.72 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: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:09,664 INFO L168 Benchmark]: TraceAbstraction took 15330.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.1 GB in the beginning and 886.2 MB in the end (delta: 175.9 MB). Peak memory consumption was 307.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:30:09,664 INFO L168 Benchmark]: Witness Printer took 106.55 ms. Allocated memory is still 1.3 GB. Free memory is still 886.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:30:09,670 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.76 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -176.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.83 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 77.61 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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1056.72 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: 62.9 MB). Peak memory consumption was 62.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 15330.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 131.6 MB). Free memory was 1.1 GB in the beginning and 886.2 MB in the end (delta: 175.9 MB). Peak memory consumption was 307.5 MB. Max. memory is 11.5 GB. * Witness Printer took 106.55 ms. Allocated memory is still 1.3 GB. Free memory is still 886.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 565]: 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: 14]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || ((((q == 1 && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || ((((q == 3 && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -1) / 2) + 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647)) || (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0)) || ((((this_expect <= 2 * ((this_expect + -1) / 2) + 1 && q == 4) && this_buffer_empty == 1) && 0 <= P8 + 2147483648) && P8 <= 2147483647) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: ((((5 <= q && this_buffer_empty == 0) && this_expect <= 2 * ((this_expect + -2) / 2) + 2) && 0 <= P8 + 2147483648) && P8 <= 2147483647) || (((this_buffer_empty == 0 && 0 <= this_expect) && this_expect <= 0) && q == 0) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Result: SAFE, OverallTime: 14.9s, OverallIterations: 15, TraceHistogramMax: 8, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 2279 SDtfs, 1913 SDslu, 5120 SDs, 0 SdLazy, 831 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 375 GetRequests, 306 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 8.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=295occurred in iteration=7, 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, 15 MinimizatonAttempts, 74 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 20 NumberOfFragments, 160 HoareAnnotationTreeSize, 4 FomulaSimplifications, 983 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 257 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 808 NumberOfCodeBlocks, 808 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 787 ConstructedInterpolants, 0 QuantifiedInterpolants, 501405 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2024 ConjunctsInSsa, 121 ConjunctsInUnsatCore, 21 InterpolantComputations, 10 PerfectInterpolantSequences, 215/668 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...