./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 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:46:11,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:11,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:11,207 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:11,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:11,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:11,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:11,218 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:11,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:11,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:11,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:11,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:11,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:11,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:11,230 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:11,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:11,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:11,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:11,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:11,239 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:11,244 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:11,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:11,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:11,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:11,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:11,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:11,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:11,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:11,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:11,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:11,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:11,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:11,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:11,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:11,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:11,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:11,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:11,261 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:11,261 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:11,262 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:11,263 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:11,264 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:46:11,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:11,287 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:11,288 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:11,288 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:11,288 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:11,289 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:11,289 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:46:11,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:46:11,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:46:11,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:11,290 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:46:11,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:46:11,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:46:11,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:46:11,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:11,290 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:11,290 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:46:11,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:11,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:11,291 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:46:11,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:46:11,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:46:11,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:11,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:46:11,292 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:46:11,292 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:46:11,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:46:11,292 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:46:11,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 [2019-11-25 08:46:11,425 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:11,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:11,437 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:11,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:11,439 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:11,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-25 08:46:11,492 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/data/1c9e62607/cdaf310bc18346548a5d6b7dc7bb2432/FLAG782916459 [2019-11-25 08:46:11,931 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:11,932 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-25 08:46:11,941 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/data/1c9e62607/cdaf310bc18346548a5d6b7dc7bb2432/FLAG782916459 [2019-11-25 08:46:11,952 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/data/1c9e62607/cdaf310bc18346548a5d6b7dc7bb2432 [2019-11-25 08:46:11,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:11,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:11,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:11,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:11,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:11,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:11" (1/1) ... [2019-11-25 08:46:11,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2632a810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:11, skipping insertion in model container [2019-11-25 08:46:11,963 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:11" (1/1) ... [2019-11-25 08:46:11,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:11,994 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:46:12,231 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:12,236 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:46:12,282 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:12,305 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:46:12,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12 WrapperNode [2019-11-25 08:46:12,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:12,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:12,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:46:12,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:46:12,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,319 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,374 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:12,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:46:12,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:46:12,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:46:12,382 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... [2019-11-25 08:46:12,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:46:12,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:46:12,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:46:12,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:46:12,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:46:12,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:46:12,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:46:13,261 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:46:13,261 INFO L284 CfgBuilder]: Removed 105 assume(true) statements. [2019-11-25 08:46:13,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:13 BoogieIcfgContainer [2019-11-25 08:46:13,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:46:13,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:46:13,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:46:13,265 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:46:13,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:46:11" (1/3) ... [2019-11-25 08:46:13,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7408154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:13, skipping insertion in model container [2019-11-25 08:46:13,266 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:12" (2/3) ... [2019-11-25 08:46:13,267 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7408154e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:13, skipping insertion in model container [2019-11-25 08:46:13,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:13" (3/3) ... [2019-11-25 08:46:13,268 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-11-25 08:46:13,277 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:46:13,283 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-25 08:46:13,293 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-25 08:46:13,317 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:46:13,317 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:46:13,317 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:46:13,317 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:46:13,318 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:46:13,318 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:46:13,318 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:46:13,318 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:46:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2019-11-25 08:46:13,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:13,345 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:13,346 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:13,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,351 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2019-11-25 08:46:13,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981784254] [2019-11-25 08:46:13,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:13,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981784254] [2019-11-25 08:46:13,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:13,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902493766] [2019-11-25 08:46:13,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:13,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,512 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2019-11-25 08:46:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,571 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2019-11-25 08:46:13,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:13,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,595 INFO L225 Difference]: With dead ends: 445 [2019-11-25 08:46:13,596 INFO L226 Difference]: Without dead ends: 221 [2019-11-25 08:46:13,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-25 08:46:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-25 08:46:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-25 08:46:13,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2019-11-25 08:46:13,665 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2019-11-25 08:46:13,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,666 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2019-11-25 08:46:13,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:13,666 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2019-11-25 08:46:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:13,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:13,669 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2019-11-25 08:46:13,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060347886] [2019-11-25 08:46:13,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:13,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060347886] [2019-11-25 08:46:13,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:13,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416767399] [2019-11-25 08:46:13,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:13,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:13,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,725 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2019-11-25 08:46:13,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,790 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2019-11-25 08:46:13,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:13,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:13,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,794 INFO L225 Difference]: With dead ends: 595 [2019-11-25 08:46:13,795 INFO L226 Difference]: Without dead ends: 381 [2019-11-25 08:46:13,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-25 08:46:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-25 08:46:13,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:46:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2019-11-25 08:46:13,841 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2019-11-25 08:46:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,842 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2019-11-25 08:46:13,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:13,842 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2019-11-25 08:46:13,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:13,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:13,844 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,844 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2019-11-25 08:46:13,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642607927] [2019-11-25 08:46:13,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:13,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642607927] [2019-11-25 08:46:13,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:13,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:13,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612986626] [2019-11-25 08:46:13,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:13,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:13,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:13,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,881 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 3 states. [2019-11-25 08:46:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:13,914 INFO L93 Difference]: Finished difference Result 746 states and 1129 transitions. [2019-11-25 08:46:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:13,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:13,917 INFO L225 Difference]: With dead ends: 746 [2019-11-25 08:46:13,917 INFO L226 Difference]: Without dead ends: 377 [2019-11-25 08:46:13,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-25 08:46:13,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-25 08:46:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:46:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 562 transitions. [2019-11-25 08:46:13,946 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 562 transitions. Word has length 50 [2019-11-25 08:46:13,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:13,946 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 562 transitions. [2019-11-25 08:46:13,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 562 transitions. [2019-11-25 08:46:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:13,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:13,948 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:13,949 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:13,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2019-11-25 08:46:13,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:13,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137958768] [2019-11-25 08:46:13,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:14,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137958768] [2019-11-25 08:46:14,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805666260] [2019-11-25 08:46:14,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,005 INFO L87 Difference]: Start difference. First operand 377 states and 562 transitions. Second operand 3 states. [2019-11-25 08:46:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,045 INFO L93 Difference]: Finished difference Result 745 states and 1112 transitions. [2019-11-25 08:46:14,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,050 INFO L225 Difference]: With dead ends: 745 [2019-11-25 08:46:14,050 INFO L226 Difference]: Without dead ends: 377 [2019-11-25 08:46:14,052 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-25 08:46:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-25 08:46:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:46:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-11-25 08:46:14,087 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 50 [2019-11-25 08:46:14,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,087 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-11-25 08:46:14,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-11-25 08:46:14,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:14,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:14,090 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,090 INFO L82 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2019-11-25 08:46:14,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363106305] [2019-11-25 08:46:14,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:14,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363106305] [2019-11-25 08:46:14,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725074844] [2019-11-25 08:46:14,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,123 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 3 states. [2019-11-25 08:46:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,170 INFO L93 Difference]: Finished difference Result 744 states and 1095 transitions. [2019-11-25 08:46:14,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,171 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,174 INFO L225 Difference]: With dead ends: 744 [2019-11-25 08:46:14,174 INFO L226 Difference]: Without dead ends: 377 [2019-11-25 08:46:14,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-25 08:46:14,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-25 08:46:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:46:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2019-11-25 08:46:14,196 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 50 [2019-11-25 08:46:14,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,196 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2019-11-25 08:46:14,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,197 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2019-11-25 08:46:14,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:14,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:14,198 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,199 INFO L82 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2019-11-25 08:46:14,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842498162] [2019-11-25 08:46:14,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:14,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842498162] [2019-11-25 08:46:14,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825918346] [2019-11-25 08:46:14,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,242 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand 3 states. [2019-11-25 08:46:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,297 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2019-11-25 08:46:14,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:14,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,300 INFO L225 Difference]: With dead ends: 743 [2019-11-25 08:46:14,301 INFO L226 Difference]: Without dead ends: 377 [2019-11-25 08:46:14,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-25 08:46:14,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-25 08:46:14,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:46:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2019-11-25 08:46:14,322 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 50 [2019-11-25 08:46:14,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,323 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2019-11-25 08:46:14,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2019-11-25 08:46:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:14,324 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,324 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:14,325 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1177649081, now seen corresponding path program 1 times [2019-11-25 08:46:14,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758215373] [2019-11-25 08:46:14,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:14,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758215373] [2019-11-25 08:46:14,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658103721] [2019-11-25 08:46:14,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,355 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand 3 states. [2019-11-25 08:46:14,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,406 INFO L93 Difference]: Finished difference Result 742 states and 1029 transitions. [2019-11-25 08:46:14,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:14,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,409 INFO L225 Difference]: With dead ends: 742 [2019-11-25 08:46:14,409 INFO L226 Difference]: Without dead ends: 377 [2019-11-25 08:46:14,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-25 08:46:14,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-25 08:46:14,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-25 08:46:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 506 transitions. [2019-11-25 08:46:14,431 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 506 transitions. Word has length 50 [2019-11-25 08:46:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,432 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 506 transitions. [2019-11-25 08:46:14,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 506 transitions. [2019-11-25 08:46:14,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:46:14,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:14,434 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1947581763, now seen corresponding path program 1 times [2019-11-25 08:46:14,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466879531] [2019-11-25 08:46:14,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:14,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466879531] [2019-11-25 08:46:14,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:14,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535502407] [2019-11-25 08:46:14,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:14,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:14,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,486 INFO L87 Difference]: Start difference. First operand 377 states and 506 transitions. Second operand 3 states. [2019-11-25 08:46:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,569 INFO L93 Difference]: Finished difference Result 1050 states and 1412 transitions. [2019-11-25 08:46:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:14,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:46:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,574 INFO L225 Difference]: With dead ends: 1050 [2019-11-25 08:46:14,575 INFO L226 Difference]: Without dead ends: 687 [2019-11-25 08:46:14,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:14,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-25 08:46:14,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 649. [2019-11-25 08:46:14,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-11-25 08:46:14,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 861 transitions. [2019-11-25 08:46:14,631 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 861 transitions. Word has length 50 [2019-11-25 08:46:14,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,633 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 861 transitions. [2019-11-25 08:46:14,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 861 transitions. [2019-11-25 08:46:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 08:46:14,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,636 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:14,637 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 647371149, now seen corresponding path program 1 times [2019-11-25 08:46:14,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231497247] [2019-11-25 08:46:14,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:14,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231497247] [2019-11-25 08:46:14,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:14,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:46:14,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937635768] [2019-11-25 08:46:14,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:46:14,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:46:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:14,745 INFO L87 Difference]: Start difference. First operand 649 states and 861 transitions. Second operand 5 states. [2019-11-25 08:46:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:14,890 INFO L93 Difference]: Finished difference Result 1534 states and 2059 transitions. [2019-11-25 08:46:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:46:14,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-25 08:46:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:14,896 INFO L225 Difference]: With dead ends: 1534 [2019-11-25 08:46:14,896 INFO L226 Difference]: Without dead ends: 903 [2019-11-25 08:46:14,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:46:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-25 08:46:14,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 655. [2019-11-25 08:46:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-25 08:46:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 852 transitions. [2019-11-25 08:46:14,938 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 852 transitions. Word has length 81 [2019-11-25 08:46:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:14,938 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 852 transitions. [2019-11-25 08:46:14,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:46:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 852 transitions. [2019-11-25 08:46:14,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 08:46:14,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:14,940 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:14,940 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:14,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:14,941 INFO L82 PathProgramCache]: Analyzing trace with hash 83505161, now seen corresponding path program 1 times [2019-11-25 08:46:14,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:14,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395182913] [2019-11-25 08:46:14,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:14,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:15,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395182913] [2019-11-25 08:46:15,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:46:15,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709790067] [2019-11-25 08:46:15,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:46:15,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:46:15,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:15,004 INFO L87 Difference]: Start difference. First operand 655 states and 852 transitions. Second operand 5 states. [2019-11-25 08:46:15,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,157 INFO L93 Difference]: Finished difference Result 1575 states and 2073 transitions. [2019-11-25 08:46:15,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:46:15,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-25 08:46:15,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,166 INFO L225 Difference]: With dead ends: 1575 [2019-11-25 08:46:15,166 INFO L226 Difference]: Without dead ends: 945 [2019-11-25 08:46:15,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:46:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-25 08:46:15,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 661. [2019-11-25 08:46:15,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-11-25 08:46:15,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 843 transitions. [2019-11-25 08:46:15,215 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 843 transitions. Word has length 81 [2019-11-25 08:46:15,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,218 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 843 transitions. [2019-11-25 08:46:15,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:46:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 843 transitions. [2019-11-25 08:46:15,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 08:46:15,220 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,220 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:15,220 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:15,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,221 INFO L82 PathProgramCache]: Analyzing trace with hash 736088965, now seen corresponding path program 1 times [2019-11-25 08:46:15,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:15,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370884743] [2019-11-25 08:46:15,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:15,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370884743] [2019-11-25 08:46:15,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:46:15,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011680942] [2019-11-25 08:46:15,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:46:15,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:46:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:15,297 INFO L87 Difference]: Start difference. First operand 661 states and 843 transitions. Second operand 5 states. [2019-11-25 08:46:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,461 INFO L93 Difference]: Finished difference Result 1838 states and 2375 transitions. [2019-11-25 08:46:15,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:46:15,462 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-25 08:46:15,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,469 INFO L225 Difference]: With dead ends: 1838 [2019-11-25 08:46:15,469 INFO L226 Difference]: Without dead ends: 1209 [2019-11-25 08:46:15,471 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:46:15,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-11-25 08:46:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 673. [2019-11-25 08:46:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-25 08:46:15,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 842 transitions. [2019-11-25 08:46:15,524 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 842 transitions. Word has length 81 [2019-11-25 08:46:15,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,524 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 842 transitions. [2019-11-25 08:46:15,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:46:15,524 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 842 transitions. [2019-11-25 08:46:15,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-25 08:46:15,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,526 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:15,527 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,527 INFO L82 PathProgramCache]: Analyzing trace with hash -284979389, now seen corresponding path program 1 times [2019-11-25 08:46:15,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:15,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727413594] [2019-11-25 08:46:15,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:15,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727413594] [2019-11-25 08:46:15,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:15,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433051037] [2019-11-25 08:46:15,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:15,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:15,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:15,577 INFO L87 Difference]: Start difference. First operand 673 states and 842 transitions. Second operand 3 states. [2019-11-25 08:46:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:15,677 INFO L93 Difference]: Finished difference Result 1813 states and 2270 transitions. [2019-11-25 08:46:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:15,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-25 08:46:15,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:15,685 INFO L225 Difference]: With dead ends: 1813 [2019-11-25 08:46:15,685 INFO L226 Difference]: Without dead ends: 1178 [2019-11-25 08:46:15,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:15,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-25 08:46:15,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1174. [2019-11-25 08:46:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-11-25 08:46:15,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1452 transitions. [2019-11-25 08:46:15,799 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1452 transitions. Word has length 81 [2019-11-25 08:46:15,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:15,801 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1452 transitions. [2019-11-25 08:46:15,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1452 transitions. [2019-11-25 08:46:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-25 08:46:15,802 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:15,803 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:15,803 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash 206796516, now seen corresponding path program 1 times [2019-11-25 08:46:15,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:15,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718958280] [2019-11-25 08:46:15,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:15,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:15,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718958280] [2019-11-25 08:46:15,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:15,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:15,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103555162] [2019-11-25 08:46:15,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:15,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:15,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:15,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:15,848 INFO L87 Difference]: Start difference. First operand 1174 states and 1452 transitions. Second operand 3 states. [2019-11-25 08:46:16,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:16,003 INFO L93 Difference]: Finished difference Result 3254 states and 4030 transitions. [2019-11-25 08:46:16,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:16,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-25 08:46:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:16,015 INFO L225 Difference]: With dead ends: 3254 [2019-11-25 08:46:16,015 INFO L226 Difference]: Without dead ends: 2118 [2019-11-25 08:46:16,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:16,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-25 08:46:16,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2114. [2019-11-25 08:46:16,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-25 08:46:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2598 transitions. [2019-11-25 08:46:16,146 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2598 transitions. Word has length 82 [2019-11-25 08:46:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:16,147 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 2598 transitions. [2019-11-25 08:46:16,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2598 transitions. [2019-11-25 08:46:16,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-25 08:46:16,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:16,149 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:16,150 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:16,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:16,150 INFO L82 PathProgramCache]: Analyzing trace with hash 233862118, now seen corresponding path program 1 times [2019-11-25 08:46:16,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:16,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725169210] [2019-11-25 08:46:16,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-25 08:46:16,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725169210] [2019-11-25 08:46:16,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:16,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:16,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317042732] [2019-11-25 08:46:16,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:16,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:16,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:16,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:16,170 INFO L87 Difference]: Start difference. First operand 2114 states and 2598 transitions. Second operand 3 states. [2019-11-25 08:46:16,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:16,297 INFO L93 Difference]: Finished difference Result 4158 states and 5120 transitions. [2019-11-25 08:46:16,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:16,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-25 08:46:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:16,308 INFO L225 Difference]: With dead ends: 4158 [2019-11-25 08:46:16,308 INFO L226 Difference]: Without dead ends: 2082 [2019-11-25 08:46:16,311 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-11-25 08:46:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2082. [2019-11-25 08:46:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-25 08:46:16,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2563 transitions. [2019-11-25 08:46:16,439 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2563 transitions. Word has length 82 [2019-11-25 08:46:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:16,440 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2563 transitions. [2019-11-25 08:46:16,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:16,440 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2563 transitions. [2019-11-25 08:46:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:46:16,442 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:16,442 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:16,443 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:16,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2019-11-25 08:46:16,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:16,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379343807] [2019-11-25 08:46:16,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:16,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:16,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379343807] [2019-11-25 08:46:16,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:16,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:16,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360094925] [2019-11-25 08:46:16,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:16,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:16,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:16,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:16,490 INFO L87 Difference]: Start difference. First operand 2082 states and 2563 transitions. Second operand 3 states. [2019-11-25 08:46:16,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:16,730 INFO L93 Difference]: Finished difference Result 5880 states and 7201 transitions. [2019-11-25 08:46:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:16,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-25 08:46:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:16,746 INFO L225 Difference]: With dead ends: 5880 [2019-11-25 08:46:16,746 INFO L226 Difference]: Without dead ends: 2958 [2019-11-25 08:46:16,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:16,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-11-25 08:46:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2019-11-25 08:46:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-11-25 08:46:16,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3600 transitions. [2019-11-25 08:46:16,926 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3600 transitions. Word has length 83 [2019-11-25 08:46:16,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:16,926 INFO L462 AbstractCegarLoop]: Abstraction has 2958 states and 3600 transitions. [2019-11-25 08:46:16,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:16,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3600 transitions. [2019-11-25 08:46:16,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-25 08:46:16,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:16,929 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:16,930 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:16,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:16,930 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2019-11-25 08:46:16,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:16,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768859177] [2019-11-25 08:46:16,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:16,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768859177] [2019-11-25 08:46:16,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:16,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:16,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018874149] [2019-11-25 08:46:16,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:16,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:16,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:16,983 INFO L87 Difference]: Start difference. First operand 2958 states and 3600 transitions. Second operand 3 states. [2019-11-25 08:46:17,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:17,255 INFO L93 Difference]: Finished difference Result 6752 states and 8190 transitions. [2019-11-25 08:46:17,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:17,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-25 08:46:17,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:17,275 INFO L225 Difference]: With dead ends: 6752 [2019-11-25 08:46:17,275 INFO L226 Difference]: Without dead ends: 3821 [2019-11-25 08:46:17,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:17,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-11-25 08:46:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3797. [2019-11-25 08:46:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-11-25 08:46:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 4566 transitions. [2019-11-25 08:46:17,494 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 4566 transitions. Word has length 106 [2019-11-25 08:46:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:17,494 INFO L462 AbstractCegarLoop]: Abstraction has 3797 states and 4566 transitions. [2019-11-25 08:46:17,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 4566 transitions. [2019-11-25 08:46:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-25 08:46:17,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:17,499 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:46:17,499 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -264530006, now seen corresponding path program 1 times [2019-11-25 08:46:17,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:17,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237605503] [2019-11-25 08:46:17,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:46:17,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237605503] [2019-11-25 08:46:17,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:17,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:17,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424229172] [2019-11-25 08:46:17,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:17,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:17,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:17,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:17,546 INFO L87 Difference]: Start difference. First operand 3797 states and 4566 transitions. Second operand 3 states. [2019-11-25 08:46:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:17,786 INFO L93 Difference]: Finished difference Result 7467 states and 8962 transitions. [2019-11-25 08:46:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:17,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-25 08:46:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:17,805 INFO L225 Difference]: With dead ends: 7467 [2019-11-25 08:46:17,805 INFO L226 Difference]: Without dead ends: 3707 [2019-11-25 08:46:17,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:17,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-11-25 08:46:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2019-11-25 08:46:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-25 08:46:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4354 transitions. [2019-11-25 08:46:18,116 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4354 transitions. Word has length 120 [2019-11-25 08:46:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,117 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4354 transitions. [2019-11-25 08:46:18,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4354 transitions. [2019-11-25 08:46:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:46:18,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,121 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:18,121 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:18,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2019-11-25 08:46:18,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190524859] [2019-11-25 08:46:18,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,167 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:18,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190524859] [2019-11-25 08:46:18,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908153672] [2019-11-25 08:46:18,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,172 INFO L87 Difference]: Start difference. First operand 3707 states and 4354 transitions. Second operand 3 states. [2019-11-25 08:46:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,384 INFO L93 Difference]: Finished difference Result 6571 states and 7758 transitions. [2019-11-25 08:46:18,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:46:18,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,403 INFO L225 Difference]: With dead ends: 6571 [2019-11-25 08:46:18,403 INFO L226 Difference]: Without dead ends: 3723 [2019-11-25 08:46:18,407 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2019-11-25 08:46:18,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3707. [2019-11-25 08:46:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-25 08:46:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4262 transitions. [2019-11-25 08:46:18,613 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4262 transitions. Word has length 121 [2019-11-25 08:46:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,613 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4262 transitions. [2019-11-25 08:46:18,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4262 transitions. [2019-11-25 08:46:18,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-25 08:46:18,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,618 INFO L410 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, 1] [2019-11-25 08:46:18,618 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:18,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,618 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2019-11-25 08:46:18,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409251782] [2019-11-25 08:46:18,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:18,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409251782] [2019-11-25 08:46:18,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425849552] [2019-11-25 08:46:18,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,659 INFO L87 Difference]: Start difference. First operand 3707 states and 4262 transitions. Second operand 3 states. [2019-11-25 08:46:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,913 INFO L93 Difference]: Finished difference Result 6559 states and 7560 transitions. [2019-11-25 08:46:18,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-25 08:46:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,937 INFO L225 Difference]: With dead ends: 6559 [2019-11-25 08:46:18,943 INFO L226 Difference]: Without dead ends: 3711 [2019-11-25 08:46:18,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-11-25 08:46:19,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3707. [2019-11-25 08:46:19,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-25 08:46:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4244 transitions. [2019-11-25 08:46:19,138 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4244 transitions. Word has length 122 [2019-11-25 08:46:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:19,139 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4244 transitions. [2019-11-25 08:46:19,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:19,139 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4244 transitions. [2019-11-25 08:46:19,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-25 08:46:19,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:19,144 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-25 08:46:19,144 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:19,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:19,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1028326263, now seen corresponding path program 1 times [2019-11-25 08:46:19,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:19,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037235668] [2019-11-25 08:46:19,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-25 08:46:19,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037235668] [2019-11-25 08:46:19,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:19,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:19,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586273112] [2019-11-25 08:46:19,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:19,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:19,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,214 INFO L87 Difference]: Start difference. First operand 3707 states and 4244 transitions. Second operand 3 states. [2019-11-25 08:46:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:19,440 INFO L93 Difference]: Finished difference Result 8135 states and 9290 transitions. [2019-11-25 08:46:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:19,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-25 08:46:19,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:19,447 INFO L225 Difference]: With dead ends: 8135 [2019-11-25 08:46:19,448 INFO L226 Difference]: Without dead ends: 4448 [2019-11-25 08:46:19,453 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-11-25 08:46:19,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4416. [2019-11-25 08:46:19,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2019-11-25 08:46:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5010 transitions. [2019-11-25 08:46:19,692 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5010 transitions. Word has length 145 [2019-11-25 08:46:19,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:19,693 INFO L462 AbstractCegarLoop]: Abstraction has 4416 states and 5010 transitions. [2019-11-25 08:46:19,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5010 transitions. [2019-11-25 08:46:19,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-25 08:46:19,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:19,700 INFO L410 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, 1] [2019-11-25 08:46:19,700 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:19,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1098265157, now seen corresponding path program 1 times [2019-11-25 08:46:19,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:19,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584926526] [2019-11-25 08:46:19,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-25 08:46:19,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584926526] [2019-11-25 08:46:19,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:19,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:19,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487777274] [2019-11-25 08:46:19,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:19,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:19,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,762 INFO L87 Difference]: Start difference. First operand 4416 states and 5010 transitions. Second operand 3 states. [2019-11-25 08:46:19,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:19,949 INFO L93 Difference]: Finished difference Result 6055 states and 6869 transitions. [2019-11-25 08:46:19,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:19,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-25 08:46:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:19,952 INFO L225 Difference]: With dead ends: 6055 [2019-11-25 08:46:19,953 INFO L226 Difference]: Without dead ends: 1503 [2019-11-25 08:46:19,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-25 08:46:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-25 08:46:20,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-25 08:46:20,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1647 transitions. [2019-11-25 08:46:20,084 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1647 transitions. Word has length 148 [2019-11-25 08:46:20,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,084 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1647 transitions. [2019-11-25 08:46:20,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:20,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1647 transitions. [2019-11-25 08:46:20,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-25 08:46:20,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,088 INFO L410 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] [2019-11-25 08:46:20,088 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513564, now seen corresponding path program 1 times [2019-11-25 08:46:20,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916977088] [2019-11-25 08:46:20,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:20,130 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:46:20,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916977088] [2019-11-25 08:46:20,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:20,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:20,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147516136] [2019-11-25 08:46:20,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:20,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:20,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:20,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,132 INFO L87 Difference]: Start difference. First operand 1503 states and 1647 transitions. Second operand 3 states. [2019-11-25 08:46:20,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,214 INFO L93 Difference]: Finished difference Result 2346 states and 2580 transitions. [2019-11-25 08:46:20,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:20,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-25 08:46:20,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,217 INFO L225 Difference]: With dead ends: 2346 [2019-11-25 08:46:20,218 INFO L226 Difference]: Without dead ends: 1539 [2019-11-25 08:46:20,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-25 08:46:20,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1503. [2019-11-25 08:46:20,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-25 08:46:20,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1627 transitions. [2019-11-25 08:46:20,293 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1627 transitions. Word has length 149 [2019-11-25 08:46:20,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,293 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1627 transitions. [2019-11-25 08:46:20,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1627 transitions. [2019-11-25 08:46:20,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-25 08:46:20,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,297 INFO L410 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] [2019-11-25 08:46:20,297 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2019-11-25 08:46:20,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586480313] [2019-11-25 08:46:20,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:20,346 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:20,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586480313] [2019-11-25 08:46:20,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:20,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:20,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406459248] [2019-11-25 08:46:20,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:20,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:20,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:20,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,348 INFO L87 Difference]: Start difference. First operand 1503 states and 1627 transitions. Second operand 3 states. [2019-11-25 08:46:20,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,442 INFO L93 Difference]: Finished difference Result 2657 states and 2881 transitions. [2019-11-25 08:46:20,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:20,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-25 08:46:20,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,445 INFO L225 Difference]: With dead ends: 2657 [2019-11-25 08:46:20,445 INFO L226 Difference]: Without dead ends: 1503 [2019-11-25 08:46:20,447 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-25 08:46:20,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-25 08:46:20,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-25 08:46:20,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1605 transitions. [2019-11-25 08:46:20,522 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1605 transitions. Word has length 150 [2019-11-25 08:46:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,523 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1605 transitions. [2019-11-25 08:46:20,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1605 transitions. [2019-11-25 08:46:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-25 08:46:20,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,526 INFO L410 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] [2019-11-25 08:46:20,526 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,527 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2019-11-25 08:46:20,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169581353] [2019-11-25 08:46:20,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:20,678 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:46:20,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169581353] [2019-11-25 08:46:20,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:20,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:46:20,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563562200] [2019-11-25 08:46:20,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:46:20,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:20,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:46:20,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:20,682 INFO L87 Difference]: Start difference. First operand 1503 states and 1605 transitions. Second operand 5 states. [2019-11-25 08:46:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,798 INFO L93 Difference]: Finished difference Result 1503 states and 1605 transitions. [2019-11-25 08:46:20,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:20,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-25 08:46:20,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,801 INFO L225 Difference]: With dead ends: 1503 [2019-11-25 08:46:20,802 INFO L226 Difference]: Without dead ends: 1501 [2019-11-25 08:46:20,803 INFO L630 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 [2019-11-25 08:46:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-25 08:46:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2019-11-25 08:46:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-25 08:46:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1602 transitions. [2019-11-25 08:46:20,887 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1602 transitions. Word has length 152 [2019-11-25 08:46:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,888 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 1602 transitions. [2019-11-25 08:46:20,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:46:20,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1602 transitions. [2019-11-25 08:46:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-25 08:46:20,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,891 INFO L410 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] [2019-11-25 08:46:20,891 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2019-11-25 08:46:20,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162864912] [2019-11-25 08:46:20,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-25 08:46:20,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162864912] [2019-11-25 08:46:20,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:20,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:20,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521227171] [2019-11-25 08:46:20,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:20,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:20,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:20,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,941 INFO L87 Difference]: Start difference. First operand 1501 states and 1602 transitions. Second operand 3 states. [2019-11-25 08:46:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:21,114 INFO L93 Difference]: Finished difference Result 2757 states and 2935 transitions. [2019-11-25 08:46:21,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:21,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-25 08:46:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:21,118 INFO L225 Difference]: With dead ends: 2757 [2019-11-25 08:46:21,118 INFO L226 Difference]: Without dead ends: 2121 [2019-11-25 08:46:21,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-25 08:46:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1503. [2019-11-25 08:46:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-25 08:46:21,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1604 transitions. [2019-11-25 08:46:21,207 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1604 transitions. Word has length 156 [2019-11-25 08:46:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:21,207 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1604 transitions. [2019-11-25 08:46:21,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:21,208 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1604 transitions. [2019-11-25 08:46:21,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-25 08:46:21,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:21,211 INFO L410 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] [2019-11-25 08:46:21,211 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:21,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:21,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2019-11-25 08:46:21,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:21,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600994383] [2019-11-25 08:46:21,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:46:21,323 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:46:21,323 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:46:21,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:46:21 BoogieIcfgContainer [2019-11-25 08:46:21,462 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:46:21,462 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:46:21,462 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:46:21,463 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:46:21,463 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:13" (3/4) ... [2019-11-25 08:46:21,465 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:46:21,631 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_719c92d0-6ae1-42ab-abd8-4d0552c1babc/bin/uautomizer/witness.graphml [2019-11-25 08:46:21,631 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:46:21,633 INFO L168 Benchmark]: Toolchain (without parser) took 9677.05 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 671.1 MB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -573.9 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:21,633 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:46:21,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:21,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:21,634 INFO L168 Benchmark]: Boogie Preprocessor took 42.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:21,635 INFO L168 Benchmark]: RCFGBuilder took 845.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:21,635 INFO L168 Benchmark]: TraceAbstraction took 8198.78 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 531.1 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -477.5 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:21,635 INFO L168 Benchmark]: Witness Printer took 168.75 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:21,637 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 845.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 56.0 MB). Peak memory consumption was 56.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8198.78 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 531.1 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -477.5 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. * Witness Printer took 168.75 ms. Allocated memory is still 1.7 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] 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] [L600] int __retres1 ; [L514] m_i = 1 [L515] t1_i = 1 [L516] 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] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] 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] [L233] COND TRUE m_i == 1 [L234] 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] [L238] COND TRUE t1_i == 1 [L239] 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] [L243] COND TRUE t2_i == 1 [L244] 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] [L346] 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] [L351] 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] [L356] 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] [L361] 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] [L366] 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] [L371] 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] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] 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] [L168] 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] [L178] __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] [L180] 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] [L425] tmp = is_master_triggered() [L427] 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] [L184] 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] [L187] 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] [L197] __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] [L199] 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] [L433] tmp___0 = is_transmit1_triggered() [L435] 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] [L203] 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] [L206] 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] [L216] __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] [L218] 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] [L441] tmp___1 = is_transmit2_triggered() [L443] 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] [L384] 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] [L389] 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] [L394] 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] [L399] 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] [L404] 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] [L409] 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] [L555] 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] [L558] kernel_st = 1 [L279] 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] [L283] 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] [L253] 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] [L256] COND TRUE m_st == 0 [L257] __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] [L274] 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] [L286] tmp = exists_runnable_thread() [L288] 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] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] 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] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] 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] [L96] 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] [L107] 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] [L109] t1_pc = 1 [L110] 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] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] 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] [L132] 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] [L143] 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] [L145] t2_pc = 1 [L146] 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] [L283] 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] [L253] 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] [L256] COND TRUE m_st == 0 [L257] __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] [L274] 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] [L286] tmp = exists_runnable_thread() [L288] 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] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] 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] [L51] 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] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] 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] [L168] 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] [L178] __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] [L180] 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] [L425] tmp = is_master_triggered() [L427] 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] [L184] 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] [L187] 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] [L188] COND TRUE E_1 == 1 [L189] __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] [L199] 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] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] 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] [L203] 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] [L206] 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] [L207] 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] [L216] __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] [L218] 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] [L441] tmp___1 = is_transmit2_triggered() [L443] 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] [L58] E_1 = 2 [L59] m_pc = 1 [L60] 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] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] 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] [L96] 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] [L99] 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] [L115] token += 1 [L116] E_2 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] 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] [L168] 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] [L169] 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] [L178] __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] [L180] 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] [L425] tmp = is_master_triggered() [L427] 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] [L184] 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] [L187] 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] [L188] 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] [L197] __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] [L199] 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] [L433] tmp___0 = is_transmit1_triggered() [L435] 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] [L203] 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] [L206] 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] [L207] COND TRUE E_2 == 1 [L208] __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] [L218] 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] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] 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] [L118] 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] [L107] 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] [L109] t1_pc = 1 [L110] 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] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] 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] [L132] 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] [L135] 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] [L151] token += 1 [L152] E_M = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] 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] [L168] 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] [L169] COND TRUE E_M == 1 [L170] __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] [L180] 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] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] 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] [L184] 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] [L187] 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] [L188] 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] [L197] __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] [L199] 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] [L433] tmp___0 = is_transmit1_triggered() [L435] 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] [L203] 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] [L206] 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] [L207] 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] [L216] __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] [L218] 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] [L441] tmp___1 = is_transmit2_triggered() [L443] 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] [L154] 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] [L143] 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] [L145] t2_pc = 1 [L146] 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] [L283] 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] [L253] 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] [L256] COND TRUE m_st == 0 [L257] __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] [L274] 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] [L286] tmp = exists_runnable_thread() [L288] 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] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] 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] [L43] 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] [L65] 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] [L70] 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] [L71] 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] [L76] 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] [L77] 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] [L10] __VERIFIER_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, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.1s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8212 SDtfs, 7053 SDslu, 5879 SDs, 0 SdLazy, 402 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4416occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2497 NumberOfCodeBlocks, 2497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2315 ConstructedInterpolants, 0 QuantifiedInterpolants, 459807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 367/367 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...