./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/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 5c335ff5b8eab9ea6afa4a9f4426aa1c270baaeb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.25-f470102 [2019-12-07 11:53:06,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:53:06,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:53:06,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:53:06,055 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:53:06,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:53:06,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:53:06,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:53:06,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:53:06,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:53:06,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:53:06,061 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:53:06,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:53:06,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:53:06,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:53:06,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:53:06,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:53:06,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:53:06,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:53:06,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:53:06,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:53:06,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:53:06,070 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:53:06,070 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:53:06,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:53:06,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:53:06,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:53:06,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:53:06,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:53:06,073 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:53:06,074 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:53:06,074 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:53:06,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:53:06,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:53:06,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:53:06,076 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:53:06,076 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:53:06,076 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:53:06,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:53:06,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:53:06,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:53:06,078 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:53:06,087 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:53:06,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:53:06,087 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:53:06,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:53:06,088 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:53:06,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:53:06,088 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:53:06,088 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:53:06,088 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:53:06,088 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:53:06,089 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:53:06,089 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:53:06,090 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:53:06,090 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:53:06,090 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:53:06,090 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:53:06,090 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:53:06,090 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:53:06,091 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:53:06,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:53:06,091 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:53:06,091 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:53:06,091 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_aac99c32-4692-4c52-9036-2f3802594a7b/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 -> 5c335ff5b8eab9ea6afa4a9f4426aa1c270baaeb [2019-12-07 11:53:06,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:53:06,198 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:53:06,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:53:06,202 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:53:06,202 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:53:06,202 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i [2019-12-07 11:53:06,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/data/40b12e455/f54969143b5f4f06b10d0e23b74e0605/FLAGaedd72051 [2019-12-07 11:53:06,605 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:53:06,606 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/sv-benchmarks/c/pthread-wmm/mix017_rmo.opt.i [2019-12-07 11:53:06,617 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/data/40b12e455/f54969143b5f4f06b10d0e23b74e0605/FLAGaedd72051 [2019-12-07 11:53:06,626 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/data/40b12e455/f54969143b5f4f06b10d0e23b74e0605 [2019-12-07 11:53:06,628 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:53:06,629 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:53:06,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:53:06,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:53:06,631 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:53:06,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:53:06" (1/1) ... [2019-12-07 11:53:06,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3482028c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:06, skipping insertion in model container [2019-12-07 11:53:06,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:53:06" (1/1) ... [2019-12-07 11:53:06,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:53:06,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:53:06,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:53:06,914 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:53:06,958 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:53:07,005 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:53:07,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07 WrapperNode [2019-12-07 11:53:07,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:53:07,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:53:07,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:53:07,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:53:07,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:53:07,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:53:07,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:53:07,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:53:07,051 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,062 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,065 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... [2019-12-07 11:53:07,070 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:53:07,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:53:07,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:53:07,071 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:53:07,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/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-12-07 11:53:07,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:53:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:53:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:53:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:53:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:53:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:53:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:53:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:53:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:53:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:53:07,112 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 11:53:07,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 11:53:07,113 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:53:07,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:53:07,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:53:07,114 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:53:07,469 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:53:07,469 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:53:07,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:53:07 BoogieIcfgContainer [2019-12-07 11:53:07,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:53:07,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:53:07,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:53:07,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:53:07,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:53:06" (1/3) ... [2019-12-07 11:53:07,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b2f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:53:07, skipping insertion in model container [2019-12-07 11:53:07,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:53:07" (2/3) ... [2019-12-07 11:53:07,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2b2f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:53:07, skipping insertion in model container [2019-12-07 11:53:07,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:53:07" (3/3) ... [2019-12-07 11:53:07,475 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2019-12-07 11:53:07,481 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:53:07,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:53:07,486 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:53:07,487 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:53:07,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,512 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,512 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,513 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,513 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,514 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,515 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,516 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,517 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,518 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,519 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,520 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,521 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,522 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,523 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,524 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,526 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,526 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,527 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,527 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,528 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,529 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,530 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,530 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,531 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,532 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,533 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,534 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:53:07,546 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 11:53:07,558 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:53:07,558 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:53:07,558 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:53:07,559 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:53:07,559 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:53:07,559 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:53:07,559 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:53:07,559 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:53:07,570 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-07 11:53:07,571 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-07 11:53:07,626 INFO L134 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-07 11:53:07,626 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:53:07,636 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 715 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 11:53:07,653 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-07 11:53:07,682 INFO L134 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-07 11:53:07,682 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:53:07,687 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 715 event pairs. 12/175 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 11:53:07,703 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 11:53:07,703 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:53:10,981 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 11:53:11,246 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 11:53:11,344 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72619 [2019-12-07 11:53:11,344 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 11:53:11,346 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 92 transitions [2019-12-07 11:53:37,692 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-07 11:53:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-07 11:53:37,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:53:37,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:37,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:37,699 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:37,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:37,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1489169700, now seen corresponding path program 1 times [2019-12-07 11:53:37,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:37,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607819449] [2019-12-07 11:53:37,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:53:37,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607819449] [2019-12-07 11:53:37,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:37,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:53:37,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98147287] [2019-12-07 11:53:37,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:53:37,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:37,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:53:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:53:37,870 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-07 11:53:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:38,945 INFO L93 Difference]: Finished difference Result 158106 states and 752394 transitions. [2019-12-07 11:53:38,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:53:38,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:53:38,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:39,635 INFO L225 Difference]: With dead ends: 158106 [2019-12-07 11:53:39,635 INFO L226 Difference]: Without dead ends: 149058 [2019-12-07 11:53:39,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 11:53:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149058 states. [2019-12-07 11:53:49,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149058 to 149058. [2019-12-07 11:53:49,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149058 states. [2019-12-07 11:53:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149058 states to 149058 states and 708428 transitions. [2019-12-07 11:53:49,676 INFO L78 Accepts]: Start accepts. Automaton has 149058 states and 708428 transitions. Word has length 7 [2019-12-07 11:53:49,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:53:49,677 INFO L462 AbstractCegarLoop]: Abstraction has 149058 states and 708428 transitions. [2019-12-07 11:53:49,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:53:49,677 INFO L276 IsEmpty]: Start isEmpty. Operand 149058 states and 708428 transitions. [2019-12-07 11:53:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:53:49,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:53:49,685 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:53:49,686 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:53:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:53:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1593754123, now seen corresponding path program 1 times [2019-12-07 11:53:49,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:53:49,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760696791] [2019-12-07 11:53:49,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:53:49,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:53:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:53:49,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760696791] [2019-12-07 11:53:49,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:53:49,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:53:49,756 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212743712] [2019-12-07 11:53:49,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:53:49,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:53:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:53:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:53:49,758 INFO L87 Difference]: Start difference. First operand 149058 states and 708428 transitions. Second operand 4 states. [2019-12-07 11:53:51,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:53:51,435 INFO L93 Difference]: Finished difference Result 235386 states and 1077036 transitions. [2019-12-07 11:53:51,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:53:51,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:53:51,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:53:52,132 INFO L225 Difference]: With dead ends: 235386 [2019-12-07 11:53:52,132 INFO L226 Difference]: Without dead ends: 235190 [2019-12-07 11:53:52,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:54:01,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235190 states. [2019-12-07 11:54:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235190 to 218838. [2019-12-07 11:54:04,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218838 states. [2019-12-07 11:54:05,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218838 states to 218838 states and 1009170 transitions. [2019-12-07 11:54:05,287 INFO L78 Accepts]: Start accepts. Automaton has 218838 states and 1009170 transitions. Word has length 15 [2019-12-07 11:54:05,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:05,287 INFO L462 AbstractCegarLoop]: Abstraction has 218838 states and 1009170 transitions. [2019-12-07 11:54:05,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:54:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 218838 states and 1009170 transitions. [2019-12-07 11:54:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 11:54:05,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:05,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:54:05,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:05,291 INFO L82 PathProgramCache]: Analyzing trace with hash -314430534, now seen corresponding path program 1 times [2019-12-07 11:54:05,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:05,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879201462] [2019-12-07 11:54:05,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:05,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:05,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:54:05,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879201462] [2019-12-07 11:54:05,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:05,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:54:05,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536760834] [2019-12-07 11:54:05,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:54:05,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:54:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:54:05,350 INFO L87 Difference]: Start difference. First operand 218838 states and 1009170 transitions. Second operand 4 states. [2019-12-07 11:54:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:09,993 INFO L93 Difference]: Finished difference Result 303492 states and 1373977 transitions. [2019-12-07 11:54:09,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:54:09,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 11:54:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:10,860 INFO L225 Difference]: With dead ends: 303492 [2019-12-07 11:54:10,860 INFO L226 Difference]: Without dead ends: 303268 [2019-12-07 11:54:10,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:54:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303268 states. [2019-12-07 11:54:22,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303268 to 258620. [2019-12-07 11:54:22,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258620 states. [2019-12-07 11:54:23,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258620 states to 258620 states and 1186875 transitions. [2019-12-07 11:54:23,818 INFO L78 Accepts]: Start accepts. Automaton has 258620 states and 1186875 transitions. Word has length 15 [2019-12-07 11:54:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:23,818 INFO L462 AbstractCegarLoop]: Abstraction has 258620 states and 1186875 transitions. [2019-12-07 11:54:23,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:54:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 258620 states and 1186875 transitions. [2019-12-07 11:54:23,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:54:23,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:23,823 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:54:23,824 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:23,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:23,824 INFO L82 PathProgramCache]: Analyzing trace with hash 24118251, now seen corresponding path program 1 times [2019-12-07 11:54:23,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:23,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94357482] [2019-12-07 11:54:23,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:23,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:54:23,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94357482] [2019-12-07 11:54:23,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:23,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:54:23,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870917965] [2019-12-07 11:54:23,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:54:23,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:23,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:54:23,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:54:23,865 INFO L87 Difference]: Start difference. First operand 258620 states and 1186875 transitions. Second operand 4 states. [2019-12-07 11:54:26,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:26,137 INFO L93 Difference]: Finished difference Result 318782 states and 1453762 transitions. [2019-12-07 11:54:26,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:54:26,137 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:54:26,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:27,030 INFO L225 Difference]: With dead ends: 318782 [2019-12-07 11:54:27,030 INFO L226 Difference]: Without dead ends: 318590 [2019-12-07 11:54:27,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:54:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318590 states. [2019-12-07 11:54:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318590 to 272736. [2019-12-07 11:54:42,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272736 states. [2019-12-07 11:54:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272736 states to 272736 states and 1251733 transitions. [2019-12-07 11:54:43,404 INFO L78 Accepts]: Start accepts. Automaton has 272736 states and 1251733 transitions. Word has length 16 [2019-12-07 11:54:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:54:43,404 INFO L462 AbstractCegarLoop]: Abstraction has 272736 states and 1251733 transitions. [2019-12-07 11:54:43,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:54:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 272736 states and 1251733 transitions. [2019-12-07 11:54:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 11:54:43,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:54:43,422 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] [2019-12-07 11:54:43,423 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:54:43,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:54:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash 481033317, now seen corresponding path program 1 times [2019-12-07 11:54:43,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:54:43,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000183251] [2019-12-07 11:54:43,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:54:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:54:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:54:43,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000183251] [2019-12-07 11:54:43,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:54:43,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:54:43,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450378823] [2019-12-07 11:54:43,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:54:43,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:54:43,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:54:43,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:54:43,478 INFO L87 Difference]: Start difference. First operand 272736 states and 1251733 transitions. Second operand 3 states. [2019-12-07 11:54:45,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:54:45,232 INFO L93 Difference]: Finished difference Result 274234 states and 1256012 transitions. [2019-12-07 11:54:45,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:54:45,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 11:54:45,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:54:46,018 INFO L225 Difference]: With dead ends: 274234 [2019-12-07 11:54:46,018 INFO L226 Difference]: Without dead ends: 274234 [2019-12-07 11:54:46,019 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 11:54:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274234 states. [2019-12-07 11:55:00,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274234 to 272647. [2019-12-07 11:55:00,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272647 states. [2019-12-07 11:55:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272647 states to 272647 states and 1251268 transitions. [2019-12-07 11:55:01,436 INFO L78 Accepts]: Start accepts. Automaton has 272647 states and 1251268 transitions. Word has length 20 [2019-12-07 11:55:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:01,436 INFO L462 AbstractCegarLoop]: Abstraction has 272647 states and 1251268 transitions. [2019-12-07 11:55:01,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:55:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 272647 states and 1251268 transitions. [2019-12-07 11:55:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:55:01,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:01,458 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] [2019-12-07 11:55:01,458 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:55:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash 909864239, now seen corresponding path program 1 times [2019-12-07 11:55:01,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:01,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056993447] [2019-12-07 11:55:01,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:01,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056993447] [2019-12-07 11:55:01,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:01,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:55:01,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11421801] [2019-12-07 11:55:01,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:55:01,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:01,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:01,493 INFO L87 Difference]: Start difference. First operand 272647 states and 1251268 transitions. Second operand 3 states. [2019-12-07 11:55:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:03,221 INFO L93 Difference]: Finished difference Result 271198 states and 1244612 transitions. [2019-12-07 11:55:03,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:03,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 11:55:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:04,008 INFO L225 Difference]: With dead ends: 271198 [2019-12-07 11:55:04,008 INFO L226 Difference]: Without dead ends: 271198 [2019-12-07 11:55:04,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 11:55:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271198 states. [2019-12-07 11:55:18,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271198 to 271198. [2019-12-07 11:55:18,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271198 states. [2019-12-07 11:55:19,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271198 states to 271198 states and 1244612 transitions. [2019-12-07 11:55:19,799 INFO L78 Accepts]: Start accepts. Automaton has 271198 states and 1244612 transitions. Word has length 21 [2019-12-07 11:55:19,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:19,799 INFO L462 AbstractCegarLoop]: Abstraction has 271198 states and 1244612 transitions. [2019-12-07 11:55:19,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:55:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 271198 states and 1244612 transitions. [2019-12-07 11:55:19,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:55:19,822 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:19,822 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] [2019-12-07 11:55:19,822 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:55:19,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:19,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2062943904, now seen corresponding path program 1 times [2019-12-07 11:55:19,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:19,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284171040] [2019-12-07 11:55:19,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:19,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284171040] [2019-12-07 11:55:19,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:19,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:55:19,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455337219] [2019-12-07 11:55:19,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:55:19,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:19,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:19,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:19,860 INFO L87 Difference]: Start difference. First operand 271198 states and 1244612 transitions. Second operand 3 states. [2019-12-07 11:55:21,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:21,542 INFO L93 Difference]: Finished difference Result 255718 states and 1161990 transitions. [2019-12-07 11:55:21,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:21,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 11:55:21,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:22,272 INFO L225 Difference]: With dead ends: 255718 [2019-12-07 11:55:22,273 INFO L226 Difference]: Without dead ends: 255718 [2019-12-07 11:55:22,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 11:55:29,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255718 states. [2019-12-07 11:55:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255718 to 251958. [2019-12-07 11:55:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251958 states. [2019-12-07 11:55:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251958 states to 251958 states and 1145806 transitions. [2019-12-07 11:55:34,081 INFO L78 Accepts]: Start accepts. Automaton has 251958 states and 1145806 transitions. Word has length 21 [2019-12-07 11:55:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:34,081 INFO L462 AbstractCegarLoop]: Abstraction has 251958 states and 1145806 transitions. [2019-12-07 11:55:34,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:55:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 251958 states and 1145806 transitions. [2019-12-07 11:55:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:55:34,102 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:34,102 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] [2019-12-07 11:55:34,102 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:55:34,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2073534819, now seen corresponding path program 1 times [2019-12-07 11:55:34,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:34,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029809834] [2019-12-07 11:55:34,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:34,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029809834] [2019-12-07 11:55:34,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:34,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:55:34,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590794779] [2019-12-07 11:55:34,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:55:34,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:34,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:55:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:55:34,138 INFO L87 Difference]: Start difference. First operand 251958 states and 1145806 transitions. Second operand 5 states. [2019-12-07 11:55:38,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:38,889 INFO L93 Difference]: Finished difference Result 355214 states and 1594184 transitions. [2019-12-07 11:55:38,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:55:38,889 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 11:55:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:39,894 INFO L225 Difference]: With dead ends: 355214 [2019-12-07 11:55:39,894 INFO L226 Difference]: Without dead ends: 354848 [2019-12-07 11:55:39,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:55:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354848 states. [2019-12-07 11:55:51,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354848 to 264268. [2019-12-07 11:55:51,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264268 states. [2019-12-07 11:55:53,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264268 states to 264268 states and 1201645 transitions. [2019-12-07 11:55:53,169 INFO L78 Accepts]: Start accepts. Automaton has 264268 states and 1201645 transitions. Word has length 21 [2019-12-07 11:55:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:55:53,169 INFO L462 AbstractCegarLoop]: Abstraction has 264268 states and 1201645 transitions. [2019-12-07 11:55:53,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:55:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 264268 states and 1201645 transitions. [2019-12-07 11:55:53,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:55:53,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:55:53,190 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] [2019-12-07 11:55:53,190 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:55:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:55:53,190 INFO L82 PathProgramCache]: Analyzing trace with hash -814273925, now seen corresponding path program 1 times [2019-12-07 11:55:53,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:55:53,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540890536] [2019-12-07 11:55:53,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:55:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:55:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:55:53,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540890536] [2019-12-07 11:55:53,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:55:53,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:55:53,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26298893] [2019-12-07 11:55:53,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:55:53,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:55:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:55:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:55:53,218 INFO L87 Difference]: Start difference. First operand 264268 states and 1201645 transitions. Second operand 3 states. [2019-12-07 11:55:53,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:55:53,886 INFO L93 Difference]: Finished difference Result 163119 states and 666779 transitions. [2019-12-07 11:55:53,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:55:53,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 11:55:53,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:55:54,281 INFO L225 Difference]: With dead ends: 163119 [2019-12-07 11:55:54,281 INFO L226 Difference]: Without dead ends: 163119 [2019-12-07 11:55:54,282 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-12-07 11:55:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163119 states. [2019-12-07 11:56:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163119 to 163119. [2019-12-07 11:56:00,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163119 states. [2019-12-07 11:56:00,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163119 states to 163119 states and 666779 transitions. [2019-12-07 11:56:00,716 INFO L78 Accepts]: Start accepts. Automaton has 163119 states and 666779 transitions. Word has length 21 [2019-12-07 11:56:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:00,716 INFO L462 AbstractCegarLoop]: Abstraction has 163119 states and 666779 transitions. [2019-12-07 11:56:00,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:00,716 INFO L276 IsEmpty]: Start isEmpty. Operand 163119 states and 666779 transitions. [2019-12-07 11:56:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:56:00,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:00,730 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] [2019-12-07 11:56:00,731 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:00,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash -405417231, now seen corresponding path program 1 times [2019-12-07 11:56:00,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:00,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588581833] [2019-12-07 11:56:00,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:00,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588581833] [2019-12-07 11:56:00,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:00,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:00,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407999893] [2019-12-07 11:56:00,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:00,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:00,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:00,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:00,760 INFO L87 Difference]: Start difference. First operand 163119 states and 666779 transitions. Second operand 4 states. [2019-12-07 11:56:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:01,173 INFO L93 Difference]: Finished difference Result 42324 states and 146994 transitions. [2019-12-07 11:56:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:01,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 11:56:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:01,238 INFO L225 Difference]: With dead ends: 42324 [2019-12-07 11:56:01,238 INFO L226 Difference]: Without dead ends: 42324 [2019-12-07 11:56:01,238 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42324 states. [2019-12-07 11:56:01,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42324 to 42324. [2019-12-07 11:56:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42324 states. [2019-12-07 11:56:01,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42324 states to 42324 states and 146994 transitions. [2019-12-07 11:56:01,928 INFO L78 Accepts]: Start accepts. Automaton has 42324 states and 146994 transitions. Word has length 22 [2019-12-07 11:56:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:01,928 INFO L462 AbstractCegarLoop]: Abstraction has 42324 states and 146994 transitions. [2019-12-07 11:56:01,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:01,928 INFO L276 IsEmpty]: Start isEmpty. Operand 42324 states and 146994 transitions. [2019-12-07 11:56:01,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:56:01,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:01,936 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] [2019-12-07 11:56:01,936 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:01,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:01,936 INFO L82 PathProgramCache]: Analyzing trace with hash -116240952, now seen corresponding path program 1 times [2019-12-07 11:56:01,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:01,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739966447] [2019-12-07 11:56:01,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:01,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739966447] [2019-12-07 11:56:01,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:01,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:01,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729961847] [2019-12-07 11:56:01,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:56:01,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:01,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:56:01,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:01,990 INFO L87 Difference]: Start difference. First operand 42324 states and 146994 transitions. Second operand 5 states. [2019-12-07 11:56:02,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:02,399 INFO L93 Difference]: Finished difference Result 54644 states and 187177 transitions. [2019-12-07 11:56:02,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:56:02,400 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 11:56:02,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:02,489 INFO L225 Difference]: With dead ends: 54644 [2019-12-07 11:56:02,489 INFO L226 Difference]: Without dead ends: 54620 [2019-12-07 11:56:02,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:56:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54620 states. [2019-12-07 11:56:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54620 to 43245. [2019-12-07 11:56:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43245 states. [2019-12-07 11:56:04,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43245 states to 43245 states and 149717 transitions. [2019-12-07 11:56:04,444 INFO L78 Accepts]: Start accepts. Automaton has 43245 states and 149717 transitions. Word has length 24 [2019-12-07 11:56:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:04,445 INFO L462 AbstractCegarLoop]: Abstraction has 43245 states and 149717 transitions. [2019-12-07 11:56:04,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:56:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 43245 states and 149717 transitions. [2019-12-07 11:56:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:56:04,462 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:04,463 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] [2019-12-07 11:56:04,463 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:04,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:04,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1513171326, now seen corresponding path program 1 times [2019-12-07 11:56:04,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:04,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282556505] [2019-12-07 11:56:04,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:04,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:04,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282556505] [2019-12-07 11:56:04,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:04,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:56:04,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614201063] [2019-12-07 11:56:04,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:04,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:04,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:04,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:04,511 INFO L87 Difference]: Start difference. First operand 43245 states and 149717 transitions. Second operand 6 states. [2019-12-07 11:56:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:05,212 INFO L93 Difference]: Finished difference Result 112105 states and 389808 transitions. [2019-12-07 11:56:05,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:56:05,213 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 11:56:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:05,425 INFO L225 Difference]: With dead ends: 112105 [2019-12-07 11:56:05,425 INFO L226 Difference]: Without dead ends: 112058 [2019-12-07 11:56:05,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:56:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112058 states. [2019-12-07 11:56:06,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112058 to 56574. [2019-12-07 11:56:06,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56574 states. [2019-12-07 11:56:06,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56574 states to 56574 states and 198346 transitions. [2019-12-07 11:56:06,975 INFO L78 Accepts]: Start accepts. Automaton has 56574 states and 198346 transitions. Word has length 31 [2019-12-07 11:56:06,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:06,975 INFO L462 AbstractCegarLoop]: Abstraction has 56574 states and 198346 transitions. [2019-12-07 11:56:06,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 56574 states and 198346 transitions. [2019-12-07 11:56:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 11:56:07,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:07,007 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] [2019-12-07 11:56:07,007 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:07,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:07,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1748073813, now seen corresponding path program 1 times [2019-12-07 11:56:07,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:07,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212324414] [2019-12-07 11:56:07,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:07,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:07,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212324414] [2019-12-07 11:56:07,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:07,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:56:07,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390623556] [2019-12-07 11:56:07,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:07,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:07,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:07,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:07,053 INFO L87 Difference]: Start difference. First operand 56574 states and 198346 transitions. Second operand 6 states. [2019-12-07 11:56:07,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:07,882 INFO L93 Difference]: Finished difference Result 110572 states and 382429 transitions. [2019-12-07 11:56:07,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:56:07,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 11:56:07,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:08,092 INFO L225 Difference]: With dead ends: 110572 [2019-12-07 11:56:08,092 INFO L226 Difference]: Without dead ends: 110526 [2019-12-07 11:56:08,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:56:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110526 states. [2019-12-07 11:56:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110526 to 53564. [2019-12-07 11:56:09,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53564 states. [2019-12-07 11:56:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53564 states to 53564 states and 188520 transitions. [2019-12-07 11:56:09,478 INFO L78 Accepts]: Start accepts. Automaton has 53564 states and 188520 transitions. Word has length 32 [2019-12-07 11:56:09,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:09,478 INFO L462 AbstractCegarLoop]: Abstraction has 53564 states and 188520 transitions. [2019-12-07 11:56:09,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 53564 states and 188520 transitions. [2019-12-07 11:56:09,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:56:09,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:09,642 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] [2019-12-07 11:56:09,642 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:09,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:09,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1384375025, now seen corresponding path program 1 times [2019-12-07 11:56:09,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:09,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454032816] [2019-12-07 11:56:09,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:09,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454032816] [2019-12-07 11:56:09,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:09,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:09,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813460547] [2019-12-07 11:56:09,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:09,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:09,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:09,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:09,673 INFO L87 Difference]: Start difference. First operand 53564 states and 188520 transitions. Second operand 4 states. [2019-12-07 11:56:09,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:09,933 INFO L93 Difference]: Finished difference Result 86916 states and 298091 transitions. [2019-12-07 11:56:09,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:09,934 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 11:56:09,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:10,024 INFO L225 Difference]: With dead ends: 86916 [2019-12-07 11:56:10,024 INFO L226 Difference]: Without dead ends: 51329 [2019-12-07 11:56:10,025 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:10,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51329 states. [2019-12-07 11:56:10,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51329 to 51249. [2019-12-07 11:56:10,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51249 states. [2019-12-07 11:56:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51249 states to 51249 states and 177765 transitions. [2019-12-07 11:56:10,886 INFO L78 Accepts]: Start accepts. Automaton has 51249 states and 177765 transitions. Word has length 33 [2019-12-07 11:56:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:10,887 INFO L462 AbstractCegarLoop]: Abstraction has 51249 states and 177765 transitions. [2019-12-07 11:56:10,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 51249 states and 177765 transitions. [2019-12-07 11:56:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:56:10,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:10,914 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] [2019-12-07 11:56:10,914 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash 389747275, now seen corresponding path program 2 times [2019-12-07 11:56:10,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:10,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521987789] [2019-12-07 11:56:10,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:10,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521987789] [2019-12-07 11:56:10,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:10,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:56:10,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088254277] [2019-12-07 11:56:10,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:56:10,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:56:10,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:10,953 INFO L87 Difference]: Start difference. First operand 51249 states and 177765 transitions. Second operand 5 states. [2019-12-07 11:56:11,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:11,058 INFO L93 Difference]: Finished difference Result 26794 states and 95257 transitions. [2019-12-07 11:56:11,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:56:11,059 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 11:56:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:11,104 INFO L225 Difference]: With dead ends: 26794 [2019-12-07 11:56:11,104 INFO L226 Difference]: Without dead ends: 26779 [2019-12-07 11:56:11,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26779 states. [2019-12-07 11:56:11,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26779 to 25197. [2019-12-07 11:56:11,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25197 states. [2019-12-07 11:56:11,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25197 states to 25197 states and 89168 transitions. [2019-12-07 11:56:11,517 INFO L78 Accepts]: Start accepts. Automaton has 25197 states and 89168 transitions. Word has length 33 [2019-12-07 11:56:11,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:11,518 INFO L462 AbstractCegarLoop]: Abstraction has 25197 states and 89168 transitions. [2019-12-07 11:56:11,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:56:11,518 INFO L276 IsEmpty]: Start isEmpty. Operand 25197 states and 89168 transitions. [2019-12-07 11:56:11,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:56:11,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:11,544 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] [2019-12-07 11:56:11,544 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash -233422742, now seen corresponding path program 1 times [2019-12-07 11:56:11,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:11,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782010335] [2019-12-07 11:56:11,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:11,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782010335] [2019-12-07 11:56:11,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:11,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:56:11,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660180968] [2019-12-07 11:56:11,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:56:11,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:11,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:56:11,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:56:11,604 INFO L87 Difference]: Start difference. First operand 25197 states and 89168 transitions. Second operand 7 states. [2019-12-07 11:56:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:12,473 INFO L93 Difference]: Finished difference Result 51776 states and 180152 transitions. [2019-12-07 11:56:12,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:56:12,473 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 11:56:12,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:12,560 INFO L225 Difference]: With dead ends: 51776 [2019-12-07 11:56:12,560 INFO L226 Difference]: Without dead ends: 51459 [2019-12-07 11:56:12,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:56:12,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51459 states. [2019-12-07 11:56:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51459 to 25971. [2019-12-07 11:56:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25971 states. [2019-12-07 11:56:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25971 states to 25971 states and 92092 transitions. [2019-12-07 11:56:13,178 INFO L78 Accepts]: Start accepts. Automaton has 25971 states and 92092 transitions. Word has length 43 [2019-12-07 11:56:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:13,179 INFO L462 AbstractCegarLoop]: Abstraction has 25971 states and 92092 transitions. [2019-12-07 11:56:13,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:56:13,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25971 states and 92092 transitions. [2019-12-07 11:56:13,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 11:56:13,209 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:13,209 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] [2019-12-07 11:56:13,209 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:13,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:13,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1178806544, now seen corresponding path program 2 times [2019-12-07 11:56:13,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:13,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472695578] [2019-12-07 11:56:13,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:13,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:13,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472695578] [2019-12-07 11:56:13,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:13,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:56:13,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450418176] [2019-12-07 11:56:13,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:56:13,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:13,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:56:13,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:13,253 INFO L87 Difference]: Start difference. First operand 25971 states and 92092 transitions. Second operand 6 states. [2019-12-07 11:56:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:13,351 INFO L93 Difference]: Finished difference Result 24489 states and 88510 transitions. [2019-12-07 11:56:13,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:56:13,351 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 11:56:13,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:13,387 INFO L225 Difference]: With dead ends: 24489 [2019-12-07 11:56:13,388 INFO L226 Difference]: Without dead ends: 24122 [2019-12-07 11:56:13,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24122 states. [2019-12-07 11:56:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24122 to 18820. [2019-12-07 11:56:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18820 states. [2019-12-07 11:56:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18820 states to 18820 states and 68658 transitions. [2019-12-07 11:56:13,736 INFO L78 Accepts]: Start accepts. Automaton has 18820 states and 68658 transitions. Word has length 43 [2019-12-07 11:56:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:13,736 INFO L462 AbstractCegarLoop]: Abstraction has 18820 states and 68658 transitions. [2019-12-07 11:56:13,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:56:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 18820 states and 68658 transitions. [2019-12-07 11:56:13,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:13,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:13,756 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:13,756 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:13,757 INFO L82 PathProgramCache]: Analyzing trace with hash 829629181, now seen corresponding path program 1 times [2019-12-07 11:56:13,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:13,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718189178] [2019-12-07 11:56:13,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:13,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718189178] [2019-12-07 11:56:13,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:13,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:56:13,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829396272] [2019-12-07 11:56:13,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:56:13,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:13,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:56:13,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:13,817 INFO L87 Difference]: Start difference. First operand 18820 states and 68658 transitions. Second operand 5 states. [2019-12-07 11:56:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:14,128 INFO L93 Difference]: Finished difference Result 29579 states and 105957 transitions. [2019-12-07 11:56:14,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:56:14,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-07 11:56:14,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:14,174 INFO L225 Difference]: With dead ends: 29579 [2019-12-07 11:56:14,174 INFO L226 Difference]: Without dead ends: 29579 [2019-12-07 11:56:14,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:56:14,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29579 states. [2019-12-07 11:56:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29579 to 24997. [2019-12-07 11:56:14,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24997 states. [2019-12-07 11:56:14,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24997 states to 24997 states and 90377 transitions. [2019-12-07 11:56:14,713 INFO L78 Accepts]: Start accepts. Automaton has 24997 states and 90377 transitions. Word has length 58 [2019-12-07 11:56:14,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:14,713 INFO L462 AbstractCegarLoop]: Abstraction has 24997 states and 90377 transitions. [2019-12-07 11:56:14,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:56:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 24997 states and 90377 transitions. [2019-12-07 11:56:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:14,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:14,740 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:14,741 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash 457182583, now seen corresponding path program 2 times [2019-12-07 11:56:14,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:14,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490913101] [2019-12-07 11:56:14,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:14,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:14,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490913101] [2019-12-07 11:56:14,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:14,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:56:14,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676275776] [2019-12-07 11:56:14,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:56:14,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:14,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:56:14,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:56:14,827 INFO L87 Difference]: Start difference. First operand 24997 states and 90377 transitions. Second operand 8 states. [2019-12-07 11:56:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:15,829 INFO L93 Difference]: Finished difference Result 58198 states and 208978 transitions. [2019-12-07 11:56:15,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 11:56:15,829 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-07 11:56:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:15,932 INFO L225 Difference]: With dead ends: 58198 [2019-12-07 11:56:15,932 INFO L226 Difference]: Without dead ends: 58198 [2019-12-07 11:56:15,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 11:56:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58198 states. [2019-12-07 11:56:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58198 to 26931. [2019-12-07 11:56:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26931 states. [2019-12-07 11:56:16,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26931 states to 26931 states and 97666 transitions. [2019-12-07 11:56:16,644 INFO L78 Accepts]: Start accepts. Automaton has 26931 states and 97666 transitions. Word has length 58 [2019-12-07 11:56:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:16,645 INFO L462 AbstractCegarLoop]: Abstraction has 26931 states and 97666 transitions. [2019-12-07 11:56:16,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:56:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 26931 states and 97666 transitions. [2019-12-07 11:56:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:16,677 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:16,677 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:16,677 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:16,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:16,677 INFO L82 PathProgramCache]: Analyzing trace with hash 929695755, now seen corresponding path program 3 times [2019-12-07 11:56:16,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:16,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128989241] [2019-12-07 11:56:16,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:16,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:16,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128989241] [2019-12-07 11:56:16,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:16,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:56:16,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896690949] [2019-12-07 11:56:16,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:56:16,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:16,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:56:16,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:56:16,765 INFO L87 Difference]: Start difference. First operand 26931 states and 97666 transitions. Second operand 9 states. [2019-12-07 11:56:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:17,689 INFO L93 Difference]: Finished difference Result 47995 states and 170367 transitions. [2019-12-07 11:56:17,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 11:56:17,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 11:56:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:17,764 INFO L225 Difference]: With dead ends: 47995 [2019-12-07 11:56:17,764 INFO L226 Difference]: Without dead ends: 47995 [2019-12-07 11:56:17,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:56:17,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47995 states. [2019-12-07 11:56:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47995 to 28159. [2019-12-07 11:56:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28159 states. [2019-12-07 11:56:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28159 states to 28159 states and 100990 transitions. [2019-12-07 11:56:18,441 INFO L78 Accepts]: Start accepts. Automaton has 28159 states and 100990 transitions. Word has length 58 [2019-12-07 11:56:18,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:18,441 INFO L462 AbstractCegarLoop]: Abstraction has 28159 states and 100990 transitions. [2019-12-07 11:56:18,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:56:18,441 INFO L276 IsEmpty]: Start isEmpty. Operand 28159 states and 100990 transitions. [2019-12-07 11:56:18,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:18,474 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:18,474 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:18,474 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:18,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:18,474 INFO L82 PathProgramCache]: Analyzing trace with hash 826446617, now seen corresponding path program 4 times [2019-12-07 11:56:18,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:18,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993802387] [2019-12-07 11:56:18,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:18,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:18,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993802387] [2019-12-07 11:56:18,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:18,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:56:18,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965009759] [2019-12-07 11:56:18,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:56:18,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:18,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:56:18,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:56:18,521 INFO L87 Difference]: Start difference. First operand 28159 states and 100990 transitions. Second operand 4 states. [2019-12-07 11:56:18,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:18,647 INFO L93 Difference]: Finished difference Result 40315 states and 139236 transitions. [2019-12-07 11:56:18,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:56:18,647 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 11:56:18,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:18,663 INFO L225 Difference]: With dead ends: 40315 [2019-12-07 11:56:18,663 INFO L226 Difference]: Without dead ends: 12982 [2019-12-07 11:56:18,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:56:18,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2019-12-07 11:56:18,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12982. [2019-12-07 11:56:18,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12982 states. [2019-12-07 11:56:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12982 states to 12982 states and 40560 transitions. [2019-12-07 11:56:18,843 INFO L78 Accepts]: Start accepts. Automaton has 12982 states and 40560 transitions. Word has length 58 [2019-12-07 11:56:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:18,843 INFO L462 AbstractCegarLoop]: Abstraction has 12982 states and 40560 transitions. [2019-12-07 11:56:18,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:56:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 12982 states and 40560 transitions. [2019-12-07 11:56:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:18,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:18,854 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:18,854 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:18,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:18,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1617500823, now seen corresponding path program 5 times [2019-12-07 11:56:18,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:18,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662471162] [2019-12-07 11:56:18,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:19,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662471162] [2019-12-07 11:56:19,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:19,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 11:56:19,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007123929] [2019-12-07 11:56:19,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:56:19,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:56:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:56:19,044 INFO L87 Difference]: Start difference. First operand 12982 states and 40560 transitions. Second operand 13 states. [2019-12-07 11:56:20,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:20,942 INFO L93 Difference]: Finished difference Result 37770 states and 115307 transitions. [2019-12-07 11:56:20,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:56:20,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-12-07 11:56:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:20,978 INFO L225 Difference]: With dead ends: 37770 [2019-12-07 11:56:20,978 INFO L226 Difference]: Without dead ends: 26639 [2019-12-07 11:56:20,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 11:56:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26639 states. [2019-12-07 11:56:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26639 to 14206. [2019-12-07 11:56:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14206 states. [2019-12-07 11:56:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14206 states to 14206 states and 44896 transitions. [2019-12-07 11:56:21,264 INFO L78 Accepts]: Start accepts. Automaton has 14206 states and 44896 transitions. Word has length 58 [2019-12-07 11:56:21,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:21,264 INFO L462 AbstractCegarLoop]: Abstraction has 14206 states and 44896 transitions. [2019-12-07 11:56:21,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:56:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 14206 states and 44896 transitions. [2019-12-07 11:56:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:21,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:21,278 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:21,278 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:21,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:21,278 INFO L82 PathProgramCache]: Analyzing trace with hash -538645685, now seen corresponding path program 6 times [2019-12-07 11:56:21,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:21,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919871841] [2019-12-07 11:56:21,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:21,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919871841] [2019-12-07 11:56:21,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:21,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:56:21,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643158264] [2019-12-07 11:56:21,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:56:21,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:56:21,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:56:21,337 INFO L87 Difference]: Start difference. First operand 14206 states and 44896 transitions. Second operand 7 states. [2019-12-07 11:56:21,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:21,580 INFO L93 Difference]: Finished difference Result 35973 states and 112317 transitions. [2019-12-07 11:56:21,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:56:21,580 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-12-07 11:56:21,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:21,614 INFO L225 Difference]: With dead ends: 35973 [2019-12-07 11:56:21,614 INFO L226 Difference]: Without dead ends: 27467 [2019-12-07 11:56:21,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:56:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27467 states. [2019-12-07 11:56:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27467 to 17768. [2019-12-07 11:56:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17768 states. [2019-12-07 11:56:21,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17768 states to 17768 states and 56388 transitions. [2019-12-07 11:56:21,938 INFO L78 Accepts]: Start accepts. Automaton has 17768 states and 56388 transitions. Word has length 58 [2019-12-07 11:56:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:21,939 INFO L462 AbstractCegarLoop]: Abstraction has 17768 states and 56388 transitions. [2019-12-07 11:56:21,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:56:21,939 INFO L276 IsEmpty]: Start isEmpty. Operand 17768 states and 56388 transitions. [2019-12-07 11:56:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:21,955 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:21,955 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:21,955 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:21,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 619686549, now seen corresponding path program 7 times [2019-12-07 11:56:21,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:21,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127991535] [2019-12-07 11:56:21,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:22,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:22,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127991535] [2019-12-07 11:56:22,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:22,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:56:22,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284815396] [2019-12-07 11:56:22,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:56:22,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:22,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:56:22,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:56:22,156 INFO L87 Difference]: Start difference. First operand 17768 states and 56388 transitions. Second operand 13 states. [2019-12-07 11:56:23,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:23,375 INFO L93 Difference]: Finished difference Result 40000 states and 122532 transitions. [2019-12-07 11:56:23,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-07 11:56:23,376 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 58 [2019-12-07 11:56:23,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:23,420 INFO L225 Difference]: With dead ends: 40000 [2019-12-07 11:56:23,420 INFO L226 Difference]: Without dead ends: 37364 [2019-12-07 11:56:23,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=859, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 11:56:23,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37364 states. [2019-12-07 11:56:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37364 to 19530. [2019-12-07 11:56:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19530 states. [2019-12-07 11:56:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19530 states to 19530 states and 61663 transitions. [2019-12-07 11:56:23,814 INFO L78 Accepts]: Start accepts. Automaton has 19530 states and 61663 transitions. Word has length 58 [2019-12-07 11:56:23,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:23,814 INFO L462 AbstractCegarLoop]: Abstraction has 19530 states and 61663 transitions. [2019-12-07 11:56:23,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:56:23,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19530 states and 61663 transitions. [2019-12-07 11:56:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:23,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:23,832 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:23,832 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:23,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:23,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1333145861, now seen corresponding path program 8 times [2019-12-07 11:56:23,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:23,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446108299] [2019-12-07 11:56:23,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:23,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:23,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446108299] [2019-12-07 11:56:23,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:23,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:56:23,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469796053] [2019-12-07 11:56:23,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:56:23,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:23,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:56:23,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:56:23,913 INFO L87 Difference]: Start difference. First operand 19530 states and 61663 transitions. Second operand 9 states. [2019-12-07 11:56:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:24,715 INFO L93 Difference]: Finished difference Result 71805 states and 221027 transitions. [2019-12-07 11:56:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:56:24,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 11:56:24,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:24,806 INFO L225 Difference]: With dead ends: 71805 [2019-12-07 11:56:24,806 INFO L226 Difference]: Without dead ends: 69317 [2019-12-07 11:56:24,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2019-12-07 11:56:24,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69317 states. [2019-12-07 11:56:25,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69317 to 20343. [2019-12-07 11:56:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20343 states. [2019-12-07 11:56:25,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20343 states to 20343 states and 64615 transitions. [2019-12-07 11:56:25,469 INFO L78 Accepts]: Start accepts. Automaton has 20343 states and 64615 transitions. Word has length 58 [2019-12-07 11:56:25,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:25,469 INFO L462 AbstractCegarLoop]: Abstraction has 20343 states and 64615 transitions. [2019-12-07 11:56:25,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:56:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20343 states and 64615 transitions. [2019-12-07 11:56:25,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:25,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:25,487 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:25,487 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:25,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:25,487 INFO L82 PathProgramCache]: Analyzing trace with hash -267603253, now seen corresponding path program 9 times [2019-12-07 11:56:25,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:25,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929299278] [2019-12-07 11:56:25,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:25,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929299278] [2019-12-07 11:56:25,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:25,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:56:25,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547592780] [2019-12-07 11:56:25,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:56:25,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:25,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:56:25,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:56:25,550 INFO L87 Difference]: Start difference. First operand 20343 states and 64615 transitions. Second operand 9 states. [2019-12-07 11:56:26,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:26,298 INFO L93 Difference]: Finished difference Result 55249 states and 171127 transitions. [2019-12-07 11:56:26,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 11:56:26,299 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-07 11:56:26,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:26,369 INFO L225 Difference]: With dead ends: 55249 [2019-12-07 11:56:26,369 INFO L226 Difference]: Without dead ends: 51707 [2019-12-07 11:56:26,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=703, Unknown=0, NotChecked=0, Total=930 [2019-12-07 11:56:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51707 states. [2019-12-07 11:56:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51707 to 19919. [2019-12-07 11:56:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19919 states. [2019-12-07 11:56:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19919 states to 19919 states and 63100 transitions. [2019-12-07 11:56:26,900 INFO L78 Accepts]: Start accepts. Automaton has 19919 states and 63100 transitions. Word has length 58 [2019-12-07 11:56:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:26,900 INFO L462 AbstractCegarLoop]: Abstraction has 19919 states and 63100 transitions. [2019-12-07 11:56:26,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:56:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 19919 states and 63100 transitions. [2019-12-07 11:56:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 11:56:26,919 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:26,919 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:26,919 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1293645985, now seen corresponding path program 10 times [2019-12-07 11:56:26,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:26,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304580697] [2019-12-07 11:56:26,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:26,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304580697] [2019-12-07 11:56:26,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:26,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:56:26,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938508056] [2019-12-07 11:56:26,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:56:26,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:26,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:56:26,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:56:26,950 INFO L87 Difference]: Start difference. First operand 19919 states and 63100 transitions. Second operand 3 states. [2019-12-07 11:56:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:26,995 INFO L93 Difference]: Finished difference Result 15961 states and 49344 transitions. [2019-12-07 11:56:26,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:56:26,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 11:56:26,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:27,014 INFO L225 Difference]: With dead ends: 15961 [2019-12-07 11:56:27,014 INFO L226 Difference]: Without dead ends: 15961 [2019-12-07 11:56:27,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-12-07 11:56:27,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15961 states. [2019-12-07 11:56:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15961 to 15298. [2019-12-07 11:56:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15298 states. [2019-12-07 11:56:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15298 states to 15298 states and 47228 transitions. [2019-12-07 11:56:27,228 INFO L78 Accepts]: Start accepts. Automaton has 15298 states and 47228 transitions. Word has length 58 [2019-12-07 11:56:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:27,228 INFO L462 AbstractCegarLoop]: Abstraction has 15298 states and 47228 transitions. [2019-12-07 11:56:27,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:56:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 15298 states and 47228 transitions. [2019-12-07 11:56:27,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:27,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:27,242 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:27,242 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash 530809076, now seen corresponding path program 1 times [2019-12-07 11:56:27,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:27,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300689747] [2019-12-07 11:56:27,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:27,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:27,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300689747] [2019-12-07 11:56:27,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:27,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:56:27,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882878996] [2019-12-07 11:56:27,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:56:27,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:27,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:56:27,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:56:27,542 INFO L87 Difference]: Start difference. First operand 15298 states and 47228 transitions. Second operand 16 states. [2019-12-07 11:56:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:30,721 INFO L93 Difference]: Finished difference Result 29359 states and 89131 transitions. [2019-12-07 11:56:30,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 11:56:30,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-07 11:56:30,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:30,756 INFO L225 Difference]: With dead ends: 29359 [2019-12-07 11:56:30,756 INFO L226 Difference]: Without dead ends: 21261 [2019-12-07 11:56:30,757 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=204, Invalid=986, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 11:56:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21261 states. [2019-12-07 11:56:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21261 to 16668. [2019-12-07 11:56:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16668 states. [2019-12-07 11:56:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16668 states to 16668 states and 51335 transitions. [2019-12-07 11:56:31,013 INFO L78 Accepts]: Start accepts. Automaton has 16668 states and 51335 transitions. Word has length 59 [2019-12-07 11:56:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:31,013 INFO L462 AbstractCegarLoop]: Abstraction has 16668 states and 51335 transitions. [2019-12-07 11:56:31,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:56:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 16668 states and 51335 transitions. [2019-12-07 11:56:31,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:31,027 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:31,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:31,028 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1625337432, now seen corresponding path program 2 times [2019-12-07 11:56:31,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:31,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537004441] [2019-12-07 11:56:31,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:31,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:31,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537004441] [2019-12-07 11:56:31,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:31,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 11:56:31,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530435078] [2019-12-07 11:56:31,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:56:31,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:31,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:56:31,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:56:31,308 INFO L87 Difference]: Start difference. First operand 16668 states and 51335 transitions. Second operand 16 states. [2019-12-07 11:56:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:33,683 INFO L93 Difference]: Finished difference Result 28252 states and 85446 transitions. [2019-12-07 11:56:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-12-07 11:56:33,684 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-07 11:56:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:33,704 INFO L225 Difference]: With dead ends: 28252 [2019-12-07 11:56:33,705 INFO L226 Difference]: Without dead ends: 20685 [2019-12-07 11:56:33,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=377, Invalid=1879, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 11:56:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20685 states. [2019-12-07 11:56:33,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20685 to 16304. [2019-12-07 11:56:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16304 states. [2019-12-07 11:56:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16304 states to 16304 states and 50261 transitions. [2019-12-07 11:56:33,947 INFO L78 Accepts]: Start accepts. Automaton has 16304 states and 50261 transitions. Word has length 59 [2019-12-07 11:56:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:33,947 INFO L462 AbstractCegarLoop]: Abstraction has 16304 states and 50261 transitions. [2019-12-07 11:56:33,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:56:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16304 states and 50261 transitions. [2019-12-07 11:56:33,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:33,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:33,961 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:33,961 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:33,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1911038550, now seen corresponding path program 3 times [2019-12-07 11:56:33,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:33,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384932233] [2019-12-07 11:56:33,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:33,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:34,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:34,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384932233] [2019-12-07 11:56:34,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:34,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:56:34,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109109038] [2019-12-07 11:56:34,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:56:34,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:34,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:56:34,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:56:34,048 INFO L87 Difference]: Start difference. First operand 16304 states and 50261 transitions. Second operand 10 states. [2019-12-07 11:56:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:34,746 INFO L93 Difference]: Finished difference Result 26862 states and 82191 transitions. [2019-12-07 11:56:34,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:56:34,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-07 11:56:34,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:34,768 INFO L225 Difference]: With dead ends: 26862 [2019-12-07 11:56:34,769 INFO L226 Difference]: Without dead ends: 20785 [2019-12-07 11:56:34,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:56:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20785 states. [2019-12-07 11:56:34,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20785 to 16776. [2019-12-07 11:56:34,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16776 states. [2019-12-07 11:56:35,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16776 states to 16776 states and 51261 transitions. [2019-12-07 11:56:35,015 INFO L78 Accepts]: Start accepts. Automaton has 16776 states and 51261 transitions. Word has length 59 [2019-12-07 11:56:35,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:35,016 INFO L462 AbstractCegarLoop]: Abstraction has 16776 states and 51261 transitions. [2019-12-07 11:56:35,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:56:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 16776 states and 51261 transitions. [2019-12-07 11:56:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:35,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:35,030 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:35,030 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:35,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:35,030 INFO L82 PathProgramCache]: Analyzing trace with hash -71911370, now seen corresponding path program 4 times [2019-12-07 11:56:35,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:35,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885881143] [2019-12-07 11:56:35,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:35,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:35,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885881143] [2019-12-07 11:56:35,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:35,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:56:35,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585465861] [2019-12-07 11:56:35,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:56:35,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:35,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:56:35,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:56:35,133 INFO L87 Difference]: Start difference. First operand 16776 states and 51261 transitions. Second operand 11 states. [2019-12-07 11:56:35,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:35,870 INFO L93 Difference]: Finished difference Result 23965 states and 72701 transitions. [2019-12-07 11:56:35,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:56:35,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 11:56:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:35,892 INFO L225 Difference]: With dead ends: 23965 [2019-12-07 11:56:35,892 INFO L226 Difference]: Without dead ends: 19321 [2019-12-07 11:56:35,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2019-12-07 11:56:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19321 states. [2019-12-07 11:56:36,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19321 to 16434. [2019-12-07 11:56:36,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16434 states. [2019-12-07 11:56:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16434 states to 16434 states and 50197 transitions. [2019-12-07 11:56:36,129 INFO L78 Accepts]: Start accepts. Automaton has 16434 states and 50197 transitions. Word has length 59 [2019-12-07 11:56:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:36,129 INFO L462 AbstractCegarLoop]: Abstraction has 16434 states and 50197 transitions. [2019-12-07 11:56:36,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:56:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 16434 states and 50197 transitions. [2019-12-07 11:56:36,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:36,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:36,143 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:36,143 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:36,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:36,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1658578216, now seen corresponding path program 5 times [2019-12-07 11:56:36,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:36,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037502130] [2019-12-07 11:56:36,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:36,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:36,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037502130] [2019-12-07 11:56:36,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:36,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:56:36,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984036336] [2019-12-07 11:56:36,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:56:36,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:36,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:56:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:56:36,238 INFO L87 Difference]: Start difference. First operand 16434 states and 50197 transitions. Second operand 10 states. [2019-12-07 11:56:37,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:37,272 INFO L93 Difference]: Finished difference Result 35787 states and 109341 transitions. [2019-12-07 11:56:37,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 11:56:37,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2019-12-07 11:56:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:37,315 INFO L225 Difference]: With dead ends: 35787 [2019-12-07 11:56:37,315 INFO L226 Difference]: Without dead ends: 25782 [2019-12-07 11:56:37,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=886, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 11:56:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25782 states. [2019-12-07 11:56:37,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25782 to 16788. [2019-12-07 11:56:37,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16788 states. [2019-12-07 11:56:37,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16788 states to 16788 states and 50902 transitions. [2019-12-07 11:56:37,607 INFO L78 Accepts]: Start accepts. Automaton has 16788 states and 50902 transitions. Word has length 59 [2019-12-07 11:56:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:37,607 INFO L462 AbstractCegarLoop]: Abstraction has 16788 states and 50902 transitions. [2019-12-07 11:56:37,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:56:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16788 states and 50902 transitions. [2019-12-07 11:56:37,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:37,622 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:37,622 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:37,622 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:37,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1816631088, now seen corresponding path program 6 times [2019-12-07 11:56:37,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:37,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304474385] [2019-12-07 11:56:37,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:37,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304474385] [2019-12-07 11:56:37,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:37,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:56:37,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925594336] [2019-12-07 11:56:37,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:56:37,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:37,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:56:37,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:56:37,725 INFO L87 Difference]: Start difference. First operand 16788 states and 50902 transitions. Second operand 11 states. [2019-12-07 11:56:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:38,290 INFO L93 Difference]: Finished difference Result 28823 states and 87042 transitions. [2019-12-07 11:56:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:56:38,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-07 11:56:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:38,315 INFO L225 Difference]: With dead ends: 28823 [2019-12-07 11:56:38,315 INFO L226 Difference]: Without dead ends: 24218 [2019-12-07 11:56:38,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:56:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24218 states. [2019-12-07 11:56:38,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24218 to 16376. [2019-12-07 11:56:38,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16376 states. [2019-12-07 11:56:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16376 states to 16376 states and 49510 transitions. [2019-12-07 11:56:38,591 INFO L78 Accepts]: Start accepts. Automaton has 16376 states and 49510 transitions. Word has length 59 [2019-12-07 11:56:38,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:38,591 INFO L462 AbstractCegarLoop]: Abstraction has 16376 states and 49510 transitions. [2019-12-07 11:56:38,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:56:38,591 INFO L276 IsEmpty]: Start isEmpty. Operand 16376 states and 49510 transitions. [2019-12-07 11:56:38,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:38,605 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:38,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:38,605 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash -152494338, now seen corresponding path program 7 times [2019-12-07 11:56:38,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:38,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606206008] [2019-12-07 11:56:38,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:56:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:56:38,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606206008] [2019-12-07 11:56:38,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:56:38,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:56:38,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443573110] [2019-12-07 11:56:38,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 11:56:38,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:56:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 11:56:38,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:56:38,742 INFO L87 Difference]: Start difference. First operand 16376 states and 49510 transitions. Second operand 13 states. [2019-12-07 11:56:39,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:56:39,636 INFO L93 Difference]: Finished difference Result 18418 states and 54828 transitions. [2019-12-07 11:56:39,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 11:56:39,637 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-07 11:56:39,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:56:39,655 INFO L225 Difference]: With dead ends: 18418 [2019-12-07 11:56:39,655 INFO L226 Difference]: Without dead ends: 17498 [2019-12-07 11:56:39,655 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:56:39,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17498 states. [2019-12-07 11:56:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17498 to 15722. [2019-12-07 11:56:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15722 states. [2019-12-07 11:56:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15722 states to 15722 states and 47723 transitions. [2019-12-07 11:56:39,875 INFO L78 Accepts]: Start accepts. Automaton has 15722 states and 47723 transitions. Word has length 59 [2019-12-07 11:56:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:56:39,875 INFO L462 AbstractCegarLoop]: Abstraction has 15722 states and 47723 transitions. [2019-12-07 11:56:39,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 11:56:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 15722 states and 47723 transitions. [2019-12-07 11:56:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 11:56:39,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:56:39,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:56:39,889 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:56:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:56:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash -300648998, now seen corresponding path program 8 times [2019-12-07 11:56:39,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:56:39,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513842371] [2019-12-07 11:56:39,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:56:39,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:56:39,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:56:39,948 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:56:39,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_42| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= v_~__unbuffered_cnt~0_174 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42|) |v_ULTIMATE.start_main_~#t453~0.offset_27| 0))) (= v_~main$tmp_guard1~0_51 0) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_27|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_42|) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42|) 0) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42| 1)) (= v_~y$w_buff1_used~0_540 0) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_24|, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_42|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_34|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:56:39,951 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-07 11:56:39,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-07 11:56:39,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out2100101918| (ite (not (and (not (= 0 (mod ~y$w_buff0_used~0_Out2100101918 256))) (not (= 0 (mod ~y$w_buff1_used~0_Out2100101918 256))))) 1 0)) (= ~y$w_buff1_used~0_Out2100101918 ~y$w_buff0_used~0_In2100101918) (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out2100101918| P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out2100101918) (= 1 ~y$w_buff0~0_Out2100101918) (= 1 ~y$w_buff0_used~0_Out2100101918) (not (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out2100101918 0)) (= P2Thread1of1ForFork3_~arg.offset_Out2100101918 |P2Thread1of1ForFork3_#in~arg.offset_In2100101918|) (= |P2Thread1of1ForFork3_#in~arg.base_In2100101918| P2Thread1of1ForFork3_~arg.base_Out2100101918) (= ~y$w_buff1~0_Out2100101918 ~y$w_buff0~0_In2100101918)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2100101918, ~y$w_buff0~0=~y$w_buff0~0_In2100101918, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In2100101918|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In2100101918|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out2100101918, ~y$w_buff1~0=~y$w_buff1~0_Out2100101918, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out2100101918|, ~y$w_buff0~0=~y$w_buff0~0_Out2100101918, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out2100101918, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out2100101918, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In2100101918|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out2100101918, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In2100101918|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out2100101918} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:56:39,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-07 11:56:39,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~a~0_19 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:56:39,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-893433790 256))) (.cse2 (= |P3Thread1of1ForFork0_#t~ite33_Out-893433790| |P3Thread1of1ForFork0_#t~ite32_Out-893433790|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-893433790 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-893433790 |P3Thread1of1ForFork0_#t~ite32_Out-893433790|) .cse2) (and (= ~y$w_buff1~0_In-893433790 |P3Thread1of1ForFork0_#t~ite32_Out-893433790|) (not .cse0) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-893433790, ~y$w_buff1~0=~y$w_buff1~0_In-893433790, ~y~0=~y~0_In-893433790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893433790} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-893433790, ~y$w_buff1~0=~y$w_buff1~0_In-893433790, ~y~0=~y~0_In-893433790, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-893433790|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-893433790|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893433790} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 11:56:39,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In996159656 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In996159656 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out996159656| 0)) (and (= ~y$w_buff0_used~0_In996159656 |P2Thread1of1ForFork3_#t~ite28_Out996159656|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In996159656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In996159656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In996159656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In996159656, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out996159656|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 11:56:39,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In186478008 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In186478008 256) 0))) (or (and (= ~y$w_buff0_used~0_In186478008 |P3Thread1of1ForFork0_#t~ite34_Out186478008|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out186478008|) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In186478008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In186478008} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In186478008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In186478008, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out186478008|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 11:56:39,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1626816848 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1626816848 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-1626816848 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1626816848 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1626816848 |P2Thread1of1ForFork3_#t~ite29_Out-1626816848|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1626816848|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1626816848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1626816848, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1626816848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1626816848} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1626816848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1626816848, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1626816848, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1626816848|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1626816848} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 11:56:39,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In503999780 256) 0))) (or (and (= ~y$w_buff0~0_In503999780 |P1Thread1of1ForFork2_#t~ite9_Out503999780|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In503999780| |P1Thread1of1ForFork2_#t~ite8_Out503999780|)) (and (= ~y$w_buff0~0_In503999780 |P1Thread1of1ForFork2_#t~ite8_Out503999780|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In503999780 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In503999780 256))) (= 0 (mod ~y$w_buff0_used~0_In503999780 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In503999780 256))))) (= |P1Thread1of1ForFork2_#t~ite9_Out503999780| |P1Thread1of1ForFork2_#t~ite8_Out503999780|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In503999780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In503999780, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In503999780|, ~y$w_buff0~0=~y$w_buff0~0_In503999780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In503999780, ~weak$$choice2~0=~weak$$choice2~0_In503999780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503999780} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In503999780, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out503999780|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In503999780, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out503999780|, ~y$w_buff0~0=~y$w_buff0~0_In503999780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In503999780, ~weak$$choice2~0=~weak$$choice2~0_In503999780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503999780} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:56:39,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-370793076 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-370793076 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_Out-370793076 ~y$r_buff0_thd3~0_In-370793076))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd3~0_Out-370793076 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-370793076, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-370793076} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-370793076|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-370793076, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-370793076} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:56:39,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In812081413 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In812081413 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In812081413 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In812081413 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out812081413|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In812081413 |P2Thread1of1ForFork3_#t~ite31_Out812081413|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In812081413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In812081413, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In812081413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In812081413} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In812081413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In812081413, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In812081413, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out812081413|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In812081413} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 11:56:39,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_57) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:56:39,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In269877454 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In269877454 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In269877454 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In269877454 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out269877454| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite35_Out269877454| ~y$w_buff1_used~0_In269877454)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In269877454, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In269877454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In269877454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In269877454} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In269877454, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In269877454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In269877454, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out269877454|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In269877454} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 11:56:39,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1797126965 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1797126965 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-1797126965| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-1797126965| ~y$r_buff0_thd4~0_In-1797126965)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1797126965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797126965} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1797126965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797126965, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1797126965|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 11:56:39,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-123333600 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-123333600 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-123333600 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-123333600 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-123333600|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-123333600| ~y$r_buff1_thd4~0_In-123333600)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-123333600, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-123333600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123333600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123333600} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-123333600, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-123333600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123333600, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-123333600|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123333600} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 11:56:39,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_34| v_~y$r_buff1_thd4~0_55) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_33|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:56:39,959 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In360740821 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In360740821 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In360740821 256))) (and (= 0 (mod ~y$w_buff1_used~0_In360740821 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In360740821 256)))) .cse1 (= ~y$w_buff1~0_In360740821 |P1Thread1of1ForFork2_#t~ite11_Out360740821|) (= |P1Thread1of1ForFork2_#t~ite11_Out360740821| |P1Thread1of1ForFork2_#t~ite12_Out360740821|)) (and (not .cse1) (= ~y$w_buff1~0_In360740821 |P1Thread1of1ForFork2_#t~ite12_Out360740821|) (= |P1Thread1of1ForFork2_#t~ite11_In360740821| |P1Thread1of1ForFork2_#t~ite11_Out360740821|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In360740821, ~y$w_buff1~0=~y$w_buff1~0_In360740821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In360740821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In360740821, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In360740821|, ~weak$$choice2~0=~weak$$choice2~0_In360740821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360740821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In360740821, ~y$w_buff1~0=~y$w_buff1~0_In360740821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In360740821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In360740821, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out360740821|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out360740821|, ~weak$$choice2~0=~weak$$choice2~0_In360740821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360740821} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:56:39,960 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1065885849 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1065885849 |P1Thread1of1ForFork2_#t~ite15_Out-1065885849|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-1065885849| |P1Thread1of1ForFork2_#t~ite14_Out-1065885849|)) (and .cse0 (= ~y$w_buff0_used~0_In-1065885849 |P1Thread1of1ForFork2_#t~ite14_Out-1065885849|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1065885849 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1065885849 256))) (= (mod ~y$w_buff0_used~0_In-1065885849 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1065885849 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite15_Out-1065885849| |P1Thread1of1ForFork2_#t~ite14_Out-1065885849|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1065885849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065885849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1065885849, ~weak$$choice2~0=~weak$$choice2~0_In-1065885849, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1065885849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1065885849} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1065885849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065885849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1065885849, ~weak$$choice2~0=~weak$$choice2~0_In-1065885849, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1065885849|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1065885849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1065885849} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 11:56:39,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:56:39,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-446389490 256)))) (or (and (= ~y$r_buff1_thd2~0_In-446389490 |P1Thread1of1ForFork2_#t~ite24_Out-446389490|) (= |P1Thread1of1ForFork2_#t~ite23_In-446389490| |P1Thread1of1ForFork2_#t~ite23_Out-446389490|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-446389490 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-446389490 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-446389490 256))) (= 0 (mod ~y$w_buff0_used~0_In-446389490 256)))) (= |P1Thread1of1ForFork2_#t~ite23_Out-446389490| |P1Thread1of1ForFork2_#t~ite24_Out-446389490|) .cse0 (= ~y$r_buff1_thd2~0_In-446389490 |P1Thread1of1ForFork2_#t~ite23_Out-446389490|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-446389490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-446389490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-446389490, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-446389490|, ~weak$$choice2~0=~weak$$choice2~0_In-446389490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-446389490} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-446389490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-446389490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-446389490, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-446389490|, ~weak$$choice2~0=~weak$$choice2~0_In-446389490, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-446389490|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-446389490} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 11:56:39,961 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:56:39,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_20) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:56:39,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1292803578 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1292803578 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1292803578 |ULTIMATE.start_main_#t~ite42_Out-1292803578|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1292803578| ~y$w_buff1~0_In-1292803578)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1292803578, ~y~0=~y~0_In-1292803578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1292803578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1292803578} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1292803578, ~y~0=~y~0_In-1292803578, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1292803578|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1292803578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1292803578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:56:39,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:56:39,962 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-367754904 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-367754904 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-367754904| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-367754904| ~y$w_buff0_used~0_In-367754904) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-367754904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367754904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-367754904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367754904, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-367754904|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:56:39,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1878956002 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1878956002 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1878956002 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1878956002 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1878956002| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out1878956002| ~y$w_buff1_used~0_In1878956002)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1878956002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1878956002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1878956002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878956002} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1878956002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1878956002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1878956002, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1878956002|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878956002} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:56:39,963 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-345082436 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-345082436 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-345082436|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-345082436 |ULTIMATE.start_main_#t~ite46_Out-345082436|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-345082436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-345082436} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-345082436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-345082436, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-345082436|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:56:39,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1851961097 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1851961097 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1851961097 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1851961097 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1851961097 |ULTIMATE.start_main_#t~ite47_Out1851961097|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite47_Out1851961097|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1851961097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1851961097, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851961097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851961097} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1851961097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1851961097, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1851961097|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851961097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851961097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 11:56:39,964 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_29) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:56:40,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:56:40 BasicIcfg [2019-12-07 11:56:40,015 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:56:40,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:56:40,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:56:40,015 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:56:40,016 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:53:07" (3/4) ... [2019-12-07 11:56:40,017 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:56:40,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_42| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= v_~__unbuffered_cnt~0_174 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42|) |v_ULTIMATE.start_main_~#t453~0.offset_27| 0))) (= v_~main$tmp_guard1~0_51 0) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_27|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_42|) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42|) 0) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42| 1)) (= v_~y$w_buff1_used~0_540 0) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_24|, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_42|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_34|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:56:40,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-07 11:56:40,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-07 11:56:40,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out2100101918| (ite (not (and (not (= 0 (mod ~y$w_buff0_used~0_Out2100101918 256))) (not (= 0 (mod ~y$w_buff1_used~0_Out2100101918 256))))) 1 0)) (= ~y$w_buff1_used~0_Out2100101918 ~y$w_buff0_used~0_In2100101918) (= |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out2100101918| P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out2100101918) (= 1 ~y$w_buff0~0_Out2100101918) (= 1 ~y$w_buff0_used~0_Out2100101918) (not (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out2100101918 0)) (= P2Thread1of1ForFork3_~arg.offset_Out2100101918 |P2Thread1of1ForFork3_#in~arg.offset_In2100101918|) (= |P2Thread1of1ForFork3_#in~arg.base_In2100101918| P2Thread1of1ForFork3_~arg.base_Out2100101918) (= ~y$w_buff1~0_Out2100101918 ~y$w_buff0~0_In2100101918)) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2100101918, ~y$w_buff0~0=~y$w_buff0~0_In2100101918, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In2100101918|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In2100101918|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out2100101918, ~y$w_buff1~0=~y$w_buff1~0_Out2100101918, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out2100101918|, ~y$w_buff0~0=~y$w_buff0~0_Out2100101918, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out2100101918, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out2100101918, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In2100101918|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out2100101918, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In2100101918|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out2100101918} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 11:56:40,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-07 11:56:40,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_13) (= v_P0Thread1of1ForFork1_~arg.offset_13 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= v_~a~0_19 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_13} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 11:56:40,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-893433790 256))) (.cse2 (= |P3Thread1of1ForFork0_#t~ite33_Out-893433790| |P3Thread1of1ForFork0_#t~ite32_Out-893433790|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-893433790 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-893433790 |P3Thread1of1ForFork0_#t~ite32_Out-893433790|) .cse2) (and (= ~y$w_buff1~0_In-893433790 |P3Thread1of1ForFork0_#t~ite32_Out-893433790|) (not .cse0) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-893433790, ~y$w_buff1~0=~y$w_buff1~0_In-893433790, ~y~0=~y~0_In-893433790, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893433790} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-893433790, ~y$w_buff1~0=~y$w_buff1~0_In-893433790, ~y~0=~y~0_In-893433790, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-893433790|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-893433790|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-893433790} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 11:56:40,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In996159656 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In996159656 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out996159656| 0)) (and (= ~y$w_buff0_used~0_In996159656 |P2Thread1of1ForFork3_#t~ite28_Out996159656|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In996159656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In996159656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In996159656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In996159656, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out996159656|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 11:56:40,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In186478008 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In186478008 256) 0))) (or (and (= ~y$w_buff0_used~0_In186478008 |P3Thread1of1ForFork0_#t~ite34_Out186478008|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out186478008|) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In186478008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In186478008} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In186478008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In186478008, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out186478008|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 11:56:40,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-1626816848 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1626816848 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-1626816848 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1626816848 256) 0))) (or (and (= ~y$w_buff1_used~0_In-1626816848 |P2Thread1of1ForFork3_#t~ite29_Out-1626816848|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-1626816848|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1626816848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1626816848, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1626816848, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1626816848} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1626816848, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1626816848, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1626816848, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-1626816848|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1626816848} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 11:56:40,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In503999780 256) 0))) (or (and (= ~y$w_buff0~0_In503999780 |P1Thread1of1ForFork2_#t~ite9_Out503999780|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In503999780| |P1Thread1of1ForFork2_#t~ite8_Out503999780|)) (and (= ~y$w_buff0~0_In503999780 |P1Thread1of1ForFork2_#t~ite8_Out503999780|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In503999780 256) 0))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In503999780 256))) (= 0 (mod ~y$w_buff0_used~0_In503999780 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In503999780 256))))) (= |P1Thread1of1ForFork2_#t~ite9_Out503999780| |P1Thread1of1ForFork2_#t~ite8_Out503999780|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In503999780, ~y$w_buff0_used~0=~y$w_buff0_used~0_In503999780, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In503999780|, ~y$w_buff0~0=~y$w_buff0~0_In503999780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In503999780, ~weak$$choice2~0=~weak$$choice2~0_In503999780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503999780} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In503999780, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out503999780|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In503999780, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out503999780|, ~y$w_buff0~0=~y$w_buff0~0_In503999780, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In503999780, ~weak$$choice2~0=~weak$$choice2~0_In503999780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In503999780} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 11:56:40,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-370793076 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-370793076 256) 0)) (.cse1 (= ~y$r_buff0_thd3~0_Out-370793076 ~y$r_buff0_thd3~0_In-370793076))) (or (and .cse0 .cse1) (and (not .cse2) (= ~y$r_buff0_thd3~0_Out-370793076 0) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-370793076, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-370793076} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-370793076|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-370793076, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-370793076} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 11:56:40,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In812081413 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In812081413 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In812081413 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In812081413 256) 0))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out812081413|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In812081413 |P2Thread1of1ForFork3_#t~ite31_Out812081413|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In812081413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In812081413, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In812081413, ~y$w_buff1_used~0=~y$w_buff1_used~0_In812081413} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In812081413, ~y$w_buff0_used~0=~y$w_buff0_used~0_In812081413, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In812081413, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out812081413|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In812081413} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 11:56:40,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_38| v_~y$r_buff1_thd3~0_57) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 11:56:40,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In269877454 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In269877454 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In269877454 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In269877454 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite35_Out269877454| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite35_Out269877454| ~y$w_buff1_used~0_In269877454)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In269877454, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In269877454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In269877454, ~y$w_buff1_used~0=~y$w_buff1_used~0_In269877454} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In269877454, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In269877454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In269877454, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out269877454|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In269877454} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 11:56:40,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-1797126965 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1797126965 256) 0))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-1797126965| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite36_Out-1797126965| ~y$r_buff0_thd4~0_In-1797126965)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1797126965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797126965} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1797126965, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1797126965, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1797126965|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 11:56:40,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-123333600 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In-123333600 256))) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-123333600 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-123333600 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-123333600|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork0_#t~ite37_Out-123333600| ~y$r_buff1_thd4~0_In-123333600)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-123333600, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-123333600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123333600, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123333600} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-123333600, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-123333600, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-123333600, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-123333600|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-123333600} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 11:56:40,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_34| v_~y$r_buff1_thd4~0_55) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_33|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:56:40,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In360740821 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In360740821 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In360740821 256))) (and (= 0 (mod ~y$w_buff1_used~0_In360740821 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In360740821 256)))) .cse1 (= ~y$w_buff1~0_In360740821 |P1Thread1of1ForFork2_#t~ite11_Out360740821|) (= |P1Thread1of1ForFork2_#t~ite11_Out360740821| |P1Thread1of1ForFork2_#t~ite12_Out360740821|)) (and (not .cse1) (= ~y$w_buff1~0_In360740821 |P1Thread1of1ForFork2_#t~ite12_Out360740821|) (= |P1Thread1of1ForFork2_#t~ite11_In360740821| |P1Thread1of1ForFork2_#t~ite11_Out360740821|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In360740821, ~y$w_buff1~0=~y$w_buff1~0_In360740821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In360740821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In360740821, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In360740821|, ~weak$$choice2~0=~weak$$choice2~0_In360740821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360740821} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In360740821, ~y$w_buff1~0=~y$w_buff1~0_In360740821, ~y$w_buff0_used~0=~y$w_buff0_used~0_In360740821, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In360740821, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out360740821|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out360740821|, ~weak$$choice2~0=~weak$$choice2~0_In360740821, ~y$w_buff1_used~0=~y$w_buff1_used~0_In360740821} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:56:40,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1065885849 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1065885849 |P1Thread1of1ForFork2_#t~ite15_Out-1065885849|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-1065885849| |P1Thread1of1ForFork2_#t~ite14_Out-1065885849|)) (and .cse0 (= ~y$w_buff0_used~0_In-1065885849 |P1Thread1of1ForFork2_#t~ite14_Out-1065885849|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1065885849 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1065885849 256))) (= (mod ~y$w_buff0_used~0_In-1065885849 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1065885849 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite15_Out-1065885849| |P1Thread1of1ForFork2_#t~ite14_Out-1065885849|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1065885849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065885849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1065885849, ~weak$$choice2~0=~weak$$choice2~0_In-1065885849, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1065885849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1065885849} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1065885849, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1065885849, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1065885849, ~weak$$choice2~0=~weak$$choice2~0_In-1065885849, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1065885849|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1065885849|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1065885849} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 11:56:40,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:56:40,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-446389490 256)))) (or (and (= ~y$r_buff1_thd2~0_In-446389490 |P1Thread1of1ForFork2_#t~ite24_Out-446389490|) (= |P1Thread1of1ForFork2_#t~ite23_In-446389490| |P1Thread1of1ForFork2_#t~ite23_Out-446389490|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-446389490 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-446389490 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-446389490 256))) (= 0 (mod ~y$w_buff0_used~0_In-446389490 256)))) (= |P1Thread1of1ForFork2_#t~ite23_Out-446389490| |P1Thread1of1ForFork2_#t~ite24_Out-446389490|) .cse0 (= ~y$r_buff1_thd2~0_In-446389490 |P1Thread1of1ForFork2_#t~ite23_Out-446389490|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-446389490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-446389490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-446389490, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-446389490|, ~weak$$choice2~0=~weak$$choice2~0_In-446389490, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-446389490} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-446389490, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-446389490, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-446389490, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-446389490|, ~weak$$choice2~0=~weak$$choice2~0_In-446389490, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-446389490|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-446389490} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 11:56:40,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 11:56:40,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_20) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:56:40,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1292803578 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1292803578 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1292803578 |ULTIMATE.start_main_#t~ite42_Out-1292803578|)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-1292803578| ~y$w_buff1~0_In-1292803578)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1292803578, ~y~0=~y~0_In-1292803578, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1292803578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1292803578} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1292803578, ~y~0=~y~0_In-1292803578, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1292803578|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1292803578, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1292803578} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:56:40,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:56:40,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-367754904 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-367754904 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-367754904| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-367754904| ~y$w_buff0_used~0_In-367754904) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-367754904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367754904} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-367754904, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-367754904, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-367754904|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:56:40,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1878956002 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1878956002 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1878956002 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1878956002 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1878956002| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out1878956002| ~y$w_buff1_used~0_In1878956002)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1878956002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1878956002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1878956002, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878956002} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1878956002, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1878956002, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1878956002, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1878956002|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1878956002} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:56:40,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-345082436 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-345082436 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-345082436|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-345082436 |ULTIMATE.start_main_#t~ite46_Out-345082436|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-345082436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-345082436} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-345082436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-345082436, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-345082436|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:56:40,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In1851961097 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1851961097 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In1851961097 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1851961097 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In1851961097 |ULTIMATE.start_main_#t~ite47_Out1851961097|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite47_Out1851961097|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1851961097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1851961097, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851961097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851961097} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1851961097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1851961097, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1851961097|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1851961097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1851961097} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 11:56:40,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_29) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:56:40,080 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_aac99c32-4692-4c52-9036-2f3802594a7b/bin/uautomizer/witness.graphml [2019-12-07 11:56:40,080 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:56:40,081 INFO L168 Benchmark]: Toolchain (without parser) took 213452.99 ms. Allocated memory was 1.0 GB in the beginning and 7.9 GB in the end (delta: 6.9 GB). Free memory was 932.7 MB in the beginning and 6.0 GB in the end (delta: -5.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 11:56:40,082 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:40,082 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:40,082 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:40,082 INFO L168 Benchmark]: Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:56:40,083 INFO L168 Benchmark]: RCFGBuilder took 399.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:40,083 INFO L168 Benchmark]: TraceAbstraction took 212544.27 ms. Allocated memory was 1.1 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: -5.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 11:56:40,083 INFO L168 Benchmark]: Witness Printer took 65.36 ms. Allocated memory is still 7.9 GB. Free memory was 6.1 GB in the beginning and 6.0 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. [2019-12-07 11:56:40,084 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 932.7 MB in the beginning and 1.1 GB in the end (delta: -128.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.49 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 399.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 212544.27 ms. Allocated memory was 1.1 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: -5.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 65.36 ms. Allocated memory is still 7.9 GB. Free memory was 6.1 GB in the beginning and 6.0 GB in the end (delta: 47.9 MB). Peak memory consumption was 47.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 182 ProgramPointsBefore, 88 ProgramPointsAfterwards, 210 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 29 ChoiceCompositions, 7271 VarBasedMoverChecksPositive, 240 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 72619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 212.3s, OverallIterations: 35, TraceHistogramMax: 1, AutomataDifference: 49.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7028 SDtfs, 12218 SDslu, 26089 SDs, 0 SdLazy, 19557 SolverSat, 689 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 43 SyntacticMatches, 17 SemanticMatches, 456 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2616 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=272736occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 129.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 570612 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1470 NumberOfCodeBlocks, 1470 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 1377 ConstructedInterpolants, 0 QuantifiedInterpolants, 384558 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 0/0 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...