./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.01.cil-2.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 59598ef74ac7afb6c962e2cc2ba26af488759b7c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:27:15,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:27:15,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:27:15,347 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:27:15,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:27:15,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:27:15,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:27:15,352 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:27:15,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:27:15,355 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:27:15,356 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:27:15,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:27:15,358 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:27:15,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:27:15,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:27:15,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:27:15,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:27:15,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:27:15,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:27:15,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:27:15,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:27:15,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:27:15,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:27:15,372 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:27:15,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:27:15,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:27:15,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:27:15,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:27:15,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:27:15,378 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:27:15,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:27:15,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:27:15,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:27:15,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:27:15,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:27:15,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:27:15,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:27:15,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:27:15,383 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:27:15,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:27:15,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:27:15,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:27:15,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:27:15,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:27:15,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:27:15,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:27:15,403 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:27:15,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:27:15,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:27:15,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:27:15,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:27:15,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:27:15,406 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:27:15,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:27:15,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:27:15,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:27:15,408 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:27:15,408 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:27:15,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:27:15,409 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:27:15,409 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:27:15,409 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:27:15,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:27:15,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:27:15,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:27:15,411 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:27:15,411 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:27:15,411 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:27:15,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:27:15,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:27:15,412 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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-11-28 00:27:15,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:27:15,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:27:15,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:27:15,739 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:27:15,739 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:27:15,740 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-28 00:27:15,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0f05372/cde006292c8a4a8cbd6ee7fba93d32c8/FLAG44d7f4847 [2019-11-28 00:27:16,288 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:27:16,288 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-28 00:27:16,299 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0f05372/cde006292c8a4a8cbd6ee7fba93d32c8/FLAG44d7f4847 [2019-11-28 00:27:16,700 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f0f05372/cde006292c8a4a8cbd6ee7fba93d32c8 [2019-11-28 00:27:16,705 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:27:16,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:27:16,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:16,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:27:16,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:27:16,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:16" (1/1) ... [2019-11-28 00:27:16,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:16, skipping insertion in model container [2019-11-28 00:27:16,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:27:16" (1/1) ... [2019-11-28 00:27:16,728 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:27:16,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:27:17,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:17,096 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:27:17,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:27:17,316 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:27:17,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17 WrapperNode [2019-11-28 00:27:17,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:27:17,319 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:17,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:27:17,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:27:17,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,340 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:27:17,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:27:17,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:27:17,379 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:27:17,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,429 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (1/1) ... [2019-11-28 00:27:17,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:27:17,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:27:17,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:27:17,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:27:17,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (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 00:27:17,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:27:17,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:27:18,167 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:27:18,168 INFO L297 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-28 00:27:18,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:18 BoogieIcfgContainer [2019-11-28 00:27:18,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:27:18,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:27:18,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:27:18,178 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:27:18,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:27:16" (1/3) ... [2019-11-28 00:27:18,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7feda61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:18, skipping insertion in model container [2019-11-28 00:27:18,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:27:17" (2/3) ... [2019-11-28 00:27:18,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7feda61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:27:18, skipping insertion in model container [2019-11-28 00:27:18,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:18" (3/3) ... [2019-11-28 00:27:18,185 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-11-28 00:27:18,196 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:27:18,204 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 00:27:18,217 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 00:27:18,262 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:27:18,262 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:27:18,262 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:27:18,263 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:27:18,263 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:27:18,263 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:27:18,263 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:27:18,264 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:27:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-28 00:27:18,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:18,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:18,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:18,299 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:18,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:18,305 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-28 00:27:18,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:18,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098869418] [2019-11-28 00:27:18,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:18,499 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 00:27:18,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098869418] [2019-11-28 00:27:18,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:18,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:18,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253731939] [2019-11-28 00:27:18,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:18,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:18,531 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-28 00:27:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:18,604 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2019-11-28 00:27:18,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:18,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:18,617 INFO L225 Difference]: With dead ends: 291 [2019-11-28 00:27:18,617 INFO L226 Difference]: Without dead ends: 144 [2019-11-28 00:27:18,621 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 00:27:18,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-28 00:27:18,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-28 00:27:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-28 00:27:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-11-28 00:27:18,669 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2019-11-28 00:27:18,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:18,669 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-11-28 00:27:18,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-11-28 00:27:18,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:18,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:18,671 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:18,672 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:18,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:18,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-28 00:27:18,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:18,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791954517] [2019-11-28 00:27:18,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:18,710 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 00:27:18,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791954517] [2019-11-28 00:27:18,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:18,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:18,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227771171] [2019-11-28 00:27:18,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:18,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:18,714 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2019-11-28 00:27:18,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:18,812 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2019-11-28 00:27:18,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:18,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:18,817 INFO L225 Difference]: With dead ends: 384 [2019-11-28 00:27:18,817 INFO L226 Difference]: Without dead ends: 246 [2019-11-28 00:27:18,819 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 00:27:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-28 00:27:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-11-28 00:27:18,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 00:27:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2019-11-28 00:27:18,848 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2019-11-28 00:27:18,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:18,849 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2019-11-28 00:27:18,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2019-11-28 00:27:18,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:18,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:18,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:18,851 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:18,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-28 00:27:18,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:18,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042407661] [2019-11-28 00:27:18,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:18,901 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 00:27:18,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042407661] [2019-11-28 00:27:18,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:18,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:18,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096984665] [2019-11-28 00:27:18,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:18,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:18,905 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2019-11-28 00:27:18,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:18,947 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2019-11-28 00:27:18,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:18,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:18,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:18,950 INFO L225 Difference]: With dead ends: 477 [2019-11-28 00:27:18,950 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 00:27:18,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 00:27:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 00:27:18,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 00:27:18,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 00:27:18,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2019-11-28 00:27:18,978 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2019-11-28 00:27:18,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:18,978 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2019-11-28 00:27:18,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:18,978 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2019-11-28 00:27:18,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:18,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:18,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:18,980 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:18,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:18,981 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-28 00:27:18,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:18,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461935021] [2019-11-28 00:27:18,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:19,050 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 00:27:19,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461935021] [2019-11-28 00:27:19,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:19,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:19,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194461548] [2019-11-28 00:27:19,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:19,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:19,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:19,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:19,053 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2019-11-28 00:27:19,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:19,108 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2019-11-28 00:27:19,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:19,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:19,110 INFO L225 Difference]: With dead ends: 476 [2019-11-28 00:27:19,111 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 00:27:19,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 00:27:19,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 00:27:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 00:27:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 00:27:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2019-11-28 00:27:19,134 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2019-11-28 00:27:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:19,134 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2019-11-28 00:27:19,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2019-11-28 00:27:19,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:19,136 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:19,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:19,136 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:19,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:19,137 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-28 00:27:19,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:19,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295577110] [2019-11-28 00:27:19,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:19,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:19,185 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 00:27:19,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295577110] [2019-11-28 00:27:19,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:19,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:19,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711250332] [2019-11-28 00:27:19,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:19,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:19,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:19,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:19,188 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2019-11-28 00:27:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:19,251 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2019-11-28 00:27:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:19,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:19,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:19,254 INFO L225 Difference]: With dead ends: 475 [2019-11-28 00:27:19,254 INFO L226 Difference]: Without dead ends: 242 [2019-11-28 00:27:19,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 00:27:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-28 00:27:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-28 00:27:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-28 00:27:19,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2019-11-28 00:27:19,274 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2019-11-28 00:27:19,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:19,275 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2019-11-28 00:27:19,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2019-11-28 00:27:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-28 00:27:19,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:19,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:19,278 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:19,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:19,278 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-28 00:27:19,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:19,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393984184] [2019-11-28 00:27:19,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:19,348 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 00:27:19,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393984184] [2019-11-28 00:27:19,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:19,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:27:19,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809217753] [2019-11-28 00:27:19,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:19,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:19,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:19,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:19,353 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2019-11-28 00:27:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:19,424 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2019-11-28 00:27:19,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:19,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-28 00:27:19,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:19,428 INFO L225 Difference]: With dead ends: 662 [2019-11-28 00:27:19,428 INFO L226 Difference]: Without dead ends: 431 [2019-11-28 00:27:19,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 00:27:19,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-28 00:27:19,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2019-11-28 00:27:19,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-28 00:27:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2019-11-28 00:27:19,457 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2019-11-28 00:27:19,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:19,457 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2019-11-28 00:27:19,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:19,458 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2019-11-28 00:27:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:27:19,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:19,460 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:19,461 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:19,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:19,461 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2019-11-28 00:27:19,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:19,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455373112] [2019-11-28 00:27:19,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:19,576 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:19,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455373112] [2019-11-28 00:27:19,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:19,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:27:19,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127347835] [2019-11-28 00:27:19,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:27:19,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:19,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:27:19,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:19,586 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2019-11-28 00:27:19,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:19,745 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2019-11-28 00:27:19,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:27:19,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-28 00:27:19,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:19,751 INFO L225 Difference]: With dead ends: 985 [2019-11-28 00:27:19,751 INFO L226 Difference]: Without dead ends: 593 [2019-11-28 00:27:19,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:27:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-11-28 00:27:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2019-11-28 00:27:19,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-28 00:27:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2019-11-28 00:27:19,793 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2019-11-28 00:27:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:19,793 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2019-11-28 00:27:19,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:27:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2019-11-28 00:27:19,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:27:19,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:19,795 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:19,796 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:19,797 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2019-11-28 00:27:19,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:19,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367211327] [2019-11-28 00:27:19,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:19,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367211327] [2019-11-28 00:27:19,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:19,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:19,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658687247] [2019-11-28 00:27:19,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:19,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:19,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:19,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:19,906 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2019-11-28 00:27:20,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:20,000 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2019-11-28 00:27:20,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:20,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-28 00:27:20,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:20,007 INFO L225 Difference]: With dead ends: 1143 [2019-11-28 00:27:20,007 INFO L226 Difference]: Without dead ends: 747 [2019-11-28 00:27:20,008 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 00:27:20,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-28 00:27:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2019-11-28 00:27:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-28 00:27:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2019-11-28 00:27:20,061 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2019-11-28 00:27:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:20,062 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2019-11-28 00:27:20,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:20,062 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2019-11-28 00:27:20,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:27:20,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:20,064 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:20,064 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:20,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:20,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2019-11-28 00:27:20,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:20,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310207882] [2019-11-28 00:27:20,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:20,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:20,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310207882] [2019-11-28 00:27:20,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:20,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:27:20,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339421460] [2019-11-28 00:27:20,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:27:20,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:27:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:27:20,147 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2019-11-28 00:27:20,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:20,318 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2019-11-28 00:27:20,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:27:20,319 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-28 00:27:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:20,324 INFO L225 Difference]: With dead ends: 1617 [2019-11-28 00:27:20,324 INFO L226 Difference]: Without dead ends: 923 [2019-11-28 00:27:20,326 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:27:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-11-28 00:27:20,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2019-11-28 00:27:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-28 00:27:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2019-11-28 00:27:20,387 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2019-11-28 00:27:20,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:20,411 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2019-11-28 00:27:20,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:27:20,411 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2019-11-28 00:27:20,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 00:27:20,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:20,412 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:20,413 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:20,414 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2019-11-28 00:27:20,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:20,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057939963] [2019-11-28 00:27:20,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:20,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057939963] [2019-11-28 00:27:20,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:20,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:20,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790043720] [2019-11-28 00:27:20,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:20,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:20,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:20,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:20,471 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2019-11-28 00:27:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:20,582 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2019-11-28 00:27:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:20,585 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-28 00:27:20,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:20,592 INFO L225 Difference]: With dead ends: 2017 [2019-11-28 00:27:20,592 INFO L226 Difference]: Without dead ends: 1321 [2019-11-28 00:27:20,594 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 00:27:20,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-11-28 00:27:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2019-11-28 00:27:20,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-11-28 00:27:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2019-11-28 00:27:20,683 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2019-11-28 00:27:20,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:20,685 INFO L462 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2019-11-28 00:27:20,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2019-11-28 00:27:20,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-28 00:27:20,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:20,687 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:20,688 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:20,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:20,688 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2019-11-28 00:27:20,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:20,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736283670] [2019-11-28 00:27:20,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:20,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:20,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736283670] [2019-11-28 00:27:20,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:20,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:20,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951473464] [2019-11-28 00:27:20,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:20,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:20,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:20,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:20,738 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2019-11-28 00:27:20,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:20,911 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2019-11-28 00:27:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:20,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-28 00:27:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:20,924 INFO L225 Difference]: With dead ends: 3670 [2019-11-28 00:27:20,924 INFO L226 Difference]: Without dead ends: 1847 [2019-11-28 00:27:20,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:20,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-11-28 00:27:21,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2019-11-28 00:27:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-11-28 00:27:21,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2019-11-28 00:27:21,053 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2019-11-28 00:27:21,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:21,054 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2019-11-28 00:27:21,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:21,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2019-11-28 00:27:21,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 00:27:21,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,057 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,062 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2019-11-28 00:27:21,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703770487] [2019-11-28 00:27:21,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-28 00:27:21,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703770487] [2019-11-28 00:27:21,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:21,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:21,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288438250] [2019-11-28 00:27:21,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:21,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,111 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2019-11-28 00:27:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:21,234 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2019-11-28 00:27:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:21,234 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-28 00:27:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:21,247 INFO L225 Difference]: With dead ends: 3621 [2019-11-28 00:27:21,248 INFO L226 Difference]: Without dead ends: 1799 [2019-11-28 00:27:21,252 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 00:27:21,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-11-28 00:27:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2019-11-28 00:27:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2019-11-28 00:27:21,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2019-11-28 00:27:21,407 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2019-11-28 00:27:21,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:21,408 INFO L462 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2019-11-28 00:27:21,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2019-11-28 00:27:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 00:27:21,421 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,421 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,422 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,423 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2019-11-28 00:27:21,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311404046] [2019-11-28 00:27:21,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:21,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 00:27:21,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311404046] [2019-11-28 00:27:21,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:21,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:21,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719637131] [2019-11-28 00:27:21,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:21,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:21,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:21,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,492 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2019-11-28 00:27:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:21,667 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2019-11-28 00:27:21,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:21,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-28 00:27:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:21,673 INFO L225 Difference]: With dead ends: 3078 [2019-11-28 00:27:21,674 INFO L226 Difference]: Without dead ends: 724 [2019-11-28 00:27:21,680 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 00:27:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-28 00:27:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-11-28 00:27:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-28 00:27:21,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2019-11-28 00:27:21,748 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2019-11-28 00:27:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:21,749 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2019-11-28 00:27:21,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2019-11-28 00:27:21,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-28 00:27:21,754 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,754 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,755 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2019-11-28 00:27:21,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652485884] [2019-11-28 00:27:21,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:27:21,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652485884] [2019-11-28 00:27:21,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:21,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:21,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679894022] [2019-11-28 00:27:21,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:21,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:21,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:21,862 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2019-11-28 00:27:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:21,923 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2019-11-28 00:27:21,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:21,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-28 00:27:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:21,928 INFO L225 Difference]: With dead ends: 1048 [2019-11-28 00:27:21,928 INFO L226 Difference]: Without dead ends: 594 [2019-11-28 00:27:21,930 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 00:27:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-28 00:27:21,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-11-28 00:27:21,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-28 00:27:21,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2019-11-28 00:27:21,970 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2019-11-28 00:27:21,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:21,970 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2019-11-28 00:27:21,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:21,970 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2019-11-28 00:27:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-28 00:27:21,972 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:21,973 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:21,973 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:21,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2019-11-28 00:27:21,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:21,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042007456] [2019-11-28 00:27:21,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,078 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-28 00:27:22,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042007456] [2019-11-28 00:27:22,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:27:22,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656489449] [2019-11-28 00:27:22,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:27:22,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:27:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:27:22,081 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2019-11-28 00:27:22,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:22,138 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2019-11-28 00:27:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:27:22,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-28 00:27:22,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:22,142 INFO L225 Difference]: With dead ends: 598 [2019-11-28 00:27:22,142 INFO L226 Difference]: Without dead ends: 596 [2019-11-28 00:27:22,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:27:22,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-28 00:27:22,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2019-11-28 00:27:22,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-28 00:27:22,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2019-11-28 00:27:22,185 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2019-11-28 00:27:22,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:22,186 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2019-11-28 00:27:22,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:27:22,186 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2019-11-28 00:27:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 00:27:22,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:22,188 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:22,188 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:22,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:22,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2019-11-28 00:27:22,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:22,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499236665] [2019-11-28 00:27:22,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:27:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 00:27:22,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499236665] [2019-11-28 00:27:22,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:27:22,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:27:22,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982610082] [2019-11-28 00:27:22,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:27:22,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:27:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:27:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:27:22,233 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2019-11-28 00:27:22,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:27:22,303 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2019-11-28 00:27:22,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:27:22,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 00:27:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:27:22,309 INFO L225 Difference]: With dead ends: 1230 [2019-11-28 00:27:22,309 INFO L226 Difference]: Without dead ends: 900 [2019-11-28 00:27:22,311 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 00:27:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-11-28 00:27:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2019-11-28 00:27:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-28 00:27:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2019-11-28 00:27:22,354 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2019-11-28 00:27:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:27:22,354 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2019-11-28 00:27:22,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:27:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2019-11-28 00:27:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 00:27:22,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:27:22,357 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:27:22,357 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:27:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:27:22,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2019-11-28 00:27:22,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:27:22,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177387022] [2019-11-28 00:27:22,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:27:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:27:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 00:27:22,461 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 00:27:22,461 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 00:27:22,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:27:22 BoogieIcfgContainer [2019-11-28 00:27:22,623 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:27:22,624 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:27:22,624 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:27:22,625 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:27:22,625 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:27:18" (3/4) ... [2019-11-28 00:27:22,629 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 00:27:22,814 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:27:22,814 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:27:22,817 INFO L168 Benchmark]: Toolchain (without parser) took 6109.94 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -150.7 MB). Peak memory consumption was 168.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:22,818 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:27:22,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 608.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:22,820 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.63 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 00:27:22,820 INFO L168 Benchmark]: Boogie Preprocessor took 58.78 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:22,820 INFO L168 Benchmark]: RCFGBuilder took 732.77 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: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:22,821 INFO L168 Benchmark]: TraceAbstraction took 4450.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.0 MB). Peak memory consumption was 138.1 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:22,821 INFO L168 Benchmark]: Witness Printer took 190.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-11-28 00:27:22,825 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 608.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.63 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 58.78 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 732.77 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: 38.0 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4450.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -26.0 MB). Peak memory consumption was 138.1 MB. Max. memory is 11.5 GB. * Witness Printer took 190.70 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L45] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L64] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Result: UNSAFE, OverallTime: 4.2s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 125079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 191/191 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 incorrect! Received shutdown request...