./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007_pso.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_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/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 03bd54420cb2063ae0fda825a0f80376f3e690c8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:31:03,950 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:31:03,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:31:03,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:31:03,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:31:03,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:31:03,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:31:03,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:31:03,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:31:03,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:31:03,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:31:03,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:31:03,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:31:03,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:31:03,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:31:03,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:31:03,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:31:03,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:31:03,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:31:03,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:31:03,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:31:03,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:31:03,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:31:03,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:31:03,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:31:03,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:31:03,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:31:03,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:31:03,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:31:03,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:31:03,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:31:03,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:31:03,978 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:31:03,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:31:03,979 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:31:03,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:31:03,980 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:31:03,980 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:31:03,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:31:03,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:31:03,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:31:03,981 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:31:03,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:31:03,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:31:03,992 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:31:03,992 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:31:03,992 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:31:03,993 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:31:03,993 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:31:03,993 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:31:03,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:31:03,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:31:03,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:31:03,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:31:03,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:31:03,994 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:31:03,994 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:31:03,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:31:03,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:31:03,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:31:03,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:31:03,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:31:03,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:31:03,995 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:31:03,996 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_0c450042-097c-4b6e-8eee-db637669e36f/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 -> 03bd54420cb2063ae0fda825a0f80376f3e690c8 [2019-12-07 12:31:04,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:31:04,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:31:04,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:31:04,106 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:31:04,106 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:31:04,107 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix007_pso.opt.i [2019-12-07 12:31:04,143 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/data/ca7efe587/43853ba164a54e448e4ba7b74face8c3/FLAG74dc2e099 [2019-12-07 12:31:04,545 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:31:04,545 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/sv-benchmarks/c/pthread-wmm/mix007_pso.opt.i [2019-12-07 12:31:04,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/data/ca7efe587/43853ba164a54e448e4ba7b74face8c3/FLAG74dc2e099 [2019-12-07 12:31:04,565 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/data/ca7efe587/43853ba164a54e448e4ba7b74face8c3 [2019-12-07 12:31:04,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:31:04,568 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:31:04,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:31:04,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:31:04,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:31:04,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:31:04" (1/1) ... [2019-12-07 12:31:04,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:04, skipping insertion in model container [2019-12-07 12:31:04,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:31:04" (1/1) ... [2019-12-07 12:31:04,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:31:04,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:31:04,901 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:31:04,911 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:31:04,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:31:05,019 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:31:05,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05 WrapperNode [2019-12-07 12:31:05,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:31:05,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:31:05,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:31:05,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:31:05,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,044 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:31:05,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:31:05,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:31:05,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:31:05,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,101 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... [2019-12-07 12:31:05,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:31:05,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:31:05,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:31:05,108 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:31:05,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/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 12:31:05,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:31:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:31:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:31:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:31:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:31:05,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:31:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:31:05,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:31:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:31:05,156 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:31:05,156 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 12:31:05,157 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 12:31:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:31:05,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:31:05,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:31:05,158 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 12:31:05,577 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:31:05,578 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:31:05,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:31:05 BoogieIcfgContainer [2019-12-07 12:31:05,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:31:05,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:31:05,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:31:05,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:31:05,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:31:04" (1/3) ... [2019-12-07 12:31:05,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a86d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:31:05, skipping insertion in model container [2019-12-07 12:31:05,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:31:05" (2/3) ... [2019-12-07 12:31:05,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a86d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:31:05, skipping insertion in model container [2019-12-07 12:31:05,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:31:05" (3/3) ... [2019-12-07 12:31:05,584 INFO L109 eAbstractionObserver]: Analyzing ICFG mix007_pso.opt.i [2019-12-07 12:31:05,590 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:31:05,590 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:31:05,596 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:31:05,596 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:31:05,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,628 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,628 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,629 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,630 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,631 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,631 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,632 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,633 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,634 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,635 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,636 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,637 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,645 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,645 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,646 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,646 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,646 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,646 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,646 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,647 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,648 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:31:05,674 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 12:31:05,686 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:31:05,686 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:31:05,686 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:31:05,686 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:31:05,686 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:31:05,686 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:31:05,686 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:31:05,686 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:31:05,697 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 12:31:05,699 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 12:31:05,774 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 12:31:05,774 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:31:05,785 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:31:05,809 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 12:31:05,850 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 12:31:05,850 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:31:05,859 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:31:05,885 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 12:31:05,886 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:31:09,514 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 12:31:09,705 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 12:31:09,818 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-07 12:31:09,818 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-07 12:31:09,820 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-07 12:31:17,201 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-07 12:31:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-07 12:31:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:31:17,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:17,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:31:17,208 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:31:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:17,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-07 12:31:17,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:31:17,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157791318] [2019-12-07 12:31:17,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:31:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:17,371 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 12:31:17,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157791318] [2019-12-07 12:31:17,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:17,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:31:17,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124299516] [2019-12-07 12:31:17,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:31:17,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:31:17,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:31:17,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:31:17,387 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-07 12:31:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:31:18,157 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-07 12:31:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:31:18,158 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:31:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:31:18,607 INFO L225 Difference]: With dead ends: 85406 [2019-12-07 12:31:18,607 INFO L226 Difference]: Without dead ends: 79558 [2019-12-07 12:31:18,608 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 12:31:19,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-07 12:31:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-07 12:31:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-07 12:31:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-07 12:31:22,868 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-07 12:31:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:31:22,869 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-07 12:31:22,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:31:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-07 12:31:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:31:22,876 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:22,876 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:31:22,876 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:31:22,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-07 12:31:22,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:31:22,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938976428] [2019-12-07 12:31:22,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:31:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:22,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:31:22,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938976428] [2019-12-07 12:31:22,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:22,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:31:22,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624454078] [2019-12-07 12:31:22,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:31:22,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:31:22,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:31:22,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:31:22,954 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-07 12:31:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:31:23,762 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-07 12:31:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:31:23,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:31:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:31:24,121 INFO L225 Difference]: With dead ends: 126790 [2019-12-07 12:31:24,121 INFO L226 Difference]: Without dead ends: 126726 [2019-12-07 12:31:24,122 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 12:31:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-07 12:31:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-07 12:31:27,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-07 12:31:27,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-07 12:31:27,695 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-07 12:31:27,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:31:27,696 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-07 12:31:27,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:31:27,696 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-07 12:31:27,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:31:27,701 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:27,701 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:31:27,701 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:31:27,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:27,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-07 12:31:27,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:31:27,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574348982] [2019-12-07 12:31:27,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:31:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:27,746 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 12:31:27,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574348982] [2019-12-07 12:31:27,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:27,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:31:27,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199585873] [2019-12-07 12:31:27,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:31:27,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:31:27,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:31:27,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:31:27,747 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-07 12:31:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:31:30,253 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-07 12:31:30,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:31:30,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 12:31:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:31:30,699 INFO L225 Difference]: With dead ends: 159910 [2019-12-07 12:31:30,699 INFO L226 Difference]: Without dead ends: 159850 [2019-12-07 12:31:30,699 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 12:31:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-07 12:31:34,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-07 12:31:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-07 12:31:34,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-07 12:31:34,672 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-07 12:31:34,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:31:34,672 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-07 12:31:34,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:31:34,672 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-07 12:31:34,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:31:34,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:34,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:31:34,684 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:31:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:34,684 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-07 12:31:34,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:31:34,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882429518] [2019-12-07 12:31:34,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:31:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:34,754 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 12:31:34,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882429518] [2019-12-07 12:31:34,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:34,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:31:34,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929335048] [2019-12-07 12:31:34,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:31:34,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:31:34,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:31:34,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:31:34,755 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-07 12:31:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:31:35,976 INFO L93 Difference]: Finished difference Result 211830 states and 899709 transitions. [2019-12-07 12:31:35,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:31:35,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:31:35,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:31:36,560 INFO L225 Difference]: With dead ends: 211830 [2019-12-07 12:31:36,560 INFO L226 Difference]: Without dead ends: 211290 [2019-12-07 12:31:36,560 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 12:31:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211290 states. [2019-12-07 12:31:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211290 to 205249. [2019-12-07 12:31:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205249 states. [2019-12-07 12:31:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205249 states to 205249 states and 879959 transitions. [2019-12-07 12:31:44,647 INFO L78 Accepts]: Start accepts. Automaton has 205249 states and 879959 transitions. Word has length 20 [2019-12-07 12:31:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:31:44,647 INFO L462 AbstractCegarLoop]: Abstraction has 205249 states and 879959 transitions. [2019-12-07 12:31:44,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:31:44,647 INFO L276 IsEmpty]: Start isEmpty. Operand 205249 states and 879959 transitions. [2019-12-07 12:31:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:31:44,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:44,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:31:44,662 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:31:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:44,662 INFO L82 PathProgramCache]: Analyzing trace with hash -489613445, now seen corresponding path program 1 times [2019-12-07 12:31:44,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:31:44,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243933510] [2019-12-07 12:31:44,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:31:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:44,735 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 12:31:44,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243933510] [2019-12-07 12:31:44,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:44,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:31:44,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716623377] [2019-12-07 12:31:44,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:31:44,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:31:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:31:44,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:31:44,736 INFO L87 Difference]: Start difference. First operand 205249 states and 879959 transitions. Second operand 4 states. [2019-12-07 12:31:45,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:31:45,688 INFO L93 Difference]: Finished difference Result 210943 states and 896562 transitions. [2019-12-07 12:31:45,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:31:45,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:31:45,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:31:46,681 INFO L225 Difference]: With dead ends: 210943 [2019-12-07 12:31:46,681 INFO L226 Difference]: Without dead ends: 210943 [2019-12-07 12:31:46,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:31:48,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210943 states. [2019-12-07 12:31:51,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210943 to 203920. [2019-12-07 12:31:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203920 states. [2019-12-07 12:31:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203920 states to 203920 states and 875371 transitions. [2019-12-07 12:31:52,154 INFO L78 Accepts]: Start accepts. Automaton has 203920 states and 875371 transitions. Word has length 21 [2019-12-07 12:31:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:31:52,154 INFO L462 AbstractCegarLoop]: Abstraction has 203920 states and 875371 transitions. [2019-12-07 12:31:52,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:31:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 203920 states and 875371 transitions. [2019-12-07 12:31:52,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:31:52,171 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:52,171 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:31:52,171 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:31:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1444973627, now seen corresponding path program 1 times [2019-12-07 12:31:52,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:31:52,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793833491] [2019-12-07 12:31:52,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:31:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:52,223 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 12:31:52,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793833491] [2019-12-07 12:31:52,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:52,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:31:52,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725134066] [2019-12-07 12:31:52,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:31:52,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:31:52,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:31:52,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:31:52,225 INFO L87 Difference]: Start difference. First operand 203920 states and 875371 transitions. Second operand 4 states. [2019-12-07 12:31:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:31:55,202 INFO L93 Difference]: Finished difference Result 181966 states and 731993 transitions. [2019-12-07 12:31:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:31:55,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:31:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:31:55,628 INFO L225 Difference]: With dead ends: 181966 [2019-12-07 12:31:55,628 INFO L226 Difference]: Without dead ends: 169316 [2019-12-07 12:31:55,628 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 12:31:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169316 states. [2019-12-07 12:31:59,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169316 to 169316. [2019-12-07 12:31:59,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169316 states. [2019-12-07 12:31:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169316 states to 169316 states and 687598 transitions. [2019-12-07 12:31:59,557 INFO L78 Accepts]: Start accepts. Automaton has 169316 states and 687598 transitions. Word has length 21 [2019-12-07 12:31:59,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:31:59,557 INFO L462 AbstractCegarLoop]: Abstraction has 169316 states and 687598 transitions. [2019-12-07 12:31:59,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:31:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand 169316 states and 687598 transitions. [2019-12-07 12:31:59,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:31:59,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:31:59,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:31:59,571 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:31:59,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:31:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash -628977471, now seen corresponding path program 1 times [2019-12-07 12:31:59,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:31:59,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916373885] [2019-12-07 12:31:59,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:31:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:31:59,602 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 12:31:59,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916373885] [2019-12-07 12:31:59,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:31:59,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:31:59,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520385796] [2019-12-07 12:31:59,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:31:59,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:31:59,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:31:59,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:31:59,603 INFO L87 Difference]: Start difference. First operand 169316 states and 687598 transitions. Second operand 3 states. [2019-12-07 12:32:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:00,298 INFO L93 Difference]: Finished difference Result 169316 states and 680118 transitions. [2019-12-07 12:32:00,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:32:00,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 12:32:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:00,707 INFO L225 Difference]: With dead ends: 169316 [2019-12-07 12:32:00,707 INFO L226 Difference]: Without dead ends: 169316 [2019-12-07 12:32:00,708 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 12:32:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169316 states. [2019-12-07 12:32:04,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169316 to 168749. [2019-12-07 12:32:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168749 states. [2019-12-07 12:32:05,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168749 states to 168749 states and 678228 transitions. [2019-12-07 12:32:05,296 INFO L78 Accepts]: Start accepts. Automaton has 168749 states and 678228 transitions. Word has length 22 [2019-12-07 12:32:05,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:05,296 INFO L462 AbstractCegarLoop]: Abstraction has 168749 states and 678228 transitions. [2019-12-07 12:32:05,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:32:05,296 INFO L276 IsEmpty]: Start isEmpty. Operand 168749 states and 678228 transitions. [2019-12-07 12:32:05,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:32:05,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:05,308 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:05,308 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash 556520531, now seen corresponding path program 1 times [2019-12-07 12:32:05,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:05,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029101240] [2019-12-07 12:32:05,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:05,349 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 12:32:05,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029101240] [2019-12-07 12:32:05,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:05,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:32:05,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436889602] [2019-12-07 12:32:05,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:05,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:05,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:05,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:05,350 INFO L87 Difference]: Start difference. First operand 168749 states and 678228 transitions. Second operand 5 states. [2019-12-07 12:32:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:05,655 INFO L93 Difference]: Finished difference Result 85959 states and 300035 transitions. [2019-12-07 12:32:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:32:05,655 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 12:32:05,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:05,787 INFO L225 Difference]: With dead ends: 85959 [2019-12-07 12:32:05,787 INFO L226 Difference]: Without dead ends: 75574 [2019-12-07 12:32:05,787 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 12:32:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75574 states. [2019-12-07 12:32:07,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75574 to 74203. [2019-12-07 12:32:07,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74203 states. [2019-12-07 12:32:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74203 states to 74203 states and 256414 transitions. [2019-12-07 12:32:07,164 INFO L78 Accepts]: Start accepts. Automaton has 74203 states and 256414 transitions. Word has length 22 [2019-12-07 12:32:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:07,164 INFO L462 AbstractCegarLoop]: Abstraction has 74203 states and 256414 transitions. [2019-12-07 12:32:07,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:07,164 INFO L276 IsEmpty]: Start isEmpty. Operand 74203 states and 256414 transitions. [2019-12-07 12:32:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:32:07,170 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:07,171 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] [2019-12-07 12:32:07,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:07,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash -10687230, now seen corresponding path program 1 times [2019-12-07 12:32:07,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:07,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743793862] [2019-12-07 12:32:07,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:07,219 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 12:32:07,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743793862] [2019-12-07 12:32:07,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:07,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:32:07,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072139813] [2019-12-07 12:32:07,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:07,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:07,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:07,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:07,220 INFO L87 Difference]: Start difference. First operand 74203 states and 256414 transitions. Second operand 4 states. [2019-12-07 12:32:07,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:07,642 INFO L93 Difference]: Finished difference Result 72468 states and 249972 transitions. [2019-12-07 12:32:07,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:32:07,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 12:32:07,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:07,761 INFO L225 Difference]: With dead ends: 72468 [2019-12-07 12:32:07,761 INFO L226 Difference]: Without dead ends: 72468 [2019-12-07 12:32:07,761 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72468 states. [2019-12-07 12:32:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72468 to 50209. [2019-12-07 12:32:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50209 states. [2019-12-07 12:32:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50209 states to 50209 states and 171824 transitions. [2019-12-07 12:32:08,928 INFO L78 Accepts]: Start accepts. Automaton has 50209 states and 171824 transitions. Word has length 23 [2019-12-07 12:32:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:08,928 INFO L462 AbstractCegarLoop]: Abstraction has 50209 states and 171824 transitions. [2019-12-07 12:32:08,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:08,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50209 states and 171824 transitions. [2019-12-07 12:32:08,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 12:32:08,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:08,937 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] [2019-12-07 12:32:08,937 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1913222537, now seen corresponding path program 1 times [2019-12-07 12:32:08,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:08,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794562225] [2019-12-07 12:32:08,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:08,978 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 12:32:08,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794562225] [2019-12-07 12:32:08,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:08,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:08,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940301100] [2019-12-07 12:32:08,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:08,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:08,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:08,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:08,979 INFO L87 Difference]: Start difference. First operand 50209 states and 171824 transitions. Second operand 5 states. [2019-12-07 12:32:09,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:09,458 INFO L93 Difference]: Finished difference Result 59703 states and 200847 transitions. [2019-12-07 12:32:09,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:32:09,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 12:32:09,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:09,554 INFO L225 Difference]: With dead ends: 59703 [2019-12-07 12:32:09,555 INFO L226 Difference]: Without dead ends: 59673 [2019-12-07 12:32:09,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:32:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59673 states. [2019-12-07 12:32:10,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59673 to 50899. [2019-12-07 12:32:10,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50899 states. [2019-12-07 12:32:10,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50899 states to 50899 states and 173933 transitions. [2019-12-07 12:32:10,674 INFO L78 Accepts]: Start accepts. Automaton has 50899 states and 173933 transitions. Word has length 26 [2019-12-07 12:32:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:10,674 INFO L462 AbstractCegarLoop]: Abstraction has 50899 states and 173933 transitions. [2019-12-07 12:32:10,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:10,674 INFO L276 IsEmpty]: Start isEmpty. Operand 50899 states and 173933 transitions. [2019-12-07 12:32:10,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:32:10,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:10,713 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] [2019-12-07 12:32:10,713 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:10,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:10,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1841523215, now seen corresponding path program 1 times [2019-12-07 12:32:10,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:10,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208187935] [2019-12-07 12:32:10,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:10,831 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 12:32:10,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208187935] [2019-12-07 12:32:10,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:10,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:32:10,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374207430] [2019-12-07 12:32:10,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:32:10,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:10,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:32:10,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:32:10,832 INFO L87 Difference]: Start difference. First operand 50899 states and 173933 transitions. Second operand 9 states. [2019-12-07 12:32:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:12,230 INFO L93 Difference]: Finished difference Result 111176 states and 392182 transitions. [2019-12-07 12:32:12,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 12:32:12,230 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-12-07 12:32:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:12,441 INFO L225 Difference]: With dead ends: 111176 [2019-12-07 12:32:12,441 INFO L226 Difference]: Without dead ends: 111176 [2019-12-07 12:32:12,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=187, Invalid=569, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:32:13,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111176 states. [2019-12-07 12:32:13,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111176 to 64354. [2019-12-07 12:32:13,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64354 states. [2019-12-07 12:32:14,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64354 states to 64354 states and 225489 transitions. [2019-12-07 12:32:14,107 INFO L78 Accepts]: Start accepts. Automaton has 64354 states and 225489 transitions. Word has length 38 [2019-12-07 12:32:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:14,107 INFO L462 AbstractCegarLoop]: Abstraction has 64354 states and 225489 transitions. [2019-12-07 12:32:14,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:32:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 64354 states and 225489 transitions. [2019-12-07 12:32:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:32:14,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:14,151 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] [2019-12-07 12:32:14,152 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:14,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:14,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1343370047, now seen corresponding path program 2 times [2019-12-07 12:32:14,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:14,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929830912] [2019-12-07 12:32:14,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:14,254 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 12:32:14,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929830912] [2019-12-07 12:32:14,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:14,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:32:14,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297134023] [2019-12-07 12:32:14,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:32:14,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:14,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:32:14,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:32:14,256 INFO L87 Difference]: Start difference. First operand 64354 states and 225489 transitions. Second operand 10 states. [2019-12-07 12:32:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:15,237 INFO L93 Difference]: Finished difference Result 108364 states and 373178 transitions. [2019-12-07 12:32:15,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 12:32:15,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2019-12-07 12:32:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:15,387 INFO L225 Difference]: With dead ends: 108364 [2019-12-07 12:32:15,387 INFO L226 Difference]: Without dead ends: 86391 [2019-12-07 12:32:15,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:32:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86391 states. [2019-12-07 12:32:16,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86391 to 69073. [2019-12-07 12:32:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69073 states. [2019-12-07 12:32:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69073 states to 69073 states and 240458 transitions. [2019-12-07 12:32:16,927 INFO L78 Accepts]: Start accepts. Automaton has 69073 states and 240458 transitions. Word has length 38 [2019-12-07 12:32:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:16,928 INFO L462 AbstractCegarLoop]: Abstraction has 69073 states and 240458 transitions. [2019-12-07 12:32:16,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:32:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 69073 states and 240458 transitions. [2019-12-07 12:32:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:32:16,974 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:16,974 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] [2019-12-07 12:32:16,975 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:16,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1191936355, now seen corresponding path program 3 times [2019-12-07 12:32:16,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:16,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891869945] [2019-12-07 12:32:16,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:17,023 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 12:32:17,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891869945] [2019-12-07 12:32:17,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:17,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:32:17,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667505987] [2019-12-07 12:32:17,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:32:17,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:17,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:32:17,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:32:17,024 INFO L87 Difference]: Start difference. First operand 69073 states and 240458 transitions. Second operand 6 states. [2019-12-07 12:32:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:17,123 INFO L93 Difference]: Finished difference Result 18892 states and 63850 transitions. [2019-12-07 12:32:17,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:32:17,123 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-12-07 12:32:17,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:17,144 INFO L225 Difference]: With dead ends: 18892 [2019-12-07 12:32:17,144 INFO L226 Difference]: Without dead ends: 15064 [2019-12-07 12:32:17,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:32:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15064 states. [2019-12-07 12:32:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15064 to 14475. [2019-12-07 12:32:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14475 states. [2019-12-07 12:32:17,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14475 states to 14475 states and 48649 transitions. [2019-12-07 12:32:17,337 INFO L78 Accepts]: Start accepts. Automaton has 14475 states and 48649 transitions. Word has length 38 [2019-12-07 12:32:17,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:17,337 INFO L462 AbstractCegarLoop]: Abstraction has 14475 states and 48649 transitions. [2019-12-07 12:32:17,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:32:17,337 INFO L276 IsEmpty]: Start isEmpty. Operand 14475 states and 48649 transitions. [2019-12-07 12:32:17,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 12:32:17,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:17,350 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:17,350 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:17,351 INFO L82 PathProgramCache]: Analyzing trace with hash 654156702, now seen corresponding path program 1 times [2019-12-07 12:32:17,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:17,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563708043] [2019-12-07 12:32:17,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:17,420 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 12:32:17,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563708043] [2019-12-07 12:32:17,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:17,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:17,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785092259] [2019-12-07 12:32:17,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:17,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:17,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:17,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:17,421 INFO L87 Difference]: Start difference. First operand 14475 states and 48649 transitions. Second operand 4 states. [2019-12-07 12:32:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:17,512 INFO L93 Difference]: Finished difference Result 22218 states and 71559 transitions. [2019-12-07 12:32:17,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:32:17,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 12:32:17,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:17,538 INFO L225 Difference]: With dead ends: 22218 [2019-12-07 12:32:17,538 INFO L226 Difference]: Without dead ends: 21895 [2019-12-07 12:32:17,539 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 12:32:17,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21895 states. [2019-12-07 12:32:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21895 to 14402. [2019-12-07 12:32:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14402 states. [2019-12-07 12:32:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14402 states to 14402 states and 48440 transitions. [2019-12-07 12:32:17,770 INFO L78 Accepts]: Start accepts. Automaton has 14402 states and 48440 transitions. Word has length 50 [2019-12-07 12:32:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:17,771 INFO L462 AbstractCegarLoop]: Abstraction has 14402 states and 48440 transitions. [2019-12-07 12:32:17,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 14402 states and 48440 transitions. [2019-12-07 12:32:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 12:32:17,784 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:17,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:17,784 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:17,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:17,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1871293106, now seen corresponding path program 2 times [2019-12-07 12:32:17,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:17,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264834135] [2019-12-07 12:32:17,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:17,883 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 12:32:17,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264834135] [2019-12-07 12:32:17,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:17,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:32:17,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380135715] [2019-12-07 12:32:17,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:32:17,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:17,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:32:17,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:32:17,885 INFO L87 Difference]: Start difference. First operand 14402 states and 48440 transitions. Second operand 7 states. [2019-12-07 12:32:17,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:17,979 INFO L93 Difference]: Finished difference Result 12686 states and 44498 transitions. [2019-12-07 12:32:17,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:32:17,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 12:32:17,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:17,993 INFO L225 Difference]: With dead ends: 12686 [2019-12-07 12:32:17,994 INFO L226 Difference]: Without dead ends: 10655 [2019-12-07 12:32:17,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:32:18,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10655 states. [2019-12-07 12:32:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10655 to 10093. [2019-12-07 12:32:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10093 states. [2019-12-07 12:32:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10093 states to 10093 states and 34953 transitions. [2019-12-07 12:32:18,126 INFO L78 Accepts]: Start accepts. Automaton has 10093 states and 34953 transitions. Word has length 50 [2019-12-07 12:32:18,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:18,126 INFO L462 AbstractCegarLoop]: Abstraction has 10093 states and 34953 transitions. [2019-12-07 12:32:18,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:32:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 10093 states and 34953 transitions. [2019-12-07 12:32:18,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:32:18,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:18,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:32:18,136 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:18,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:18,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2053431971, now seen corresponding path program 1 times [2019-12-07 12:32:18,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:18,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055873281] [2019-12-07 12:32:18,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:18,206 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 12:32:18,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055873281] [2019-12-07 12:32:18,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:18,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:32:18,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565973201] [2019-12-07 12:32:18,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:32:18,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:18,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:32:18,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:32:18,207 INFO L87 Difference]: Start difference. First operand 10093 states and 34953 transitions. Second operand 5 states. [2019-12-07 12:32:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:18,292 INFO L93 Difference]: Finished difference Result 16111 states and 52625 transitions. [2019-12-07 12:32:18,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:32:18,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 12:32:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:18,305 INFO L225 Difference]: With dead ends: 16111 [2019-12-07 12:32:18,305 INFO L226 Difference]: Without dead ends: 10462 [2019-12-07 12:32:18,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:32:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10462 states. [2019-12-07 12:32:18,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10462 to 7033. [2019-12-07 12:32:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7033 states. [2019-12-07 12:32:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7033 states to 7033 states and 22396 transitions. [2019-12-07 12:32:18,406 INFO L78 Accepts]: Start accepts. Automaton has 7033 states and 22396 transitions. Word has length 65 [2019-12-07 12:32:18,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:18,406 INFO L462 AbstractCegarLoop]: Abstraction has 7033 states and 22396 transitions. [2019-12-07 12:32:18,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:32:18,406 INFO L276 IsEmpty]: Start isEmpty. Operand 7033 states and 22396 transitions. [2019-12-07 12:32:18,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:32:18,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:18,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:18,412 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:18,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:18,412 INFO L82 PathProgramCache]: Analyzing trace with hash 544269315, now seen corresponding path program 2 times [2019-12-07 12:32:18,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:18,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757480596] [2019-12-07 12:32:18,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:18,451 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 12:32:18,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757480596] [2019-12-07 12:32:18,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:18,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:18,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226907350] [2019-12-07 12:32:18,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:18,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:18,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:18,452 INFO L87 Difference]: Start difference. First operand 7033 states and 22396 transitions. Second operand 4 states. [2019-12-07 12:32:18,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:18,478 INFO L93 Difference]: Finished difference Result 7588 states and 23652 transitions. [2019-12-07 12:32:18,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:32:18,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 12:32:18,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:18,482 INFO L225 Difference]: With dead ends: 7588 [2019-12-07 12:32:18,482 INFO L226 Difference]: Without dead ends: 3099 [2019-12-07 12:32:18,483 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 12:32:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3099 states. [2019-12-07 12:32:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3099 to 3099. [2019-12-07 12:32:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3099 states. [2019-12-07 12:32:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3099 states to 3099 states and 8564 transitions. [2019-12-07 12:32:18,517 INFO L78 Accepts]: Start accepts. Automaton has 3099 states and 8564 transitions. Word has length 65 [2019-12-07 12:32:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:18,518 INFO L462 AbstractCegarLoop]: Abstraction has 3099 states and 8564 transitions. [2019-12-07 12:32:18,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3099 states and 8564 transitions. [2019-12-07 12:32:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:32:18,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:18,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:18,520 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:18,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1103053199, now seen corresponding path program 3 times [2019-12-07 12:32:18,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:18,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321563693] [2019-12-07 12:32:18,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:18,574 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 12:32:18,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321563693] [2019-12-07 12:32:18,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:18,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:32:18,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909443035] [2019-12-07 12:32:18,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:32:18,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:32:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:18,575 INFO L87 Difference]: Start difference. First operand 3099 states and 8564 transitions. Second operand 4 states. [2019-12-07 12:32:18,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:18,595 INFO L93 Difference]: Finished difference Result 3506 states and 9499 transitions. [2019-12-07 12:32:18,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:32:18,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 12:32:18,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:18,596 INFO L225 Difference]: With dead ends: 3506 [2019-12-07 12:32:18,596 INFO L226 Difference]: Without dead ends: 484 [2019-12-07 12:32:18,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:32:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-07 12:32:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-07 12:32:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 12:32:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1060 transitions. [2019-12-07 12:32:18,601 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1060 transitions. Word has length 65 [2019-12-07 12:32:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:18,601 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1060 transitions. [2019-12-07 12:32:18,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:32:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1060 transitions. [2019-12-07 12:32:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:32:18,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:18,602 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:18,602 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-07 12:32:18,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:18,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375227584] [2019-12-07 12:32:18,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:18,775 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 12:32:18,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375227584] [2019-12-07 12:32:18,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:18,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:32:18,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415686236] [2019-12-07 12:32:18,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:32:18,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:32:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:32:18,777 INFO L87 Difference]: Start difference. First operand 484 states and 1060 transitions. Second operand 12 states. [2019-12-07 12:32:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:19,716 INFO L93 Difference]: Finished difference Result 1177 states and 2536 transitions. [2019-12-07 12:32:19,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 12:32:19,717 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 12:32:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:19,717 INFO L225 Difference]: With dead ends: 1177 [2019-12-07 12:32:19,717 INFO L226 Difference]: Without dead ends: 815 [2019-12-07 12:32:19,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2019-12-07 12:32:19,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-12-07 12:32:19,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 568. [2019-12-07 12:32:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-12-07 12:32:19,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 1222 transitions. [2019-12-07 12:32:19,723 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 1222 transitions. Word has length 66 [2019-12-07 12:32:19,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:19,723 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 1222 transitions. [2019-12-07 12:32:19,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:32:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 1222 transitions. [2019-12-07 12:32:19,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:32:19,724 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:19,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:32:19,724 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:19,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:19,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1756986068, now seen corresponding path program 2 times [2019-12-07 12:32:19,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:19,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264169531] [2019-12-07 12:32:19,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:32:19,893 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 12:32:19,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264169531] [2019-12-07 12:32:19,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:32:19,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:32:19,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698849889] [2019-12-07 12:32:19,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:32:19,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:32:19,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:32:19,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:32:19,894 INFO L87 Difference]: Start difference. First operand 568 states and 1222 transitions. Second operand 12 states. [2019-12-07 12:32:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:32:20,291 INFO L93 Difference]: Finished difference Result 1058 states and 2267 transitions. [2019-12-07 12:32:20,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:32:20,292 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 12:32:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:32:20,292 INFO L225 Difference]: With dead ends: 1058 [2019-12-07 12:32:20,292 INFO L226 Difference]: Without dead ends: 807 [2019-12-07 12:32:20,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:32:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2019-12-07 12:32:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 596. [2019-12-07 12:32:20,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 12:32:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 1269 transitions. [2019-12-07 12:32:20,298 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 1269 transitions. Word has length 66 [2019-12-07 12:32:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:32:20,298 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 1269 transitions. [2019-12-07 12:32:20,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:32:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 1269 transitions. [2019-12-07 12:32:20,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:32:20,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:32:20,299 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:32:20,299 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:32:20,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:32:20,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 3 times [2019-12-07 12:32:20,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:32:20,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419836116] [2019-12-07 12:32:20,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:32:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:32:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:32:20,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:32:20,377 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:32:20,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 |v_ULTIMATE.start_main_~#t189~0.offset_28|) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~z$r_buff0_thd3~0_418) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44| 1)) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t189~0.base_44| 4)) (= v_~z$w_buff0~0_341 0) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44|) |v_ULTIMATE.start_main_~#t189~0.offset_28| 0)) |v_#memory_int_29|) (= 0 v_~weak$$choice0~0_191) (= (select .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44|) 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t189~0.base_44|) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_36|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ULTIMATE.start_main_~#t189~0.base=|v_ULTIMATE.start_main_~#t189~0.base_44|, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_24|, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_23|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_~#t189~0.offset=|v_ULTIMATE.start_main_~#t189~0.offset_28|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_24|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t189~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t190~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t191~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t192~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t189~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t191~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:32:20,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t190~0.base_11|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t190~0.base_11|)) (= |v_ULTIMATE.start_main_~#t190~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t190~0.base_11| 4) |v_#length_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11|) |v_ULTIMATE.start_main_~#t190~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t190~0.offset, #length] because there is no mapped edge [2019-12-07 12:32:20,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t191~0.base_12| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t191~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12|) |v_ULTIMATE.start_main_~#t191~0.offset_11| 2)) |v_#memory_int_21|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12|) 0) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t191~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t191~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_11|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t191~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t191~0.base] because there is no mapped edge [2019-12-07 12:32:20,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t192~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t192~0.base_13| 4) |v_#length_23|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13|) |v_ULTIMATE.start_main_~#t192~0.offset_11| 3)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t192~0.base_13|) (= |v_ULTIMATE.start_main_~#t192~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_~#t192~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:32:20,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 12:32:20,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1799124596 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-1799124596| |P3Thread1of1ForFork2_#t~ite28_Out-1799124596|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1799124596 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff1~0_In-1799124596)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff0~0_In-1799124596) .cse2 (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1799124596|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1799124596|, ~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:32:20,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:32:20,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1149991222 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1149991222| ~z$mem_tmp~0_In-1149991222) (not .cse0)) (and (= ~z~0_In-1149991222 |P3Thread1of1ForFork2_#t~ite48_Out-1149991222|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1149991222|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 12:32:20,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 12:32:20,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 12:32:20,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-686745835 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-686745835| ~z~0_In-686745835)) (and (not .cse0) (= ~z$mem_tmp~0_In-686745835 |P2Thread1of1ForFork1_#t~ite25_Out-686745835|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-686745835|, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:32:20,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In314902365 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In314902365 256) 0))) (or (and (= ~z$w_buff0_used~0_In314902365 |P3Thread1of1ForFork2_#t~ite51_Out314902365|) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out314902365| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out314902365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 12:32:20,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1659670332 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1659670332 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1659670332 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1659670332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1659670332| ~z$w_buff1_used~0_In-1659670332)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1659670332|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1659670332|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 12:32:20,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1666196578 ~z$r_buff0_thd4~0_In-1666196578)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1666196578 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1666196578 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1666196578 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1666196578} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1666196578|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1666196578} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:32:20,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1234116470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1234116470 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1234116470 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1234116470 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1234116470 |P3Thread1of1ForFork2_#t~ite54_Out-1234116470|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1234116470| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1234116470|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 12:32:20,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:32:20,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:32:20,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:32:20,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-238968068 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-238968068 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite60_Out-238968068| |ULTIMATE.start_main_#t~ite59_Out-238968068|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-238968068| ~z~0_In-238968068) .cse2) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-238968068 |ULTIMATE.start_main_#t~ite59_Out-238968068|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ~z~0=~z~0_In-238968068} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-238968068|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-238968068|, ~z~0=~z~0_In-238968068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:32:20,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1425828751 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1425828751 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| ~z$w_buff0_used~0_In1425828751)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1425828751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:32:20,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-308165937 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-308165937 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-308165937 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-308165937 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| ~z$w_buff1_used~0_In-308165937)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-308165937|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:32:20,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In262309130 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In262309130 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In262309130 |ULTIMATE.start_main_#t~ite63_Out262309130|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out262309130|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out262309130|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:32:20,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1603636104 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1603636104 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1603636104 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1603636104 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1603636104| ~z$r_buff1_thd0~0_In1603636104)) (and (= |ULTIMATE.start_main_#t~ite64_Out1603636104| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1603636104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:32:20,399 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:32:20,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:20 BasicIcfg [2019-12-07 12:32:20,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:32:20,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:32:20,482 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:32:20,482 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:32:20,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:31:05" (3/4) ... [2019-12-07 12:32:20,484 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:32:20,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 |v_ULTIMATE.start_main_~#t189~0.offset_28|) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~z$r_buff0_thd3~0_418) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44| 1)) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t189~0.base_44| 4)) (= v_~z$w_buff0~0_341 0) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44|) |v_ULTIMATE.start_main_~#t189~0.offset_28| 0)) |v_#memory_int_29|) (= 0 v_~weak$$choice0~0_191) (= (select .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44|) 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t189~0.base_44|) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_36|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ULTIMATE.start_main_~#t189~0.base=|v_ULTIMATE.start_main_~#t189~0.base_44|, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_24|, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_23|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_~#t189~0.offset=|v_ULTIMATE.start_main_~#t189~0.offset_28|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_24|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t189~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t190~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t191~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t192~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t189~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t191~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:32:20,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t190~0.base_11|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t190~0.base_11|)) (= |v_ULTIMATE.start_main_~#t190~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t190~0.base_11| 4) |v_#length_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11|) |v_ULTIMATE.start_main_~#t190~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t190~0.offset, #length] because there is no mapped edge [2019-12-07 12:32:20,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t191~0.base_12| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t191~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12|) |v_ULTIMATE.start_main_~#t191~0.offset_11| 2)) |v_#memory_int_21|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12|) 0) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t191~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t191~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_11|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t191~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t191~0.base] because there is no mapped edge [2019-12-07 12:32:20,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t192~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t192~0.base_13| 4) |v_#length_23|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13|) |v_ULTIMATE.start_main_~#t192~0.offset_11| 3)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t192~0.base_13|) (= |v_ULTIMATE.start_main_~#t192~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_~#t192~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:32:20,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 12:32:20,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1799124596 256) 0)) (.cse2 (= |P3Thread1of1ForFork2_#t~ite29_Out-1799124596| |P3Thread1of1ForFork2_#t~ite28_Out-1799124596|)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1799124596 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff1~0_In-1799124596)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite28_Out-1799124596| ~z$w_buff0~0_In-1799124596) .cse2 (not .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1799124596|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1799124596|, ~z$w_buff0~0=~z$w_buff0~0_In-1799124596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799124596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1799124596, ~z$w_buff1~0=~z$w_buff1~0_In-1799124596} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 12:32:20,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:32:20,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1149991222 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite48_Out-1149991222| ~z$mem_tmp~0_In-1149991222) (not .cse0)) (and (= ~z~0_In-1149991222 |P3Thread1of1ForFork2_#t~ite48_Out-1149991222|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1149991222, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1149991222|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1149991222, ~z~0=~z~0_In-1149991222} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 12:32:20,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 12:32:20,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 12:32:20,498 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-686745835 256) 0))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-686745835| ~z~0_In-686745835)) (and (not .cse0) (= ~z$mem_tmp~0_In-686745835 |P2Thread1of1ForFork1_#t~ite25_Out-686745835|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-686745835, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-686745835|, ~z$flush_delayed~0=~z$flush_delayed~0_In-686745835, ~z~0=~z~0_In-686745835} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 12:32:20,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In314902365 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In314902365 256) 0))) (or (and (= ~z$w_buff0_used~0_In314902365 |P3Thread1of1ForFork2_#t~ite51_Out314902365|) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out314902365| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out314902365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In314902365, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In314902365} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 12:32:20,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1659670332 256))) (.cse0 (= (mod ~z$r_buff1_thd4~0_In-1659670332 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1659670332 256))) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-1659670332 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P3Thread1of1ForFork2_#t~ite52_Out-1659670332| ~z$w_buff1_used~0_In-1659670332)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1659670332|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1659670332|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1659670332, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1659670332, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1659670332, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1659670332} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 12:32:20,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out-1666196578 ~z$r_buff0_thd4~0_In-1666196578)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1666196578 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1666196578 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~z$r_buff0_thd4~0_Out-1666196578 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1666196578} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1666196578|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1666196578, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1666196578} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:32:20,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1234116470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1234116470 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1234116470 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1234116470 256) 0))) (or (and (= ~z$r_buff1_thd4~0_In-1234116470 |P3Thread1of1ForFork2_#t~ite54_Out-1234116470|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-1234116470| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-1234116470|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 12:32:20,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:32:20,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 12:32:20,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:32:20,500 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-238968068 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-238968068 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite60_Out-238968068| |ULTIMATE.start_main_#t~ite59_Out-238968068|))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-238968068| ~z~0_In-238968068) .cse2) (and (not .cse1) (not .cse0) (= ~z$w_buff1~0_In-238968068 |ULTIMATE.start_main_#t~ite59_Out-238968068|) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ~z~0=~z~0_In-238968068} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-238968068|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-238968068, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-238968068, ~z$w_buff1~0=~z$w_buff1~0_In-238968068, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-238968068|, ~z~0=~z~0_In-238968068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:32:20,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1425828751 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1425828751 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| ~z$w_buff0_used~0_In1425828751)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1425828751| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1425828751, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1425828751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1425828751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:32:20,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd0~0_In-308165937 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-308165937 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-308165937 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-308165937 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out-308165937| ~z$w_buff1_used~0_In-308165937)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-308165937|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-308165937, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-308165937, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-308165937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-308165937} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:32:20,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In262309130 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In262309130 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In262309130 |ULTIMATE.start_main_#t~ite63_Out262309130|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out262309130|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out262309130|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In262309130, ~z$w_buff0_used~0=~z$w_buff0_used~0_In262309130} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:32:20,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1603636104 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1603636104 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1603636104 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1603636104 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out1603636104| ~z$r_buff1_thd0~0_In1603636104)) (and (= |ULTIMATE.start_main_#t~ite64_Out1603636104| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1603636104|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:32:20,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:32:20,575 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0c450042-097c-4b6e-8eee-db637669e36f/bin/uautomizer/witness.graphml [2019-12-07 12:32:20,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:32:20,577 INFO L168 Benchmark]: Toolchain (without parser) took 76008.54 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 935.3 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 12:32:20,577 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:20,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 451.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -108.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:20,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:32:20,578 INFO L168 Benchmark]: Boogie Preprocessor took 35.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:20,578 INFO L168 Benchmark]: RCFGBuilder took 471.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 975.5 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:20,579 INFO L168 Benchmark]: TraceAbstraction took 74902.20 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 975.5 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 12:32:20,579 INFO L168 Benchmark]: Witness Printer took 93.36 ms. Allocated memory is still 6.8 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 12:32:20,580 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 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 451.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 81.3 MB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -108.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 471.33 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 975.5 MB in the end (delta: 62.7 MB). Peak memory consumption was 62.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 74902.20 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 975.5 MB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. * Witness Printer took 93.36 ms. Allocated memory is still 6.8 GB. Free memory was 3.7 GB in the beginning and 3.7 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 74.6s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4507 SDtfs, 7946 SDslu, 9876 SDs, 0 SdLazy, 4786 SolverSat, 292 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205249occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 41.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 144042 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 804 NumberOfCodeBlocks, 804 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 718 ConstructedInterpolants, 0 QuantifiedInterpolants, 271372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...