./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_power.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_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/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 8a12e820a88074900da255d7fe5ba4376f9d676a ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:06:58,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:06:58,978 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:06:58,985 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:06:58,985 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:06:58,986 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:06:58,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:06:58,988 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:06:58,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:06:58,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:06:58,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:06:58,991 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:06:58,991 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:06:58,992 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:06:58,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:06:58,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:06:58,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:06:58,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:06:58,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:06:58,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:06:58,999 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:06:59,000 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:06:59,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:06:59,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:06:59,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:06:59,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:06:59,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:06:59,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:06:59,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:06:59,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:06:59,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:06:59,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:06:59,005 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:06:59,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:06:59,006 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:06:59,006 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:06:59,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:06:59,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:06:59,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:06:59,007 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:06:59,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:06:59,008 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:06:59,017 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:06:59,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:06:59,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:06:59,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:06:59,018 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:06:59,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:06:59,018 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:06:59,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:06:59,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:06:59,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:06:59,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:06:59,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:06:59,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:06:59,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:06:59,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:06:59,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:06:59,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:06:59,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:06:59,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:06:59,021 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:06:59,021 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_e17659f0-68db-420a-b08e-ecce92917bdb/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 -> 8a12e820a88074900da255d7fe5ba4376f9d676a [2019-12-07 17:06:59,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:06:59,128 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:06:59,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:06:59,131 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:06:59,131 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:06:59,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr000_power.opt.i [2019-12-07 17:06:59,169 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/data/6443df47b/f8f87cc9ac0046cca64a2f59c03df914/FLAGcfa7a968a [2019-12-07 17:06:59,680 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:06:59,680 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/sv-benchmarks/c/pthread-wmm/podwr000_power.opt.i [2019-12-07 17:06:59,693 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/data/6443df47b/f8f87cc9ac0046cca64a2f59c03df914/FLAGcfa7a968a [2019-12-07 17:07:00,202 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/data/6443df47b/f8f87cc9ac0046cca64a2f59c03df914 [2019-12-07 17:07:00,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:07:00,205 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:07:00,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:00,206 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:07:00,209 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:07:00,210 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1654e0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00, skipping insertion in model container [2019-12-07 17:07:00,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:07:00,252 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:07:00,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:00,501 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:07:00,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:07:00,584 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:07:00,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00 WrapperNode [2019-12-07 17:07:00,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:07:00,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:07:00,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:07:00,585 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:07:00,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:07:00,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:07:00,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:07:00,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:07:00,627 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... [2019-12-07 17:07:00,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:07:00,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:07:00,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:07:00,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:07:00,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/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 17:07:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:07:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:07:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:07:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:07:00,688 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:07:00,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:07:00,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:07:00,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:07:00,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:07:00,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:07:00,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:07:00,689 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 17:07:01,010 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:07:01,010 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:07:01,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:07:01 BoogieIcfgContainer [2019-12-07 17:07:01,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:07:01,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:07:01,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:07:01,015 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:07:01,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:07:00" (1/3) ... [2019-12-07 17:07:01,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d348e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:07:01, skipping insertion in model container [2019-12-07 17:07:01,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:07:00" (2/3) ... [2019-12-07 17:07:01,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d348e2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:07:01, skipping insertion in model container [2019-12-07 17:07:01,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:07:01" (3/3) ... [2019-12-07 17:07:01,018 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_power.opt.i [2019-12-07 17:07:01,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:07:01,026 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:07:01,031 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:07:01,031 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:07:01,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:07:01,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 17:07:01,106 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:07:01,107 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:07:01,107 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:07:01,107 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:07:01,107 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:07:01,107 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:07:01,107 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:07:01,107 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:07:01,117 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 17:07:01,118 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:07:01,166 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:07:01,166 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:07:01,174 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:07:01,186 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 17:07:01,210 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 17:07:01,210 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:07:01,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 17:07:01,224 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 17:07:01,224 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:07:03,798 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 17:07:03,904 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 17:07:03,904 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 17:07:03,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 17:07:04,215 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 17:07:04,217 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 17:07:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:07:04,221 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:04,222 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:07:04,222 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:04,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:04,226 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 17:07:04,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:04,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380610965] [2019-12-07 17:07:04,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:04,402 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 17:07:04,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380610965] [2019-12-07 17:07:04,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:04,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:07:04,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124636967] [2019-12-07 17:07:04,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:04,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:04,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:04,418 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 17:07:04,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:04,608 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 17:07:04,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:04,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:07:04,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:04,668 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 17:07:04,668 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 17:07:04,669 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 17:07:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 17:07:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 17:07:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 17:07:04,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 17:07:04,938 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 17:07:04,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:04,939 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 17:07:04,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:04,939 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 17:07:04,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:07:04,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:04,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:04,942 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:04,942 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 17:07:04,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:04,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754629356] [2019-12-07 17:07:04,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:05,001 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 17:07:05,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754629356] [2019-12-07 17:07:05,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:05,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:07:05,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317310655] [2019-12-07 17:07:05,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:05,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:05,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:05,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:05,003 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 17:07:05,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:05,228 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 17:07:05,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:07:05,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:07:05,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:05,281 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 17:07:05,281 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 17:07:05,282 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 17:07:05,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 17:07:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 17:07:05,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 17:07:05,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 17:07:05,582 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 17:07:05,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:05,582 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 17:07:05,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:05,582 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 17:07:05,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 17:07:05,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:05,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:05,589 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 17:07:05,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:05,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689287812] [2019-12-07 17:07:05,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:05,657 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 17:07:05,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689287812] [2019-12-07 17:07:05,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:05,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:05,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872955447] [2019-12-07 17:07:05,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:07:05,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:05,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:07:05,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:07:05,659 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 17:07:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:05,883 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 17:07:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:07:05,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 17:07:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:05,913 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 17:07:05,913 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 17:07:05,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:07:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 17:07:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 17:07:06,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 17:07:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 17:07:06,156 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 17:07:06,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:06,157 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 17:07:06,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:07:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 17:07:06,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:07:06,159 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:06,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:06,160 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:06,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:06,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 17:07:06,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:06,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736348660] [2019-12-07 17:07:06,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:06,198 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 17:07:06,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736348660] [2019-12-07 17:07:06,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:06,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:07:06,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394361831] [2019-12-07 17:07:06,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:06,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:06,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:06,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:06,200 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-07 17:07:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:06,246 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-07 17:07:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:06,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 17:07:06,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:06,265 INFO L225 Difference]: With dead ends: 10750 [2019-12-07 17:07:06,265 INFO L226 Difference]: Without dead ends: 10750 [2019-12-07 17:07:06,265 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 17:07:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-07 17:07:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-07 17:07:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-07 17:07:06,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-07 17:07:06,484 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-07 17:07:06,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:06,485 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-07 17:07:06,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:06,485 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-07 17:07:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:07:06,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:06,487 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:07:06,487 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:06,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:06,487 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-07 17:07:06,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:06,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389264864] [2019-12-07 17:07:06,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:06,533 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 17:07:06,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389264864] [2019-12-07 17:07:06,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:06,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:06,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41405818] [2019-12-07 17:07:06,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:07:06,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:06,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:07:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:07:06,534 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-07 17:07:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:06,554 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-07 17:07:06,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:06,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 17:07:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:06,557 INFO L225 Difference]: With dead ends: 2054 [2019-12-07 17:07:06,557 INFO L226 Difference]: Without dead ends: 1457 [2019-12-07 17:07:06,557 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 17:07:06,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-07 17:07:06,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-07 17:07:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-07 17:07:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-07 17:07:06,572 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-07 17:07:06,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:06,572 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-07 17:07:06,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:07:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-07 17:07:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:07:06,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:06,573 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 17:07:06,574 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 17:07:06,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:06,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426498498] [2019-12-07 17:07:06,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:06,626 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 17:07:06,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426498498] [2019-12-07 17:07:06,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:06,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:06,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631215613] [2019-12-07 17:07:06,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:07:06,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:06,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:07:06,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:07:06,627 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-07 17:07:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:06,839 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-07 17:07:06,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:07:06,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 17:07:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:06,841 INFO L225 Difference]: With dead ends: 2249 [2019-12-07 17:07:06,841 INFO L226 Difference]: Without dead ends: 2197 [2019-12-07 17:07:06,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:07:06,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-07 17:07:06,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-07 17:07:06,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 17:07:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-07 17:07:06,861 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-07 17:07:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:06,861 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-07 17:07:06,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:07:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-07 17:07:06,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:07:06,863 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:06,863 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] [2019-12-07 17:07:06,864 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:06,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:06,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-07 17:07:06,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:06,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73593463] [2019-12-07 17:07:06,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:06,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:06,935 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 17:07:06,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73593463] [2019-12-07 17:07:06,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:06,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:06,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647490584] [2019-12-07 17:07:06,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:07:06,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:06,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:07:06,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:07:06,937 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-07 17:07:06,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:06,965 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-07 17:07:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:07:06,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 17:07:06,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:06,966 INFO L225 Difference]: With dead ends: 752 [2019-12-07 17:07:06,966 INFO L226 Difference]: Without dead ends: 689 [2019-12-07 17:07:06,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:07:06,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-07 17:07:06,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-07 17:07:06,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-07 17:07:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-07 17:07:06,973 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-07 17:07:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:06,973 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-07 17:07:06,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:07:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-07 17:07:06,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:07:06,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:06,975 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] [2019-12-07 17:07:06,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:06,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:06,975 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-07 17:07:06,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:06,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879364075] [2019-12-07 17:07:06,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:07,033 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 17:07:07,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879364075] [2019-12-07 17:07:07,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:07,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:07:07,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816164174] [2019-12-07 17:07:07,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:07:07,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:07:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:07:07,034 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-12-07 17:07:07,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:07,256 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-12-07 17:07:07,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:07:07,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 17:07:07,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:07,258 INFO L225 Difference]: With dead ends: 1105 [2019-12-07 17:07:07,258 INFO L226 Difference]: Without dead ends: 1105 [2019-12-07 17:07:07,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 17:07:07,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-12-07 17:07:07,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-12-07 17:07:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-07 17:07:07,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-12-07 17:07:07,269 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-12-07 17:07:07,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:07,270 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-12-07 17:07:07,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:07:07,270 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-12-07 17:07:07,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 17:07:07,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:07,271 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] [2019-12-07 17:07:07,271 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:07,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:07,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-12-07 17:07:07,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:07,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961056536] [2019-12-07 17:07:07,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:07,330 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 17:07:07,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961056536] [2019-12-07 17:07:07,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:07,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:07:07,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771831541] [2019-12-07 17:07:07,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:07,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:07,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:07,331 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-12-07 17:07:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:07,370 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-12-07 17:07:07,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:07,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 17:07:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:07,372 INFO L225 Difference]: With dead ends: 1184 [2019-12-07 17:07:07,372 INFO L226 Difference]: Without dead ends: 1184 [2019-12-07 17:07:07,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 17:07:07,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-07 17:07:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-12-07 17:07:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 17:07:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-12-07 17:07:07,381 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-12-07 17:07:07,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:07,381 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-12-07 17:07:07,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:07,381 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-12-07 17:07:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:07,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:07,383 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] [2019-12-07 17:07:07,383 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-12-07 17:07:07,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:07,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051613462] [2019-12-07 17:07:07,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:07,555 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 17:07:07,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051613462] [2019-12-07 17:07:07,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:07,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:07:07,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302491899] [2019-12-07 17:07:07,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:07:07,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:07,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:07:07,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:07:07,557 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 10 states. [2019-12-07 17:07:07,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:07,949 INFO L93 Difference]: Finished difference Result 2426 states and 5230 transitions. [2019-12-07 17:07:07,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:07:07,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-12-07 17:07:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:07,950 INFO L225 Difference]: With dead ends: 2426 [2019-12-07 17:07:07,950 INFO L226 Difference]: Without dead ends: 1445 [2019-12-07 17:07:07,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:07:07,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-12-07 17:07:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1196. [2019-12-07 17:07:07,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1196 states. [2019-12-07 17:07:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 2625 transitions. [2019-12-07 17:07:07,963 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 2625 transitions. Word has length 52 [2019-12-07 17:07:07,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:07,963 INFO L462 AbstractCegarLoop]: Abstraction has 1196 states and 2625 transitions. [2019-12-07 17:07:07,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:07:07,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 2625 transitions. [2019-12-07 17:07:07,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:07,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:07,966 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] [2019-12-07 17:07:07,966 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:07,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash -19134580, now seen corresponding path program 2 times [2019-12-07 17:07:07,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:07,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200025559] [2019-12-07 17:07:07,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:08,076 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 17:07:08,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200025559] [2019-12-07 17:07:08,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:08,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:07:08,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815276847] [2019-12-07 17:07:08,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:07:08,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:07:08,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:07:08,077 INFO L87 Difference]: Start difference. First operand 1196 states and 2625 transitions. Second operand 7 states. [2019-12-07 17:07:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:08,243 INFO L93 Difference]: Finished difference Result 3397 states and 7237 transitions. [2019-12-07 17:07:08,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:07:08,243 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:07:08,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:08,246 INFO L225 Difference]: With dead ends: 3397 [2019-12-07 17:07:08,246 INFO L226 Difference]: Without dead ends: 2347 [2019-12-07 17:07:08,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:07:08,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2347 states. [2019-12-07 17:07:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2347 to 1262. [2019-12-07 17:07:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1262 states. [2019-12-07 17:07:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 2755 transitions. [2019-12-07 17:07:08,260 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 2755 transitions. Word has length 52 [2019-12-07 17:07:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:08,260 INFO L462 AbstractCegarLoop]: Abstraction has 1262 states and 2755 transitions. [2019-12-07 17:07:08,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:07:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 2755 transitions. [2019-12-07 17:07:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:08,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:08,262 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] [2019-12-07 17:07:08,262 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1592609074, now seen corresponding path program 1 times [2019-12-07 17:07:08,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:08,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920331459] [2019-12-07 17:07:08,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:08,285 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 17:07:08,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920331459] [2019-12-07 17:07:08,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:08,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:07:08,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996837828] [2019-12-07 17:07:08,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:07:08,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:08,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:07:08,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:08,287 INFO L87 Difference]: Start difference. First operand 1262 states and 2755 transitions. Second operand 3 states. [2019-12-07 17:07:08,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:08,316 INFO L93 Difference]: Finished difference Result 1673 states and 3603 transitions. [2019-12-07 17:07:08,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:07:08,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 17:07:08,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:08,318 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 17:07:08,318 INFO L226 Difference]: Without dead ends: 1673 [2019-12-07 17:07:08,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:07:08,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-07 17:07:08,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1451. [2019-12-07 17:07:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2019-12-07 17:07:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 3160 transitions. [2019-12-07 17:07:08,338 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 3160 transitions. Word has length 52 [2019-12-07 17:07:08,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:08,338 INFO L462 AbstractCegarLoop]: Abstraction has 1451 states and 3160 transitions. [2019-12-07 17:07:08,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:07:08,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 3160 transitions. [2019-12-07 17:07:08,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:08,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:08,340 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] [2019-12-07 17:07:08,340 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:08,341 INFO L82 PathProgramCache]: Analyzing trace with hash -394116000, now seen corresponding path program 3 times [2019-12-07 17:07:08,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:08,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685579780] [2019-12-07 17:07:08,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:08,406 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 17:07:08,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685579780] [2019-12-07 17:07:08,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:08,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:07:08,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158953442] [2019-12-07 17:07:08,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:07:08,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:08,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:07:08,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:07:08,407 INFO L87 Difference]: Start difference. First operand 1451 states and 3160 transitions. Second operand 5 states. [2019-12-07 17:07:08,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:08,424 INFO L93 Difference]: Finished difference Result 1630 states and 3496 transitions. [2019-12-07 17:07:08,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:07:08,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 17:07:08,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:08,425 INFO L225 Difference]: With dead ends: 1630 [2019-12-07 17:07:08,425 INFO L226 Difference]: Without dead ends: 892 [2019-12-07 17:07:08,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:07:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2019-12-07 17:07:08,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2019-12-07 17:07:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2019-12-07 17:07:08,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1939 transitions. [2019-12-07 17:07:08,433 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1939 transitions. Word has length 52 [2019-12-07 17:07:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:08,433 INFO L462 AbstractCegarLoop]: Abstraction has 892 states and 1939 transitions. [2019-12-07 17:07:08,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:07:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1939 transitions. [2019-12-07 17:07:08,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:08,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:08,435 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] [2019-12-07 17:07:08,435 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:08,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:08,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 4 times [2019-12-07 17:07:08,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:08,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696478330] [2019-12-07 17:07:08,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:08,643 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 17:07:08,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696478330] [2019-12-07 17:07:08,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:08,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:07:08,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005172242] [2019-12-07 17:07:08,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:07:08,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:07:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:07:08,644 INFO L87 Difference]: Start difference. First operand 892 states and 1939 transitions. Second operand 13 states. [2019-12-07 17:07:09,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:09,231 INFO L93 Difference]: Finished difference Result 1199 states and 2521 transitions. [2019-12-07 17:07:09,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:07:09,232 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 17:07:09,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:09,232 INFO L225 Difference]: With dead ends: 1199 [2019-12-07 17:07:09,232 INFO L226 Difference]: Without dead ends: 988 [2019-12-07 17:07:09,233 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:07:09,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2019-12-07 17:07:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 956. [2019-12-07 17:07:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 17:07:09,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2069 transitions. [2019-12-07 17:07:09,241 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2069 transitions. Word has length 52 [2019-12-07 17:07:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:09,241 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2069 transitions. [2019-12-07 17:07:09,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:07:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2069 transitions. [2019-12-07 17:07:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:09,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:09,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] [2019-12-07 17:07:09,242 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash -441835516, now seen corresponding path program 5 times [2019-12-07 17:07:09,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:09,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981161771] [2019-12-07 17:07:09,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:09,456 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 17:07:09,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981161771] [2019-12-07 17:07:09,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:09,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:07:09,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365998312] [2019-12-07 17:07:09,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:07:09,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:09,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:07:09,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:07:09,457 INFO L87 Difference]: Start difference. First operand 956 states and 2069 transitions. Second operand 13 states. [2019-12-07 17:07:10,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:10,298 INFO L93 Difference]: Finished difference Result 1338 states and 2812 transitions. [2019-12-07 17:07:10,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 17:07:10,299 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 17:07:10,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:10,300 INFO L225 Difference]: With dead ends: 1338 [2019-12-07 17:07:10,300 INFO L226 Difference]: Without dead ends: 1088 [2019-12-07 17:07:10,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:07:10,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2019-12-07 17:07:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 974. [2019-12-07 17:07:10,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-12-07 17:07:10,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2117 transitions. [2019-12-07 17:07:10,313 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2117 transitions. Word has length 52 [2019-12-07 17:07:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:10,313 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 2117 transitions. [2019-12-07 17:07:10,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:07:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2117 transitions. [2019-12-07 17:07:10,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:10,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:10,315 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] [2019-12-07 17:07:10,315 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:10,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:10,315 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 6 times [2019-12-07 17:07:10,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:10,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299738639] [2019-12-07 17:07:10,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:10,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:07:10,394 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 17:07:10,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299738639] [2019-12-07 17:07:10,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:07:10,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:07:10,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385682961] [2019-12-07 17:07:10,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:07:10,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:07:10,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:07:10,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:07:10,395 INFO L87 Difference]: Start difference. First operand 974 states and 2117 transitions. Second operand 7 states. [2019-12-07 17:07:10,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:07:10,529 INFO L93 Difference]: Finished difference Result 1519 states and 3192 transitions. [2019-12-07 17:07:10,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:07:10,529 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 17:07:10,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:07:10,530 INFO L225 Difference]: With dead ends: 1519 [2019-12-07 17:07:10,530 INFO L226 Difference]: Without dead ends: 1058 [2019-12-07 17:07:10,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:07:10,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2019-12-07 17:07:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 868. [2019-12-07 17:07:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2019-12-07 17:07:10,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1889 transitions. [2019-12-07 17:07:10,539 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1889 transitions. Word has length 52 [2019-12-07 17:07:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:07:10,539 INFO L462 AbstractCegarLoop]: Abstraction has 868 states and 1889 transitions. [2019-12-07 17:07:10,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:07:10,539 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1889 transitions. [2019-12-07 17:07:10,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 17:07:10,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:07:10,540 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] [2019-12-07 17:07:10,540 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:07:10,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:07:10,540 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 7 times [2019-12-07 17:07:10,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:07:10,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026040114] [2019-12-07 17:07:10,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:07:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:07:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:07:10,614 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:07:10,614 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:07:10,616 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1547~0.base_40|) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_40|) 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_40|) |v_ULTIMATE.start_main_~#t1547~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1547~0.base_40| 4)) (= |v_ULTIMATE.start_main_~#t1547~0.offset_27| 0) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_40| 1) |v_#valid_65|) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t1547~0.offset=|v_ULTIMATE.start_main_~#t1547~0.offset_27|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_27|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1547~0.base=|v_ULTIMATE.start_main_~#t1547~0.base_40|, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1547~0.offset, ULTIMATE.start_main_~#t1548~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1548~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1547~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:07:10,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1548~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1548~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13|) |v_ULTIMATE.start_main_~#t1548~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1548~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1548~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:07:10,617 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-1232218027 ~y$r_buff0_thd2~0_In-1232218027) (= ~y$r_buff0_thd1~0_In-1232218027 ~y$r_buff1_thd1~0_Out-1232218027) (= 1 ~y$r_buff0_thd1~0_Out-1232218027) (= ~y$r_buff1_thd0~0_Out-1232218027 ~y$r_buff0_thd0~0_In-1232218027) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1232218027)) (= ~x~0_In-1232218027 ~__unbuffered_p0_EAX~0_Out-1232218027)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1232218027, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1232218027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1232218027, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1232218027, ~x~0=~x~0_In-1232218027} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1232218027, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1232218027, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1232218027, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1232218027, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1232218027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1232218027, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1232218027, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1232218027, ~x~0=~x~0_In-1232218027} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:07:10,618 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-843000803 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-843000803 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-843000803|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-843000803| ~y$w_buff0_used~0_In-843000803) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-843000803, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-843000803} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-843000803|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-843000803, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-843000803} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:07:10,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1412180061 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1412180061| |P1Thread1of1ForFork1_#t~ite20_Out1412180061|) (= |P1Thread1of1ForFork1_#t~ite21_Out1412180061| ~y$w_buff0_used~0_In1412180061) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1412180061| |P1Thread1of1ForFork1_#t~ite21_Out1412180061|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1412180061 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1412180061 256))) (= 0 (mod ~y$w_buff0_used~0_In1412180061 256)) (and (= (mod ~y$r_buff1_thd2~0_In1412180061 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out1412180061| ~y$w_buff0_used~0_In1412180061) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1412180061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1412180061, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1412180061|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1412180061, ~weak$$choice2~0=~weak$$choice2~0_In1412180061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1412180061} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1412180061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1412180061, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1412180061|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1412180061, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1412180061|, ~weak$$choice2~0=~weak$$choice2~0_In1412180061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1412180061} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:07:10,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2010638558 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2010638558 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2010638558 256))) (.cse5 (= (mod ~weak$$choice2~0_In-2010638558 256) 0)) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out-2010638558| |P1Thread1of1ForFork1_#t~ite23_Out-2010638558|)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2010638558 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-2010638558| |P1Thread1of1ForFork1_#t~ite22_Out-2010638558|) (or (and (or (and .cse0 .cse1) (and .cse2 .cse1) .cse3) .cse4 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-2010638558| ~y$w_buff1_used~0_In-2010638558)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-2010638558| ~y$w_buff1_used~0_In-2010638558) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-2010638558| |P1Thread1of1ForFork1_#t~ite23_In-2010638558|)))) (let ((.cse6 (not .cse1))) (and (not .cse3) (= |P1Thread1of1ForFork1_#t~ite22_Out-2010638558| 0) (or (not .cse0) .cse6) (= |P1Thread1of1ForFork1_#t~ite23_Out-2010638558| |P1Thread1of1ForFork1_#t~ite22_Out-2010638558|) (or (not .cse2) .cse6) .cse5 .cse4)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010638558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010638558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010638558, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2010638558|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2010638558|, ~weak$$choice2~0=~weak$$choice2~0_In-2010638558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010638558} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010638558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010638558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010638558, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2010638558|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2010638558|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2010638558|, ~weak$$choice2~0=~weak$$choice2~0_In-2010638558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010638558} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:07:10,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-436836634 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-436836634 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-436836634 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-436836634 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-436836634|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-436836634 |P0Thread1of1ForFork0_#t~ite6_Out-436836634|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-436836634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-436836634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-436836634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-436836634} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-436836634|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-436836634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-436836634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-436836634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-436836634} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:07:10,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In987264913 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out987264913 ~y$r_buff0_thd1~0_In987264913)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In987264913 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out987264913 0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In987264913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In987264913} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In987264913, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out987264913|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out987264913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:07:10,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1236870269 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1236870269 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1236870269 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1236870269 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1236870269|)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1236870269| ~y$r_buff1_thd1~0_In-1236870269) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1236870269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236870269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1236870269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236870269} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1236870269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236870269, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1236870269|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1236870269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236870269} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:07:10,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:07:10,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-680921117 256)))) (or (and (= ~y$r_buff1_thd2~0_In-680921117 |P1Thread1of1ForFork1_#t~ite30_Out-680921117|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-680921117| |P1Thread1of1ForFork1_#t~ite29_Out-680921117|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-680921117| ~y$r_buff1_thd2~0_In-680921117) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-680921117| |P1Thread1of1ForFork1_#t~ite30_Out-680921117|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-680921117 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-680921117 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-680921117 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-680921117 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-680921117, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-680921117|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-680921117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-680921117, ~weak$$choice2~0=~weak$$choice2~0_In-680921117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-680921117} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-680921117, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-680921117|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-680921117|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-680921117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-680921117, ~weak$$choice2~0=~weak$$choice2~0_In-680921117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-680921117} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:07:10,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:07:10,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-132784337 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-132784337 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-132784337| ~y~0_In-132784337) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-132784337| ~y$w_buff1~0_In-132784337) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-132784337, ~y$w_buff1~0=~y$w_buff1~0_In-132784337, ~y~0=~y~0_In-132784337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-132784337} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-132784337, ~y$w_buff1~0=~y$w_buff1~0_In-132784337, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-132784337|, ~y~0=~y~0_In-132784337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-132784337} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:07:10,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:07:10,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1508850909 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1508850909 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1508850909| ~y$w_buff0_used~0_In1508850909)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1508850909| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1508850909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1508850909} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1508850909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1508850909, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1508850909|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:07:10,622 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In147716013 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In147716013 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In147716013 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In147716013 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out147716013| ~y$w_buff1_used~0_In147716013) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out147716013|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147716013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147716013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147716013, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147716013} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147716013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147716013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147716013, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out147716013|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147716013} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:07:10,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1942057021 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1942057021 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1942057021| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1942057021 |P1Thread1of1ForFork1_#t~ite36_Out1942057021|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1942057021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1942057021} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1942057021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1942057021, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1942057021|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:07:10,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1398482662 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1398482662 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1398482662 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1398482662 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1398482662 |P1Thread1of1ForFork1_#t~ite37_Out-1398482662|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1398482662|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1398482662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398482662, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1398482662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398482662} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1398482662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398482662, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1398482662, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1398482662|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398482662} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:07:10,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:07:10,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:07:10,623 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:07:10,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1399502134 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1399502134 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1399502134| ~y$w_buff1~0_In1399502134) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1399502134| ~y~0_In1399502134) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1399502134, ~y~0=~y~0_In1399502134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399502134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399502134} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1399502134|, ~y$w_buff1~0=~y$w_buff1~0_In1399502134, ~y~0=~y~0_In1399502134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399502134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399502134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:07:10,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:07:10,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1977349471 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1977349471 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1977349471|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1977349471 |ULTIMATE.start_main_#t~ite42_Out-1977349471|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1977349471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1977349471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1977349471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1977349471, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1977349471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:07:10,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1225859819 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1225859819 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1225859819 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1225859819 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1225859819| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1225859819| ~y$w_buff1_used~0_In-1225859819) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225859819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225859819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1225859819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1225859819} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225859819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225859819, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1225859819|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1225859819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1225859819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:07:10,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1599960969 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1599960969 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1599960969| ~y$r_buff0_thd0~0_In-1599960969) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1599960969| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599960969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599960969} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599960969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599960969, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1599960969|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:07:10,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-248296660 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-248296660 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-248296660 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-248296660 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-248296660| ~y$r_buff1_thd0~0_In-248296660)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-248296660|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-248296660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-248296660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-248296660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-248296660} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-248296660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-248296660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-248296660, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-248296660|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-248296660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:07:10,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:07:10,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:07:10 BasicIcfg [2019-12-07 17:07:10,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:07:10,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:07:10,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:07:10,660 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:07:10,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:07:01" (3/4) ... [2019-12-07 17:07:10,663 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:07:10,663 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1547~0.base_40|) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= (select .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_40|) 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd2~0_235) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1547~0.base_40|) |v_ULTIMATE.start_main_~#t1547~0.offset_27| 0)) |v_#memory_int_17|) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1547~0.base_40| 4)) (= |v_ULTIMATE.start_main_~#t1547~0.offset_27| 0) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1547~0.base_40| 1) |v_#valid_65|) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, ULTIMATE.start_main_~#t1547~0.offset=|v_ULTIMATE.start_main_~#t1547~0.offset_27|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_41|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_27|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1547~0.base=|v_ULTIMATE.start_main_~#t1547~0.base_40|, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t1547~0.offset, ULTIMATE.start_main_~#t1548~0.base, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1548~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1547~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:07:10,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| 4) |v_#length_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1548~0.base_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1548~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1548~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1548~0.base_13|) |v_ULTIMATE.start_main_~#t1548~0.offset_11| 1)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1548~0.offset=|v_ULTIMATE.start_main_~#t1548~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1548~0.base=|v_ULTIMATE.start_main_~#t1548~0.base_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1548~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1548~0.base, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 17:07:10,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff1_thd2~0_Out-1232218027 ~y$r_buff0_thd2~0_In-1232218027) (= ~y$r_buff0_thd1~0_In-1232218027 ~y$r_buff1_thd1~0_Out-1232218027) (= 1 ~y$r_buff0_thd1~0_Out-1232218027) (= ~y$r_buff1_thd0~0_Out-1232218027 ~y$r_buff0_thd0~0_In-1232218027) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1232218027)) (= ~x~0_In-1232218027 ~__unbuffered_p0_EAX~0_Out-1232218027)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1232218027, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1232218027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1232218027, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1232218027, ~x~0=~x~0_In-1232218027} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1232218027, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1232218027, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1232218027, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1232218027, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1232218027, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1232218027, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-1232218027, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1232218027, ~x~0=~x~0_In-1232218027} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:07:10,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-843000803 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-843000803 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-843000803|) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-843000803| ~y$w_buff0_used~0_In-843000803) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-843000803, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-843000803} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-843000803|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-843000803, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-843000803} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 17:07:10,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1412180061 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_In1412180061| |P1Thread1of1ForFork1_#t~ite20_Out1412180061|) (= |P1Thread1of1ForFork1_#t~ite21_Out1412180061| ~y$w_buff0_used~0_In1412180061) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite20_Out1412180061| |P1Thread1of1ForFork1_#t~ite21_Out1412180061|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1412180061 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1412180061 256))) (= 0 (mod ~y$w_buff0_used~0_In1412180061 256)) (and (= (mod ~y$r_buff1_thd2~0_In1412180061 256) 0) .cse1))) (= |P1Thread1of1ForFork1_#t~ite20_Out1412180061| ~y$w_buff0_used~0_In1412180061) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1412180061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1412180061, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1412180061|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1412180061, ~weak$$choice2~0=~weak$$choice2~0_In1412180061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1412180061} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1412180061, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1412180061, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1412180061|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1412180061, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1412180061|, ~weak$$choice2~0=~weak$$choice2~0_In1412180061, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1412180061} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:07:10,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2010638558 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-2010638558 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2010638558 256))) (.cse5 (= (mod ~weak$$choice2~0_In-2010638558 256) 0)) (.cse4 (= |P1Thread1of1ForFork1_#t~ite24_Out-2010638558| |P1Thread1of1ForFork1_#t~ite23_Out-2010638558|)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-2010638558 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite22_In-2010638558| |P1Thread1of1ForFork1_#t~ite22_Out-2010638558|) (or (and (or (and .cse0 .cse1) (and .cse2 .cse1) .cse3) .cse4 .cse5 (= |P1Thread1of1ForFork1_#t~ite23_Out-2010638558| ~y$w_buff1_used~0_In-2010638558)) (and (= |P1Thread1of1ForFork1_#t~ite24_Out-2010638558| ~y$w_buff1_used~0_In-2010638558) (not .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-2010638558| |P1Thread1of1ForFork1_#t~ite23_In-2010638558|)))) (let ((.cse6 (not .cse1))) (and (not .cse3) (= |P1Thread1of1ForFork1_#t~ite22_Out-2010638558| 0) (or (not .cse0) .cse6) (= |P1Thread1of1ForFork1_#t~ite23_Out-2010638558| |P1Thread1of1ForFork1_#t~ite22_Out-2010638558|) (or (not .cse2) .cse6) .cse5 .cse4)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010638558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010638558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010638558, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2010638558|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2010638558|, ~weak$$choice2~0=~weak$$choice2~0_In-2010638558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010638558} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2010638558, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2010638558, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2010638558, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2010638558|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2010638558|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2010638558|, ~weak$$choice2~0=~weak$$choice2~0_In-2010638558, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2010638558} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 17:07:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-436836634 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-436836634 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-436836634 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-436836634 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-436836634|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-436836634 |P0Thread1of1ForFork0_#t~ite6_Out-436836634|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-436836634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-436836634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-436836634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-436836634} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-436836634|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-436836634, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-436836634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-436836634, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-436836634} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 17:07:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In987264913 256))) (.cse2 (= ~y$r_buff0_thd1~0_Out987264913 ~y$r_buff0_thd1~0_In987264913)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In987264913 256)))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out987264913 0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In987264913, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In987264913} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In987264913, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out987264913|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out987264913} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 17:07:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1236870269 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1236870269 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1236870269 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1236870269 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1236870269|)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1236870269| ~y$r_buff1_thd1~0_In-1236870269) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1236870269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236870269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1236870269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236870269} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1236870269, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1236870269, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1236870269|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1236870269, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1236870269} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 17:07:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:07:10,667 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-680921117 256)))) (or (and (= ~y$r_buff1_thd2~0_In-680921117 |P1Thread1of1ForFork1_#t~ite30_Out-680921117|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-680921117| |P1Thread1of1ForFork1_#t~ite29_Out-680921117|)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out-680921117| ~y$r_buff1_thd2~0_In-680921117) .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-680921117| |P1Thread1of1ForFork1_#t~ite30_Out-680921117|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-680921117 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-680921117 256) 0) .cse1) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-680921117 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-680921117 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-680921117, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-680921117|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-680921117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-680921117, ~weak$$choice2~0=~weak$$choice2~0_In-680921117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-680921117} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-680921117, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-680921117|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-680921117|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-680921117, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-680921117, ~weak$$choice2~0=~weak$$choice2~0_In-680921117, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-680921117} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 17:07:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 17:07:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-132784337 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-132784337 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-132784337| ~y~0_In-132784337) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out-132784337| ~y$w_buff1~0_In-132784337) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-132784337, ~y$w_buff1~0=~y$w_buff1~0_In-132784337, ~y~0=~y~0_In-132784337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-132784337} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-132784337, ~y$w_buff1~0=~y$w_buff1~0_In-132784337, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-132784337|, ~y~0=~y~0_In-132784337, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-132784337} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 17:07:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 17:07:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1508850909 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1508850909 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1508850909| ~y$w_buff0_used~0_In1508850909)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out1508850909| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1508850909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1508850909} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1508850909, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1508850909, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1508850909|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 17:07:10,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In147716013 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In147716013 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In147716013 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In147716013 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out147716013| ~y$w_buff1_used~0_In147716013) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite35_Out147716013|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147716013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147716013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147716013, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147716013} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In147716013, ~y$w_buff0_used~0=~y$w_buff0_used~0_In147716013, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In147716013, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out147716013|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In147716013} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 17:07:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1942057021 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1942057021 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1942057021| 0) (not .cse1)) (and (= ~y$r_buff0_thd2~0_In1942057021 |P1Thread1of1ForFork1_#t~ite36_Out1942057021|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1942057021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1942057021} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1942057021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1942057021, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1942057021|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 17:07:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1398482662 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1398482662 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1398482662 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1398482662 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1398482662 |P1Thread1of1ForFork1_#t~ite37_Out-1398482662|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1398482662|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1398482662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398482662, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1398482662, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398482662} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1398482662, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1398482662, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1398482662, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1398482662|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1398482662} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:07:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 17:07:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:07:10,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 17:07:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1399502134 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1399502134 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out1399502134| ~y$w_buff1~0_In1399502134) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite40_Out1399502134| ~y~0_In1399502134) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1399502134, ~y~0=~y~0_In1399502134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399502134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399502134} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1399502134|, ~y$w_buff1~0=~y$w_buff1~0_In1399502134, ~y~0=~y~0_In1399502134, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1399502134, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1399502134} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 17:07:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 17:07:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1977349471 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1977349471 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-1977349471|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1977349471 |ULTIMATE.start_main_#t~ite42_Out-1977349471|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1977349471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1977349471} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1977349471, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1977349471, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1977349471|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:07:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1225859819 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1225859819 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1225859819 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1225859819 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out-1225859819| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1225859819| ~y$w_buff1_used~0_In-1225859819) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225859819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225859819, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1225859819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1225859819} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1225859819, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1225859819, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1225859819|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1225859819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1225859819} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 17:07:10,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1599960969 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1599960969 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-1599960969| ~y$r_buff0_thd0~0_In-1599960969) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1599960969| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599960969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599960969} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1599960969, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1599960969, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1599960969|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:07:10,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-248296660 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-248296660 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-248296660 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-248296660 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-248296660| ~y$r_buff1_thd0~0_In-248296660)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-248296660|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-248296660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-248296660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-248296660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-248296660} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-248296660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-248296660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-248296660, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-248296660|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-248296660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:07:10,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:07:10,715 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e17659f0-68db-420a-b08e-ecce92917bdb/bin/uautomizer/witness.graphml [2019-12-07 17:07:10,715 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:07:10,716 INFO L168 Benchmark]: Toolchain (without parser) took 10510.64 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 479.7 MB). Free memory was 934.5 MB in the beginning and 1.3 GB in the end (delta: -369.9 MB). Peak memory consumption was 109.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:10,716 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:07:10,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:10,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:10,717 INFO L168 Benchmark]: Boogie Preprocessor took 24.70 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 17:07:10,717 INFO L168 Benchmark]: RCFGBuilder took 365.90 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:10,717 INFO L168 Benchmark]: TraceAbstraction took 9647.42 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 379.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -305.0 MB). Peak memory consumption was 74.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:10,718 INFO L168 Benchmark]: Witness Printer took 54.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:07:10,719 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 934.5 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.70 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 365.90 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: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9647.42 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 379.6 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -305.0 MB). Peak memory consumption was 74.6 MB. Max. memory is 11.5 GB. * Witness Printer took 54.60 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1547, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1548, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 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, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 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) [L760] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L760] 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)) [L761] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 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)) [L762] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2052 SDtfs, 2649 SDslu, 5286 SDs, 0 SdLazy, 3887 SolverSat, 154 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 24 SyntacticMatches, 12 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 7497 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 629 NumberOfCodeBlocks, 629 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 561 ConstructedInterpolants, 0 QuantifiedInterpolants, 144279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...