./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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.02.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a08b839794d511e255b2cbb9b4715d014c32f56d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-25 23:14:19,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:14:19,033 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:14:19,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:14:19,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:14:19,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:14:19,072 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:14:19,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:14:19,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:14:19,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:14:19,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:14:19,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:14:19,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:14:19,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:14:19,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:14:19,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:14:19,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:14:19,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:14:19,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:14:19,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:14:19,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:14:19,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:14:19,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:14:19,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:14:19,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:14:19,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:14:19,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:14:19,123 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:14:19,126 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:14:19,128 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:14:19,128 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:14:19,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:14:19,132 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:14:19,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:14:19,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:14:19,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:14:19,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:14:19,140 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:14:19,140 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:14:19,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:14:19,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:14:19,145 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:14:19,200 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:14:19,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:14:19,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:14:19,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:14:19,204 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:14:19,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:14:19,205 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:14:19,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:14:19,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:14:19,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:14:19,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:14:19,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:14:19,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:14:19,208 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:14:19,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:14:19,208 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:14:19,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:14:19,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:14:19,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:14:19,209 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:14:19,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:14:19,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:14:19,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:14:19,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:14:19,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:14:19,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:14:19,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:14:19,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:14:19,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:14:19,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> a08b839794d511e255b2cbb9b4715d014c32f56d [2020-10-25 23:14:19,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:14:19,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:14:19,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:14:19,674 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:14:19,675 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:14:19,676 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-10-25 23:14:19,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b47c2989/a75f659bf3ad4976b25b43bb85f74cc0/FLAG81ff03f27 [2020-10-25 23:14:20,372 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:14:20,374 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-10-25 23:14:20,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b47c2989/a75f659bf3ad4976b25b43bb85f74cc0/FLAG81ff03f27 [2020-10-25 23:14:20,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b47c2989/a75f659bf3ad4976b25b43bb85f74cc0 [2020-10-25 23:14:20,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:14:20,683 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:14:20,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:14:20,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:14:20,689 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:14:20,691 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:14:20" (1/1) ... [2020-10-25 23:14:20,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e421318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:20, skipping insertion in model container [2020-10-25 23:14:20,701 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:14:20" (1/1) ... [2020-10-25 23:14:20,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:14:20,775 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:14:21,029 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:14:21,040 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:14:21,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:14:21,117 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:14:21,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21 WrapperNode [2020-10-25 23:14:21,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:14:21,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:14:21,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:14:21,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:14:21,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,139 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,192 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:14:21,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:14:21,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:14:21,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:14:21,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,213 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,213 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,225 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (1/1) ... [2020-10-25 23:14:21,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:14:21,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:14:21,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:14:21,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:14:21,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (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 [2020-10-25 23:14:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:14:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:14:21,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:14:21,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:14:22,320 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:14:22,320 INFO L298 CfgBuilder]: Removed 109 assume(true) statements. [2020-10-25 23:14:22,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:14:22 BoogieIcfgContainer [2020-10-25 23:14:22,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:14:22,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:14:22,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:14:22,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:14:22,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:14:20" (1/3) ... [2020-10-25 23:14:22,329 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125b0177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:14:22, skipping insertion in model container [2020-10-25 23:14:22,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:14:21" (2/3) ... [2020-10-25 23:14:22,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@125b0177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:14:22, skipping insertion in model container [2020-10-25 23:14:22,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:14:22" (3/3) ... [2020-10-25 23:14:22,331 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-10-25 23:14:22,344 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:14:22,349 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-25 23:14:22,364 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-25 23:14:22,400 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:14:22,401 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:14:22,401 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:14:22,403 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:14:22,403 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:14:22,403 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:14:22,403 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:14:22,404 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:14:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2020-10-25 23:14:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:22,456 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:22,457 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:22,458 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:22,465 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2020-10-25 23:14:22,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:22,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313522753] [2020-10-25 23:14:22,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:22,701 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313522753] [2020-10-25 23:14:22,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:22,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:22,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5712819] [2020-10-25 23:14:22,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:22,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:22,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:22,727 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2020-10-25 23:14:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:22,806 INFO L93 Difference]: Finished difference Result 447 states and 699 transitions. [2020-10-25 23:14:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:22,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-25 23:14:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:22,827 INFO L225 Difference]: With dead ends: 447 [2020-10-25 23:14:22,828 INFO L226 Difference]: Without dead ends: 221 [2020-10-25 23:14:22,840 INFO L677 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 [2020-10-25 23:14:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-10-25 23:14:22,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-10-25 23:14:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-10-25 23:14:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2020-10-25 23:14:22,926 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2020-10-25 23:14:22,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:22,927 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2020-10-25 23:14:22,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:22,927 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2020-10-25 23:14:22,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:22,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:22,931 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:22,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:14:22,932 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2020-10-25 23:14:22,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:22,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761146149] [2020-10-25 23:14:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:23,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761146149] [2020-10-25 23:14:23,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:23,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:23,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094128030] [2020-10-25 23:14:23,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:23,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:23,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:23,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:23,024 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2020-10-25 23:14:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:23,095 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2020-10-25 23:14:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:23,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-25 23:14:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:23,100 INFO L225 Difference]: With dead ends: 595 [2020-10-25 23:14:23,100 INFO L226 Difference]: Without dead ends: 381 [2020-10-25 23:14:23,102 INFO L677 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 [2020-10-25 23:14:23,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-10-25 23:14:23,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2020-10-25 23:14:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-25 23:14:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2020-10-25 23:14:23,162 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2020-10-25 23:14:23,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:23,167 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2020-10-25 23:14:23,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2020-10-25 23:14:23,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:23,169 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:23,170 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:23,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:14:23,172 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:23,173 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2020-10-25 23:14:23,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:23,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462095315] [2020-10-25 23:14:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:23,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462095315] [2020-10-25 23:14:23,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:23,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:23,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967981326] [2020-10-25 23:14:23,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:23,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:23,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:23,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:23,291 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 4 states. [2020-10-25 23:14:23,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:23,387 INFO L93 Difference]: Finished difference Result 905 states and 1366 transitions. [2020-10-25 23:14:23,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:23,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-25 23:14:23,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:23,392 INFO L225 Difference]: With dead ends: 905 [2020-10-25 23:14:23,392 INFO L226 Difference]: Without dead ends: 536 [2020-10-25 23:14:23,395 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-10-25 23:14:23,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 377. [2020-10-25 23:14:23,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-25 23:14:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 567 transitions. [2020-10-25 23:14:23,441 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 567 transitions. Word has length 50 [2020-10-25 23:14:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:23,441 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 567 transitions. [2020-10-25 23:14:23,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:23,442 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 567 transitions. [2020-10-25 23:14:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:23,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:23,444 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:23,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 23:14:23,444 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash -794624073, now seen corresponding path program 1 times [2020-10-25 23:14:23,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:23,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682279891] [2020-10-25 23:14:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:23,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:23,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682279891] [2020-10-25 23:14:23,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:23,500 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:23,500 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483009283] [2020-10-25 23:14:23,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:23,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:23,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:23,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:23,502 INFO L87 Difference]: Start difference. First operand 377 states and 567 transitions. Second operand 4 states. [2020-10-25 23:14:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:23,599 INFO L93 Difference]: Finished difference Result 903 states and 1356 transitions. [2020-10-25 23:14:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:23,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-25 23:14:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:23,603 INFO L225 Difference]: With dead ends: 903 [2020-10-25 23:14:23,604 INFO L226 Difference]: Without dead ends: 535 [2020-10-25 23:14:23,605 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-10-25 23:14:23,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-10-25 23:14:23,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-25 23:14:23,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2020-10-25 23:14:23,629 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 50 [2020-10-25 23:14:23,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:23,630 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2020-10-25 23:14:23,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:23,630 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2020-10-25 23:14:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:23,632 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:23,632 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:23,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 23:14:23,632 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash -546477579, now seen corresponding path program 1 times [2020-10-25 23:14:23,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:23,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208681015] [2020-10-25 23:14:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:23,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:23,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208681015] [2020-10-25 23:14:23,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:23,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:23,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917455158] [2020-10-25 23:14:23,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:23,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:23,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:23,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:23,700 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand 3 states. [2020-10-25 23:14:23,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:23,766 INFO L93 Difference]: Finished difference Result 744 states and 1115 transitions. [2020-10-25 23:14:23,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:23,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-25 23:14:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:23,771 INFO L225 Difference]: With dead ends: 744 [2020-10-25 23:14:23,771 INFO L226 Difference]: Without dead ends: 377 [2020-10-25 23:14:23,772 INFO L677 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 [2020-10-25 23:14:23,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-25 23:14:23,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-25 23:14:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-25 23:14:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 548 transitions. [2020-10-25 23:14:23,804 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 548 transitions. Word has length 50 [2020-10-25 23:14:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:23,806 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 548 transitions. [2020-10-25 23:14:23,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:23,806 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 548 transitions. [2020-10-25 23:14:23,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:23,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:23,812 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:23,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 23:14:23,812 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:23,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:23,815 INFO L82 PathProgramCache]: Analyzing trace with hash -585918790, now seen corresponding path program 1 times [2020-10-25 23:14:23,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:23,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128654658] [2020-10-25 23:14:23,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:23,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128654658] [2020-10-25 23:14:23,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:23,897 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:23,897 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751597389] [2020-10-25 23:14:23,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:23,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:23,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:23,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:23,899 INFO L87 Difference]: Start difference. First operand 377 states and 548 transitions. Second operand 4 states. [2020-10-25 23:14:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:24,011 INFO L93 Difference]: Finished difference Result 878 states and 1277 transitions. [2020-10-25 23:14:24,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:24,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-25 23:14:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:24,014 INFO L225 Difference]: With dead ends: 878 [2020-10-25 23:14:24,014 INFO L226 Difference]: Without dead ends: 512 [2020-10-25 23:14:24,015 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-10-25 23:14:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 377. [2020-10-25 23:14:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-25 23:14:24,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 545 transitions. [2020-10-25 23:14:24,046 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 545 transitions. Word has length 50 [2020-10-25 23:14:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:24,050 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 545 transitions. [2020-10-25 23:14:24,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2020-10-25 23:14:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:24,051 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:24,051 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:24,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 23:14:24,052 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:24,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:24,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1957726088, now seen corresponding path program 1 times [2020-10-25 23:14:24,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:24,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753944619] [2020-10-25 23:14:24,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:24,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:24,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753944619] [2020-10-25 23:14:24,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:24,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:24,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514361387] [2020-10-25 23:14:24,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:24,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:24,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:24,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:24,094 INFO L87 Difference]: Start difference. First operand 377 states and 545 transitions. Second operand 3 states. [2020-10-25 23:14:24,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:24,151 INFO L93 Difference]: Finished difference Result 742 states and 1075 transitions. [2020-10-25 23:14:24,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:24,152 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-10-25 23:14:24,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:24,154 INFO L225 Difference]: With dead ends: 742 [2020-10-25 23:14:24,154 INFO L226 Difference]: Without dead ends: 377 [2020-10-25 23:14:24,155 INFO L677 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 [2020-10-25 23:14:24,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-25 23:14:24,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-25 23:14:24,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-25 23:14:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 529 transitions. [2020-10-25 23:14:24,180 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 529 transitions. Word has length 50 [2020-10-25 23:14:24,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:24,180 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 529 transitions. [2020-10-25 23:14:24,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 529 transitions. [2020-10-25 23:14:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:24,181 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:24,181 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:24,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-25 23:14:24,181 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:24,182 INFO L82 PathProgramCache]: Analyzing trace with hash -787989636, now seen corresponding path program 1 times [2020-10-25 23:14:24,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:24,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942119077] [2020-10-25 23:14:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:24,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:24,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942119077] [2020-10-25 23:14:24,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:24,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:14:24,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839152698] [2020-10-25 23:14:24,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:14:24,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:14:24,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:24,231 INFO L87 Difference]: Start difference. First operand 377 states and 529 transitions. Second operand 5 states. [2020-10-25 23:14:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:24,365 INFO L93 Difference]: Finished difference Result 981 states and 1389 transitions. [2020-10-25 23:14:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:14:24,365 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-10-25 23:14:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:24,369 INFO L225 Difference]: With dead ends: 981 [2020-10-25 23:14:24,369 INFO L226 Difference]: Without dead ends: 623 [2020-10-25 23:14:24,370 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:14:24,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-10-25 23:14:24,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 383. [2020-10-25 23:14:24,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-10-25 23:14:24,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 527 transitions. [2020-10-25 23:14:24,400 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 527 transitions. Word has length 50 [2020-10-25 23:14:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:24,401 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 527 transitions. [2020-10-25 23:14:24,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:14:24,401 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 527 transitions. [2020-10-25 23:14:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-25 23:14:24,402 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:24,402 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:24,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-25 23:14:24,402 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:24,403 INFO L82 PathProgramCache]: Analyzing trace with hash -860376194, now seen corresponding path program 1 times [2020-10-25 23:14:24,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:24,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994906390] [2020-10-25 23:14:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:24,442 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994906390] [2020-10-25 23:14:24,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:24,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:24,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86602320] [2020-10-25 23:14:24,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:24,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:24,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:24,444 INFO L87 Difference]: Start difference. First operand 383 states and 527 transitions. Second operand 4 states. [2020-10-25 23:14:24,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:24,679 INFO L93 Difference]: Finished difference Result 1331 states and 1833 transitions. [2020-10-25 23:14:24,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:24,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-10-25 23:14:24,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:24,686 INFO L225 Difference]: With dead ends: 1331 [2020-10-25 23:14:24,686 INFO L226 Difference]: Without dead ends: 962 [2020-10-25 23:14:24,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-10-25 23:14:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 886. [2020-10-25 23:14:24,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2020-10-25 23:14:24,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1204 transitions. [2020-10-25 23:14:24,785 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1204 transitions. Word has length 50 [2020-10-25 23:14:24,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:24,786 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1204 transitions. [2020-10-25 23:14:24,786 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1204 transitions. [2020-10-25 23:14:24,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-25 23:14:24,787 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:24,788 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:14:24,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:14:24,792 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:24,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:24,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1987821321, now seen corresponding path program 1 times [2020-10-25 23:14:24,793 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:24,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437047258] [2020-10-25 23:14:24,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-25 23:14:24,897 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437047258] [2020-10-25 23:14:24,897 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:24,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:14:24,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509955415] [2020-10-25 23:14:24,898 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:14:24,898 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:24,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:14:24,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:24,901 INFO L87 Difference]: Start difference. First operand 886 states and 1204 transitions. Second operand 5 states. [2020-10-25 23:14:25,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:25,157 INFO L93 Difference]: Finished difference Result 2286 states and 3127 transitions. [2020-10-25 23:14:25,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:14:25,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-10-25 23:14:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:25,170 INFO L225 Difference]: With dead ends: 2286 [2020-10-25 23:14:25,170 INFO L226 Difference]: Without dead ends: 1424 [2020-10-25 23:14:25,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:14:25,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-10-25 23:14:25,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2020-10-25 23:14:25,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-10-25 23:14:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1218 transitions. [2020-10-25 23:14:25,264 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1218 transitions. Word has length 63 [2020-10-25 23:14:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:25,264 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1218 transitions. [2020-10-25 23:14:25,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:14:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1218 transitions. [2020-10-25 23:14:25,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-25 23:14:25,265 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:25,266 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:14:25,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-25 23:14:25,268 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:25,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:25,268 INFO L82 PathProgramCache]: Analyzing trace with hash 616014023, now seen corresponding path program 1 times [2020-10-25 23:14:25,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:25,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737055804] [2020-10-25 23:14:25,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-25 23:14:25,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737055804] [2020-10-25 23:14:25,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:25,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:25,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244417151] [2020-10-25 23:14:25,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:25,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:25,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:25,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:25,332 INFO L87 Difference]: Start difference. First operand 913 states and 1218 transitions. Second operand 4 states. [2020-10-25 23:14:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:25,498 INFO L93 Difference]: Finished difference Result 2185 states and 2919 transitions. [2020-10-25 23:14:25,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:25,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-25 23:14:25,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:25,505 INFO L225 Difference]: With dead ends: 2185 [2020-10-25 23:14:25,506 INFO L226 Difference]: Without dead ends: 1305 [2020-10-25 23:14:25,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-10-25 23:14:25,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-10-25 23:14:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-10-25 23:14:25,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1205 transitions. [2020-10-25 23:14:25,588 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1205 transitions. Word has length 63 [2020-10-25 23:14:25,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:25,589 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1205 transitions. [2020-10-25 23:14:25,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:25,589 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1205 transitions. [2020-10-25 23:14:25,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-25 23:14:25,590 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:25,590 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:14:25,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-25 23:14:25,591 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:25,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:25,591 INFO L82 PathProgramCache]: Analyzing trace with hash 890773637, now seen corresponding path program 1 times [2020-10-25 23:14:25,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:25,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124304119] [2020-10-25 23:14:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-10-25 23:14:25,637 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124304119] [2020-10-25 23:14:25,637 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:25,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:25,638 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645857902] [2020-10-25 23:14:25,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:25,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:25,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:25,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:25,639 INFO L87 Difference]: Start difference. First operand 913 states and 1205 transitions. Second operand 4 states. [2020-10-25 23:14:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:25,811 INFO L93 Difference]: Finished difference Result 2184 states and 2889 transitions. [2020-10-25 23:14:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 23:14:25,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-10-25 23:14:25,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:25,819 INFO L225 Difference]: With dead ends: 2184 [2020-10-25 23:14:25,819 INFO L226 Difference]: Without dead ends: 1305 [2020-10-25 23:14:25,824 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-10-25 23:14:25,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-10-25 23:14:25,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-10-25 23:14:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1192 transitions. [2020-10-25 23:14:25,922 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1192 transitions. Word has length 63 [2020-10-25 23:14:25,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:25,923 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1192 transitions. [2020-10-25 23:14:25,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1192 transitions. [2020-10-25 23:14:25,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-25 23:14:25,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:25,924 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:14:25,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-25 23:14:25,925 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:25,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1592373511, now seen corresponding path program 1 times [2020-10-25 23:14:25,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:25,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894273671] [2020-10-25 23:14:25,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:25,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894273671] [2020-10-25 23:14:25,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:25,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:25,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032661623] [2020-10-25 23:14:25,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:25,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:25,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:25,980 INFO L87 Difference]: Start difference. First operand 913 states and 1192 transitions. Second operand 3 states. [2020-10-25 23:14:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:26,159 INFO L93 Difference]: Finished difference Result 2514 states and 3253 transitions. [2020-10-25 23:14:26,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:26,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-10-25 23:14:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:26,168 INFO L225 Difference]: With dead ends: 2514 [2020-10-25 23:14:26,168 INFO L226 Difference]: Without dead ends: 1638 [2020-10-25 23:14:26,170 INFO L677 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 [2020-10-25 23:14:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2020-10-25 23:14:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2020-10-25 23:14:26,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2020-10-25 23:14:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2079 transitions. [2020-10-25 23:14:26,333 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2079 transitions. Word has length 63 [2020-10-25 23:14:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:26,333 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2079 transitions. [2020-10-25 23:14:26,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2020-10-25 23:14:26,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-25 23:14:26,335 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:26,335 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:14:26,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-25 23:14:26,335 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1604417796, now seen corresponding path program 1 times [2020-10-25 23:14:26,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:26,336 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158208339] [2020-10-25 23:14:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:26,384 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:26,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158208339] [2020-10-25 23:14:26,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:26,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:26,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249341569] [2020-10-25 23:14:26,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:26,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:26,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:26,386 INFO L87 Difference]: Start difference. First operand 1638 states and 2079 transitions. Second operand 3 states. [2020-10-25 23:14:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:26,725 INFO L93 Difference]: Finished difference Result 4524 states and 5739 transitions. [2020-10-25 23:14:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:26,725 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-10-25 23:14:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:26,741 INFO L225 Difference]: With dead ends: 4524 [2020-10-25 23:14:26,742 INFO L226 Difference]: Without dead ends: 2956 [2020-10-25 23:14:26,747 INFO L677 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 [2020-10-25 23:14:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-10-25 23:14:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2020-10-25 23:14:26,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2020-10-25 23:14:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3671 transitions. [2020-10-25 23:14:26,992 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3671 transitions. Word has length 64 [2020-10-25 23:14:26,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:26,993 INFO L481 AbstractCegarLoop]: Abstraction has 2916 states and 3671 transitions. [2020-10-25 23:14:26,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:26,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3671 transitions. [2020-10-25 23:14:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-25 23:14:26,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:26,995 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:14:26,996 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-25 23:14:26,996 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:26,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1043718018, now seen corresponding path program 1 times [2020-10-25 23:14:26,997 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:26,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281190076] [2020-10-25 23:14:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 23:14:27,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281190076] [2020-10-25 23:14:27,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:27,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:27,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876426554] [2020-10-25 23:14:27,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:27,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:27,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:27,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:27,017 INFO L87 Difference]: Start difference. First operand 2916 states and 3671 transitions. Second operand 3 states. [2020-10-25 23:14:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:27,248 INFO L93 Difference]: Finished difference Result 5712 states and 7209 transitions. [2020-10-25 23:14:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:27,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-10-25 23:14:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:27,262 INFO L225 Difference]: With dead ends: 5712 [2020-10-25 23:14:27,262 INFO L226 Difference]: Without dead ends: 2854 [2020-10-25 23:14:27,268 INFO L677 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 [2020-10-25 23:14:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2020-10-25 23:14:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2020-10-25 23:14:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2020-10-25 23:14:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3601 transitions. [2020-10-25 23:14:27,544 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3601 transitions. Word has length 64 [2020-10-25 23:14:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:27,545 INFO L481 AbstractCegarLoop]: Abstraction has 2854 states and 3601 transitions. [2020-10-25 23:14:27,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3601 transitions. [2020-10-25 23:14:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-25 23:14:27,547 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:27,547 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-25 23:14:27,547 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-25 23:14:27,547 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:27,548 INFO L82 PathProgramCache]: Analyzing trace with hash -691732721, now seen corresponding path program 1 times [2020-10-25 23:14:27,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:27,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505234322] [2020-10-25 23:14:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 23:14:27,606 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505234322] [2020-10-25 23:14:27,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:27,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:27,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241339620] [2020-10-25 23:14:27,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:27,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:27,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:27,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:27,610 INFO L87 Difference]: Start difference. First operand 2854 states and 3601 transitions. Second operand 3 states. [2020-10-25 23:14:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:28,102 INFO L93 Difference]: Finished difference Result 6838 states and 8679 transitions. [2020-10-25 23:14:28,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:28,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-10-25 23:14:28,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:28,124 INFO L225 Difference]: With dead ends: 6838 [2020-10-25 23:14:28,124 INFO L226 Difference]: Without dead ends: 4770 [2020-10-25 23:14:28,128 INFO L677 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 [2020-10-25 23:14:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2020-10-25 23:14:28,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3882. [2020-10-25 23:14:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3882 states. [2020-10-25 23:14:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4899 transitions. [2020-10-25 23:14:28,466 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4899 transitions. Word has length 65 [2020-10-25 23:14:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:28,467 INFO L481 AbstractCegarLoop]: Abstraction has 3882 states and 4899 transitions. [2020-10-25 23:14:28,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4899 transitions. [2020-10-25 23:14:28,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-25 23:14:28,469 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:28,469 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:28,470 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-25 23:14:28,470 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:28,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:28,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1437461722, now seen corresponding path program 1 times [2020-10-25 23:14:28,471 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:28,471 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835711044] [2020-10-25 23:14:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:28,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835711044] [2020-10-25 23:14:28,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:28,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:14:28,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826218747] [2020-10-25 23:14:28,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:14:28,518 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:28,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:14:28,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:28,519 INFO L87 Difference]: Start difference. First operand 3882 states and 4899 transitions. Second operand 5 states. [2020-10-25 23:14:29,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:29,090 INFO L93 Difference]: Finished difference Result 9686 states and 12267 transitions. [2020-10-25 23:14:29,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 23:14:29,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-10-25 23:14:29,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:29,117 INFO L225 Difference]: With dead ends: 9686 [2020-10-25 23:14:29,117 INFO L226 Difference]: Without dead ends: 5862 [2020-10-25 23:14:29,124 INFO L677 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 [2020-10-25 23:14:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2020-10-25 23:14:29,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3930. [2020-10-25 23:14:29,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3930 states. [2020-10-25 23:14:29,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 4873 transitions. [2020-10-25 23:14:29,540 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 4873 transitions. Word has length 82 [2020-10-25 23:14:29,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:29,541 INFO L481 AbstractCegarLoop]: Abstraction has 3930 states and 4873 transitions. [2020-10-25 23:14:29,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:14:29,541 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 4873 transitions. [2020-10-25 23:14:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-10-25 23:14:29,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:29,544 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:29,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-25 23:14:29,544 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:29,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:29,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1269157672, now seen corresponding path program 1 times [2020-10-25 23:14:29,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:29,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219488947] [2020-10-25 23:14:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:29,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:29,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219488947] [2020-10-25 23:14:29,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:29,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:29,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610581864] [2020-10-25 23:14:29,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:29,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:29,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:29,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:29,601 INFO L87 Difference]: Start difference. First operand 3930 states and 4873 transitions. Second operand 3 states. [2020-10-25 23:14:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:30,244 INFO L93 Difference]: Finished difference Result 11242 states and 13901 transitions. [2020-10-25 23:14:30,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:30,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-10-25 23:14:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:30,279 INFO L225 Difference]: With dead ends: 11242 [2020-10-25 23:14:30,279 INFO L226 Difference]: Without dead ends: 7382 [2020-10-25 23:14:30,286 INFO L677 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 [2020-10-25 23:14:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2020-10-25 23:14:30,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7170. [2020-10-25 23:14:30,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7170 states. [2020-10-25 23:14:30,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 8765 transitions. [2020-10-25 23:14:30,944 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 8765 transitions. Word has length 82 [2020-10-25 23:14:30,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:30,944 INFO L481 AbstractCegarLoop]: Abstraction has 7170 states and 8765 transitions. [2020-10-25 23:14:30,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:30,945 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 8765 transitions. [2020-10-25 23:14:30,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-10-25 23:14:30,952 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:30,952 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:30,952 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-25 23:14:30,952 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:30,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1587172131, now seen corresponding path program 1 times [2020-10-25 23:14:30,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:30,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641619449] [2020-10-25 23:14:30,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:30,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641619449] [2020-10-25 23:14:30,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:30,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:30,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976894693] [2020-10-25 23:14:30,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:30,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:30,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:30,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:30,998 INFO L87 Difference]: Start difference. First operand 7170 states and 8765 transitions. Second operand 4 states. [2020-10-25 23:14:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:31,674 INFO L93 Difference]: Finished difference Result 12646 states and 15461 transitions. [2020-10-25 23:14:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:31,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-10-25 23:14:31,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:31,686 INFO L225 Difference]: With dead ends: 12646 [2020-10-25 23:14:31,686 INFO L226 Difference]: Without dead ends: 5513 [2020-10-25 23:14:31,695 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2020-10-25 23:14:32,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5509. [2020-10-25 23:14:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2020-10-25 23:14:32,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 6669 transitions. [2020-10-25 23:14:32,310 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 6669 transitions. Word has length 83 [2020-10-25 23:14:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:32,310 INFO L481 AbstractCegarLoop]: Abstraction has 5509 states and 6669 transitions. [2020-10-25 23:14:32,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 6669 transitions. [2020-10-25 23:14:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-10-25 23:14:32,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:32,316 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:32,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-25 23:14:32,317 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash -810228725, now seen corresponding path program 1 times [2020-10-25 23:14:32,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:32,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477172531] [2020-10-25 23:14:32,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:32,376 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:32,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477172531] [2020-10-25 23:14:32,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:32,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 23:14:32,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143710304] [2020-10-25 23:14:32,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:32,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:32,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:32,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:32,379 INFO L87 Difference]: Start difference. First operand 5509 states and 6669 transitions. Second operand 3 states. [2020-10-25 23:14:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:33,047 INFO L93 Difference]: Finished difference Result 12613 states and 15226 transitions. [2020-10-25 23:14:33,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:33,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-10-25 23:14:33,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:33,063 INFO L225 Difference]: With dead ends: 12613 [2020-10-25 23:14:33,063 INFO L226 Difference]: Without dead ends: 7130 [2020-10-25 23:14:33,072 INFO L677 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 [2020-10-25 23:14:33,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2020-10-25 23:14:33,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7082. [2020-10-25 23:14:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-10-25 23:14:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8483 transitions. [2020-10-25 23:14:33,560 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8483 transitions. Word has length 106 [2020-10-25 23:14:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:33,561 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8483 transitions. [2020-10-25 23:14:33,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8483 transitions. [2020-10-25 23:14:33,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-10-25 23:14:33,568 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:33,568 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:33,568 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-25 23:14:33,568 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:33,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:33,569 INFO L82 PathProgramCache]: Analyzing trace with hash 614427576, now seen corresponding path program 1 times [2020-10-25 23:14:33,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:33,570 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600249610] [2020-10-25 23:14:33,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:33,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600249610] [2020-10-25 23:14:33,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:33,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:33,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040987449] [2020-10-25 23:14:33,628 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:33,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:33,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:33,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:33,629 INFO L87 Difference]: Start difference. First operand 7082 states and 8483 transitions. Second operand 4 states. [2020-10-25 23:14:34,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:34,408 INFO L93 Difference]: Finished difference Result 12566 states and 15119 transitions. [2020-10-25 23:14:34,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:34,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2020-10-25 23:14:34,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:34,423 INFO L225 Difference]: With dead ends: 12566 [2020-10-25 23:14:34,424 INFO L226 Difference]: Without dead ends: 7094 [2020-10-25 23:14:34,432 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:34,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2020-10-25 23:14:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7082. [2020-10-25 23:14:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-10-25 23:14:34,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8447 transitions. [2020-10-25 23:14:34,846 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8447 transitions. Word has length 121 [2020-10-25 23:14:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:34,847 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8447 transitions. [2020-10-25 23:14:34,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8447 transitions. [2020-10-25 23:14:34,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-10-25 23:14:34,857 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:34,858 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:34,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-25 23:14:34,858 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:34,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1456346617, now seen corresponding path program 1 times [2020-10-25 23:14:34,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:34,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992762647] [2020-10-25 23:14:34,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:34,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:14:34,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992762647] [2020-10-25 23:14:34,917 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:34,917 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:34,917 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127539001] [2020-10-25 23:14:34,918 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:34,918 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:34,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:34,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:34,919 INFO L87 Difference]: Start difference. First operand 7082 states and 8447 transitions. Second operand 4 states. [2020-10-25 23:14:35,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:35,596 INFO L93 Difference]: Finished difference Result 14332 states and 17091 transitions. [2020-10-25 23:14:35,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:35,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2020-10-25 23:14:35,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:35,611 INFO L225 Difference]: With dead ends: 14332 [2020-10-25 23:14:35,612 INFO L226 Difference]: Without dead ends: 6492 [2020-10-25 23:14:35,623 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:35,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2020-10-25 23:14:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 6280. [2020-10-25 23:14:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-10-25 23:14:36,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7448 transitions. [2020-10-25 23:14:36,048 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7448 transitions. Word has length 147 [2020-10-25 23:14:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:36,048 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7448 transitions. [2020-10-25 23:14:36,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7448 transitions. [2020-10-25 23:14:36,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-10-25 23:14:36,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:36,054 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:36,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-25 23:14:36,054 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash -495516941, now seen corresponding path program 1 times [2020-10-25 23:14:36,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:36,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622557201] [2020-10-25 23:14:36,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:36,103 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:36,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622557201] [2020-10-25 23:14:36,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:36,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:36,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897243275] [2020-10-25 23:14:36,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:36,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:36,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:36,109 INFO L87 Difference]: Start difference. First operand 6280 states and 7448 transitions. Second operand 3 states. [2020-10-25 23:14:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:36,842 INFO L93 Difference]: Finished difference Result 11323 states and 13479 transitions. [2020-10-25 23:14:36,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:36,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-10-25 23:14:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:36,855 INFO L225 Difference]: With dead ends: 11323 [2020-10-25 23:14:36,855 INFO L226 Difference]: Without dead ends: 6304 [2020-10-25 23:14:36,864 INFO L677 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 [2020-10-25 23:14:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2020-10-25 23:14:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6280. [2020-10-25 23:14:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-10-25 23:14:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7296 transitions. [2020-10-25 23:14:37,446 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7296 transitions. Word has length 147 [2020-10-25 23:14:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:37,446 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7296 transitions. [2020-10-25 23:14:37,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:37,447 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7296 transitions. [2020-10-25 23:14:37,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-10-25 23:14:37,453 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:37,453 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:37,454 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-25 23:14:37,454 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:37,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:37,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1875095521, now seen corresponding path program 1 times [2020-10-25 23:14:37,455 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:37,455 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644694825] [2020-10-25 23:14:37,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 23:14:37,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644694825] [2020-10-25 23:14:37,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:37,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:37,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904255630] [2020-10-25 23:14:37,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:37,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:37,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:37,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:37,534 INFO L87 Difference]: Start difference. First operand 6280 states and 7296 transitions. Second operand 3 states. [2020-10-25 23:14:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:38,031 INFO L93 Difference]: Finished difference Result 10747 states and 12514 transitions. [2020-10-25 23:14:38,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:38,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2020-10-25 23:14:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:38,041 INFO L225 Difference]: With dead ends: 10747 [2020-10-25 23:14:38,041 INFO L226 Difference]: Without dead ends: 6564 [2020-10-25 23:14:38,047 INFO L677 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 [2020-10-25 23:14:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2020-10-25 23:14:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6280. [2020-10-25 23:14:38,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-10-25 23:14:38,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7176 transitions. [2020-10-25 23:14:38,755 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7176 transitions. Word has length 149 [2020-10-25 23:14:38,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:38,755 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7176 transitions. [2020-10-25 23:14:38,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7176 transitions. [2020-10-25 23:14:38,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-10-25 23:14:38,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:38,762 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:38,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-25 23:14:38,762 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:38,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1711412734, now seen corresponding path program 1 times [2020-10-25 23:14:38,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:38,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332562190] [2020-10-25 23:14:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:14:38,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332562190] [2020-10-25 23:14:38,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:38,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:38,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132868480] [2020-10-25 23:14:38,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:38,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:38,855 INFO L87 Difference]: Start difference. First operand 6280 states and 7176 transitions. Second operand 3 states. [2020-10-25 23:14:39,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:39,204 INFO L93 Difference]: Finished difference Result 10912 states and 12510 transitions. [2020-10-25 23:14:39,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:39,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2020-10-25 23:14:39,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:39,209 INFO L225 Difference]: With dead ends: 10912 [2020-10-25 23:14:39,209 INFO L226 Difference]: Without dead ends: 4668 [2020-10-25 23:14:39,215 INFO L677 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 [2020-10-25 23:14:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2020-10-25 23:14:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4652. [2020-10-25 23:14:39,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4652 states. [2020-10-25 23:14:39,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4652 states to 4652 states and 5255 transitions. [2020-10-25 23:14:39,588 INFO L78 Accepts]: Start accepts. Automaton has 4652 states and 5255 transitions. Word has length 150 [2020-10-25 23:14:39,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:39,588 INFO L481 AbstractCegarLoop]: Abstraction has 4652 states and 5255 transitions. [2020-10-25 23:14:39,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:39,588 INFO L276 IsEmpty]: Start isEmpty. Operand 4652 states and 5255 transitions. [2020-10-25 23:14:39,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-10-25 23:14:39,593 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:39,593 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:39,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-25 23:14:39,594 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:39,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:39,594 INFO L82 PathProgramCache]: Analyzing trace with hash 473818913, now seen corresponding path program 1 times [2020-10-25 23:14:39,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:39,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821630040] [2020-10-25 23:14:39,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 23:14:39,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821630040] [2020-10-25 23:14:39,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:39,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 23:14:39,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125685670] [2020-10-25 23:14:39,656 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 23:14:39,656 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:39,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 23:14:39,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 23:14:39,657 INFO L87 Difference]: Start difference. First operand 4652 states and 5255 transitions. Second operand 4 states. [2020-10-25 23:14:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:39,961 INFO L93 Difference]: Finished difference Result 7044 states and 7901 transitions. [2020-10-25 23:14:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:39,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-10-25 23:14:39,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:39,965 INFO L225 Difference]: With dead ends: 7044 [2020-10-25 23:14:39,965 INFO L226 Difference]: Without dead ends: 1511 [2020-10-25 23:14:39,971 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2020-10-25 23:14:40,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1507. [2020-10-25 23:14:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-10-25 23:14:40,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1613 transitions. [2020-10-25 23:14:40,108 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1613 transitions. Word has length 150 [2020-10-25 23:14:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:40,109 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1613 transitions. [2020-10-25 23:14:40,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 23:14:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1613 transitions. [2020-10-25 23:14:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-10-25 23:14:40,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:40,112 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:40,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-25 23:14:40,112 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:40,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash 776824727, now seen corresponding path program 1 times [2020-10-25 23:14:40,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:40,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415883062] [2020-10-25 23:14:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-25 23:14:40,309 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415883062] [2020-10-25 23:14:40,309 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:40,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:14:40,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468486742] [2020-10-25 23:14:40,310 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:14:40,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:14:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:40,311 INFO L87 Difference]: Start difference. First operand 1507 states and 1613 transitions. Second operand 5 states. [2020-10-25 23:14:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:40,505 INFO L93 Difference]: Finished difference Result 1507 states and 1613 transitions. [2020-10-25 23:14:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:14:40,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2020-10-25 23:14:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:40,508 INFO L225 Difference]: With dead ends: 1507 [2020-10-25 23:14:40,508 INFO L226 Difference]: Without dead ends: 1505 [2020-10-25 23:14:40,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:14:40,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-10-25 23:14:40,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2020-10-25 23:14:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2020-10-25 23:14:40,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2020-10-25 23:14:40,652 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 152 [2020-10-25 23:14:40,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:40,653 INFO L481 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2020-10-25 23:14:40,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:14:40,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2020-10-25 23:14:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-10-25 23:14:40,655 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:40,656 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:40,656 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-25 23:14:40,656 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:40,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:40,657 INFO L82 PathProgramCache]: Analyzing trace with hash 46651813, now seen corresponding path program 1 times [2020-10-25 23:14:40,657 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:40,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987455053] [2020-10-25 23:14:40,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:14:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-10-25 23:14:40,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987455053] [2020-10-25 23:14:40,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:14:40,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-25 23:14:40,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002368886] [2020-10-25 23:14:40,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-25 23:14:40,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:14:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-25 23:14:40,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-25 23:14:40,743 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand 3 states. [2020-10-25 23:14:40,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:14:40,923 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2020-10-25 23:14:40,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 23:14:40,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-10-25 23:14:40,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:14:40,926 INFO L225 Difference]: With dead ends: 2761 [2020-10-25 23:14:40,926 INFO L226 Difference]: Without dead ends: 2125 [2020-10-25 23:14:40,928 INFO L677 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 [2020-10-25 23:14:40,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-10-25 23:14:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2020-10-25 23:14:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-10-25 23:14:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2020-10-25 23:14:41,032 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2020-10-25 23:14:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:14:41,033 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2020-10-25 23:14:41,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-25 23:14:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2020-10-25 23:14:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-10-25 23:14:41,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:14:41,035 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:14:41,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-25 23:14:41,035 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:14:41,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:14:41,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1208769336, now seen corresponding path program 1 times [2020-10-25 23:14:41,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:14:41,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797829895] [2020-10-25 23:14:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:14:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:14:41,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:14:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:14:41,077 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:14:41,147 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:14:41,147 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:14:41,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-25 23:14:41,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:14:41 BoogieIcfgContainer [2020-10-25 23:14:41,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:14:41,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:14:41,366 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:14:41,366 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:14:41,367 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:14:22" (3/4) ... [2020-10-25 23:14:41,369 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:14:41,571 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:14:41,571 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:14:41,573 INFO L168 Benchmark]: Toolchain (without parser) took 20894.30 ms. Allocated memory was 46.1 MB in the beginning and 1.6 GB in the end (delta: 1.6 GB). Free memory was 30.0 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 489.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:41,574 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 37.7 MB. Free memory was 18.3 MB in the beginning and 18.2 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:14:41,575 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.82 ms. Allocated memory is still 46.1 MB. Free memory was 29.3 MB in the beginning and 23.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:41,575 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.02 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.4 MB in the beginning and 40.5 MB in the end (delta: -17.1 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:41,576 INFO L168 Benchmark]: Boogie Preprocessor took 51.87 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 37.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:41,576 INFO L168 Benchmark]: RCFGBuilder took 1073.43 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 26.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:41,577 INFO L168 Benchmark]: TraceAbstraction took 19040.95 ms. Allocated memory was 56.6 MB in the beginning and 1.6 GB in the end (delta: 1.6 GB). Free memory was 25.9 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 449.8 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:41,577 INFO L168 Benchmark]: Witness Printer took 205.40 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:14:41,580 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 37.7 MB. Free memory was 18.3 MB in the beginning and 18.2 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 433.82 ms. Allocated memory is still 46.1 MB. Free memory was 29.3 MB in the beginning and 23.4 MB in the end (delta: 5.9 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.02 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.4 MB in the beginning and 40.5 MB in the end (delta: -17.1 MB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 51.87 ms. Allocated memory is still 56.6 MB. Free memory was 40.5 MB in the beginning and 37.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1073.43 ms. Allocated memory is still 56.6 MB. Free memory was 37.9 MB in the beginning and 26.2 MB in the end (delta: 11.7 MB). Peak memory consumption was 19.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19040.95 ms. Allocated memory was 56.6 MB in the beginning and 1.6 GB in the end (delta: 1.6 GB). Free memory was 25.9 MB in the beginning and 1.1 GB in the end (delta: -1.1 GB). Peak memory consumption was 449.8 MB. Max. memory is 16.1 GB. * Witness Printer took 205.40 ms. Allocated memory is still 1.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L235] COND TRUE m_i == 1 [L236] m_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L348] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L353] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L358] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L363] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L368] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L373] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L186] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L205] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L386] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L391] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L396] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L401] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L406] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L411] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] kernel_st = 1 [L281] int tmp ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L53] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L186] int __retres1 ; VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); VAL [E_1=1, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L205] int __retres1 ; VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] __retres1 = 0 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L101] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L171] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] __retres1 = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L182] return (__retres1); VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L186] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L201] return (__retres1); VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L205] int __retres1 ; VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L220] return (__retres1); VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 VAL [E_1=2, E_2=1, 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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L120] E_2 = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L134] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L137] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L182] return (__retres1); VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L186] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L201] return (__retres1); VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L205] int __retres1 ; VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L220] return (__retres1); VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L156] E_M = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L285] COND TRUE 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L255] int __retres1 ; VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L276] return (__retres1); VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L45] COND TRUE m_pc == 1 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L67] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L80] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L3] __assert_fail("0", "token_ring.02.cil-2.c", 3, "reach_error") VAL [E_1=2, E_2=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.7s, OverallIterations: 29, TraceHistogramMax: 3, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9959 SDtfs, 12538 SDslu, 9564 SDs, 0 SdLazy, 712 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7170occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 6361 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 476043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 361/361 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...