./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.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_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/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 cd0cdc5f7297a22308aa354a86d663540671ba84 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:00:04,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:00:04,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:00:04,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:00:04,225 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:00:04,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:00:04,227 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:00:04,229 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:00:04,231 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:00:04,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:00:04,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:00:04,233 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:00:04,233 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:00:04,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:00:04,234 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:00:04,235 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:00:04,236 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:00:04,237 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:00:04,238 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:00:04,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:00:04,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:00:04,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:00:04,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:00:04,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:00:04,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:00:04,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:00:04,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:00:04,245 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:00:04,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:00:04,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:00:04,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:00:04,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:00:04,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:00:04,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:00:04,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:00:04,248 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:00:04,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:00:04,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:00:04,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:00:04,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:00:04,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:00:04,251 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 19:00:04,264 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:00:04,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:00:04,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 19:00:04,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 19:00:04,265 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 19:00:04,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:00:04,265 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:00:04,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:00:04,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:00:04,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:00:04,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:00:04,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:00:04,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:00:04,266 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:00:04,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:00:04,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:00:04,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:00:04,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:00:04,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 19:00:04,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:00:04,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:00:04,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:00:04,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:00:04,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:00:04,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:00:04,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 19:00:04,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:00:04,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:00:04,268 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:00:04,268 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_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/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 -> cd0cdc5f7297a22308aa354a86d663540671ba84 [2019-12-07 19:00:04,365 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:00:04,372 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:00:04,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:00:04,375 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:00:04,375 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:00:04,376 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.i [2019-12-07 19:00:04,413 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/data/e6c6e085e/806b852854334f08b92d1b799d9c4f32/FLAGe2f97aaec [2019-12-07 19:00:04,817 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:00:04,817 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/sv-benchmarks/c/pthread-wmm/rfi008_power.oepc.i [2019-12-07 19:00:04,830 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/data/e6c6e085e/806b852854334f08b92d1b799d9c4f32/FLAGe2f97aaec [2019-12-07 19:00:04,840 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/data/e6c6e085e/806b852854334f08b92d1b799d9c4f32 [2019-12-07 19:00:04,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:00:04,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:00:04,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:04,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:00:04,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:00:04,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:04" (1/1) ... [2019-12-07 19:00:04,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:04, skipping insertion in model container [2019-12-07 19:00:04,848 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:00:04" (1/1) ... [2019-12-07 19:00:04,853 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:00:04,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:00:05,134 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:05,142 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:00:05,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:00:05,234 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:00:05,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05 WrapperNode [2019-12-07 19:00:05,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:00:05,235 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:05,235 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:00:05,235 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:00:05,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:00:05,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:00:05,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:00:05,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:00:05,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... [2019-12-07 19:00:05,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:00:05,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:00:05,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:00:05,307 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:00:05,307 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/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 19:00:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 19:00:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 19:00:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 19:00:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 19:00:05,350 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 19:00:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 19:00:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 19:00:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 19:00:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 19:00:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:00:05,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:00:05,352 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 19:00:05,769 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:00:05,770 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 19:00:05,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:05 BoogieIcfgContainer [2019-12-07 19:00:05,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:00:05,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:00:05,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:00:05,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:00:05,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:00:04" (1/3) ... [2019-12-07 19:00:05,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0dfc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:05, skipping insertion in model container [2019-12-07 19:00:05,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:00:05" (2/3) ... [2019-12-07 19:00:05,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0dfc23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:00:05, skipping insertion in model container [2019-12-07 19:00:05,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:05" (3/3) ... [2019-12-07 19:00:05,775 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc.i [2019-12-07 19:00:05,781 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 19:00:05,781 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:00:05,786 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 19:00:05,787 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 19:00:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,814 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,814 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,815 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,829 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,837 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 19:00:05,850 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 19:00:05,863 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:00:05,863 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:00:05,863 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:00:05,863 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:00:05,863 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:00:05,863 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:00:05,863 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:00:05,863 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:00:05,874 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-07 19:00:05,875 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 19:00:05,938 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 19:00:05,938 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:00:05,952 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 19:00:05,975 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-07 19:00:06,011 INFO L134 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-07 19:00:06,011 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 19:00:06,020 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1046 event pairs. 6/186 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-07 19:00:06,046 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-07 19:00:06,047 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 19:00:09,278 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-12-07 19:00:09,450 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 19:00:09,547 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146813 [2019-12-07 19:00:09,547 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 19:00:09,550 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 136 transitions [2019-12-07 19:00:11,132 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 29658 states. [2019-12-07 19:00:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 29658 states. [2019-12-07 19:00:11,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 19:00:11,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:11,138 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 19:00:11,138 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1084682, now seen corresponding path program 1 times [2019-12-07 19:00:11,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:11,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758952858] [2019-12-07 19:00:11,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:11,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:11,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758952858] [2019-12-07 19:00:11,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:11,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:00:11,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262058030] [2019-12-07 19:00:11,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:11,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:11,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:11,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:11,322 INFO L87 Difference]: Start difference. First operand 29658 states. Second operand 3 states. [2019-12-07 19:00:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:11,635 INFO L93 Difference]: Finished difference Result 29506 states and 103746 transitions. [2019-12-07 19:00:11,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:11,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 19:00:11,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:11,787 INFO L225 Difference]: With dead ends: 29506 [2019-12-07 19:00:11,787 INFO L226 Difference]: Without dead ends: 27490 [2019-12-07 19:00:11,788 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 19:00:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27490 states. [2019-12-07 19:00:12,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27490 to 27490. [2019-12-07 19:00:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27490 states. [2019-12-07 19:00:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27490 states to 27490 states and 96576 transitions. [2019-12-07 19:00:12,797 INFO L78 Accepts]: Start accepts. Automaton has 27490 states and 96576 transitions. Word has length 3 [2019-12-07 19:00:12,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:12,797 INFO L462 AbstractCegarLoop]: Abstraction has 27490 states and 96576 transitions. [2019-12-07 19:00:12,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27490 states and 96576 transitions. [2019-12-07 19:00:12,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 19:00:12,800 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:12,800 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:12,800 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -272589760, now seen corresponding path program 1 times [2019-12-07 19:00:12,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:12,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357807041] [2019-12-07 19:00:12,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:12,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:12,859 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 19:00:12,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357807041] [2019-12-07 19:00:12,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:12,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:00:12,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375251523] [2019-12-07 19:00:12,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:12,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:12,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:12,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:12,862 INFO L87 Difference]: Start difference. First operand 27490 states and 96576 transitions. Second operand 4 states. [2019-12-07 19:00:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:13,264 INFO L93 Difference]: Finished difference Result 43940 states and 147802 transitions. [2019-12-07 19:00:13,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:00:13,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 19:00:13,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:13,357 INFO L225 Difference]: With dead ends: 43940 [2019-12-07 19:00:13,357 INFO L226 Difference]: Without dead ends: 43933 [2019-12-07 19:00:13,358 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 19:00:13,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43933 states. [2019-12-07 19:00:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43933 to 42445. [2019-12-07 19:00:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42445 states. [2019-12-07 19:00:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42445 states to 42445 states and 143845 transitions. [2019-12-07 19:00:14,524 INFO L78 Accepts]: Start accepts. Automaton has 42445 states and 143845 transitions. Word has length 11 [2019-12-07 19:00:14,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:14,524 INFO L462 AbstractCegarLoop]: Abstraction has 42445 states and 143845 transitions. [2019-12-07 19:00:14,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 42445 states and 143845 transitions. [2019-12-07 19:00:14,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 19:00:14,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:14,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:14,530 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:14,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:14,530 INFO L82 PathProgramCache]: Analyzing trace with hash 295368792, now seen corresponding path program 1 times [2019-12-07 19:00:14,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:14,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823739023] [2019-12-07 19:00:14,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:14,585 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 19:00:14,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823739023] [2019-12-07 19:00:14,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:14,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:00:14,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206489952] [2019-12-07 19:00:14,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:14,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:14,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:14,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:14,586 INFO L87 Difference]: Start difference. First operand 42445 states and 143845 transitions. Second operand 4 states. [2019-12-07 19:00:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:15,013 INFO L93 Difference]: Finished difference Result 54065 states and 181150 transitions. [2019-12-07 19:00:15,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:00:15,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 19:00:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:15,107 INFO L225 Difference]: With dead ends: 54065 [2019-12-07 19:00:15,107 INFO L226 Difference]: Without dead ends: 54065 [2019-12-07 19:00:15,108 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 19:00:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54065 states. [2019-12-07 19:00:16,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54065 to 48429. [2019-12-07 19:00:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48429 states. [2019-12-07 19:00:16,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48429 states to 48429 states and 163514 transitions. [2019-12-07 19:00:16,370 INFO L78 Accepts]: Start accepts. Automaton has 48429 states and 163514 transitions. Word has length 14 [2019-12-07 19:00:16,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:16,370 INFO L462 AbstractCegarLoop]: Abstraction has 48429 states and 163514 transitions. [2019-12-07 19:00:16,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:16,371 INFO L276 IsEmpty]: Start isEmpty. Operand 48429 states and 163514 transitions. [2019-12-07 19:00:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 19:00:16,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:16,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:16,374 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:16,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:16,374 INFO L82 PathProgramCache]: Analyzing trace with hash 566526596, now seen corresponding path program 1 times [2019-12-07 19:00:16,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:16,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129938341] [2019-12-07 19:00:16,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:16,407 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 19:00:16,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129938341] [2019-12-07 19:00:16,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:16,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:16,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022699387] [2019-12-07 19:00:16,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:16,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:16,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:16,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:16,408 INFO L87 Difference]: Start difference. First operand 48429 states and 163514 transitions. Second operand 3 states. [2019-12-07 19:00:16,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:16,693 INFO L93 Difference]: Finished difference Result 84362 states and 273188 transitions. [2019-12-07 19:00:16,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:16,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 19:00:16,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:16,837 INFO L225 Difference]: With dead ends: 84362 [2019-12-07 19:00:16,837 INFO L226 Difference]: Without dead ends: 84362 [2019-12-07 19:00:16,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84362 states. [2019-12-07 19:00:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84362 to 74579. [2019-12-07 19:00:18,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74579 states. [2019-12-07 19:00:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74579 states to 74579 states and 244551 transitions. [2019-12-07 19:00:18,571 INFO L78 Accepts]: Start accepts. Automaton has 74579 states and 244551 transitions. Word has length 15 [2019-12-07 19:00:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:18,571 INFO L462 AbstractCegarLoop]: Abstraction has 74579 states and 244551 transitions. [2019-12-07 19:00:18,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 74579 states and 244551 transitions. [2019-12-07 19:00:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 19:00:18,575 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:18,575 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:18,575 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:18,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:18,575 INFO L82 PathProgramCache]: Analyzing trace with hash 965979864, now seen corresponding path program 1 times [2019-12-07 19:00:18,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:18,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133028014] [2019-12-07 19:00:18,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:18,629 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 19:00:18,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133028014] [2019-12-07 19:00:18,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:18,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 19:00:18,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94696200] [2019-12-07 19:00:18,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:18,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:18,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:18,630 INFO L87 Difference]: Start difference. First operand 74579 states and 244551 transitions. Second operand 3 states. [2019-12-07 19:00:18,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:18,876 INFO L93 Difference]: Finished difference Result 74600 states and 244461 transitions. [2019-12-07 19:00:18,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:18,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 19:00:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:19,000 INFO L225 Difference]: With dead ends: 74600 [2019-12-07 19:00:19,000 INFO L226 Difference]: Without dead ends: 74600 [2019-12-07 19:00:19,000 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 19:00:19,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-07 19:00:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74508. [2019-12-07 19:00:20,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74508 states. [2019-12-07 19:00:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74508 states to 74508 states and 244321 transitions. [2019-12-07 19:00:20,626 INFO L78 Accepts]: Start accepts. Automaton has 74508 states and 244321 transitions. Word has length 16 [2019-12-07 19:00:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:20,626 INFO L462 AbstractCegarLoop]: Abstraction has 74508 states and 244321 transitions. [2019-12-07 19:00:20,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 74508 states and 244321 transitions. [2019-12-07 19:00:20,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:00:20,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:20,631 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:20,631 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:20,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:20,631 INFO L82 PathProgramCache]: Analyzing trace with hash -119401417, now seen corresponding path program 1 times [2019-12-07 19:00:20,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:20,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805843436] [2019-12-07 19:00:20,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:20,661 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 19:00:20,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805843436] [2019-12-07 19:00:20,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:20,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:00:20,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723671991] [2019-12-07 19:00:20,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:20,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:20,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:20,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:20,663 INFO L87 Difference]: Start difference. First operand 74508 states and 244321 transitions. Second operand 3 states. [2019-12-07 19:00:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:20,987 INFO L93 Difference]: Finished difference Result 74508 states and 240926 transitions. [2019-12-07 19:00:20,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:20,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 19:00:20,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:21,113 INFO L225 Difference]: With dead ends: 74508 [2019-12-07 19:00:21,113 INFO L226 Difference]: Without dead ends: 74508 [2019-12-07 19:00:21,113 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 19:00:21,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74508 states. [2019-12-07 19:00:22,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74508 to 74308. [2019-12-07 19:00:22,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74308 states. [2019-12-07 19:00:22,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74308 states to 74308 states and 240334 transitions. [2019-12-07 19:00:22,668 INFO L78 Accepts]: Start accepts. Automaton has 74308 states and 240334 transitions. Word has length 17 [2019-12-07 19:00:22,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:22,668 INFO L462 AbstractCegarLoop]: Abstraction has 74308 states and 240334 transitions. [2019-12-07 19:00:22,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:22,668 INFO L276 IsEmpty]: Start isEmpty. Operand 74308 states and 240334 transitions. [2019-12-07 19:00:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:00:22,673 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:22,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:22,673 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:22,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:22,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1206611411, now seen corresponding path program 1 times [2019-12-07 19:00:22,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:22,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82237035] [2019-12-07 19:00:22,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:22,725 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 19:00:22,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82237035] [2019-12-07 19:00:22,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:22,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:00:22,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563061090] [2019-12-07 19:00:22,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:22,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:22,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:22,727 INFO L87 Difference]: Start difference. First operand 74308 states and 240334 transitions. Second operand 4 states. [2019-12-07 19:00:22,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:22,953 INFO L93 Difference]: Finished difference Result 69911 states and 225616 transitions. [2019-12-07 19:00:22,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:22,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 19:00:22,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:23,066 INFO L225 Difference]: With dead ends: 69911 [2019-12-07 19:00:23,066 INFO L226 Difference]: Without dead ends: 69911 [2019-12-07 19:00:23,066 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 19:00:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69911 states. [2019-12-07 19:00:24,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69911 to 69911. [2019-12-07 19:00:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69911 states. [2019-12-07 19:00:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69911 states to 69911 states and 225616 transitions. [2019-12-07 19:00:24,603 INFO L78 Accepts]: Start accepts. Automaton has 69911 states and 225616 transitions. Word has length 17 [2019-12-07 19:00:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:24,603 INFO L462 AbstractCegarLoop]: Abstraction has 69911 states and 225616 transitions. [2019-12-07 19:00:24,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 69911 states and 225616 transitions. [2019-12-07 19:00:24,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 19:00:24,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:24,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:24,607 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:24,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:24,607 INFO L82 PathProgramCache]: Analyzing trace with hash -759251224, now seen corresponding path program 1 times [2019-12-07 19:00:24,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:24,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097025112] [2019-12-07 19:00:24,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:24,634 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 19:00:24,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097025112] [2019-12-07 19:00:24,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:24,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:00:24,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642160224] [2019-12-07 19:00:24,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:24,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:24,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:24,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:24,636 INFO L87 Difference]: Start difference. First operand 69911 states and 225616 transitions. Second operand 4 states. [2019-12-07 19:00:25,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:25,075 INFO L93 Difference]: Finished difference Result 85438 states and 273755 transitions. [2019-12-07 19:00:25,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 19:00:25,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 19:00:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:25,211 INFO L225 Difference]: With dead ends: 85438 [2019-12-07 19:00:25,212 INFO L226 Difference]: Without dead ends: 85438 [2019-12-07 19:00:25,212 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 19:00:25,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85438 states. [2019-12-07 19:00:26,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85438 to 70560. [2019-12-07 19:00:26,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70560 states. [2019-12-07 19:00:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70560 states to 70560 states and 227731 transitions. [2019-12-07 19:00:26,917 INFO L78 Accepts]: Start accepts. Automaton has 70560 states and 227731 transitions. Word has length 17 [2019-12-07 19:00:26,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:26,917 INFO L462 AbstractCegarLoop]: Abstraction has 70560 states and 227731 transitions. [2019-12-07 19:00:26,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:26,917 INFO L276 IsEmpty]: Start isEmpty. Operand 70560 states and 227731 transitions. [2019-12-07 19:00:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 19:00:26,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:26,924 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 19:00:26,924 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:26,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:26,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2046192734, now seen corresponding path program 1 times [2019-12-07 19:00:26,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:26,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075533642] [2019-12-07 19:00:26,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:26,945 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 19:00:26,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075533642] [2019-12-07 19:00:26,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:26,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:00:26,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987376832] [2019-12-07 19:00:26,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:26,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:26,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:26,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:26,947 INFO L87 Difference]: Start difference. First operand 70560 states and 227731 transitions. Second operand 3 states. [2019-12-07 19:00:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:26,965 INFO L93 Difference]: Finished difference Result 6495 states and 15036 transitions. [2019-12-07 19:00:26,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:26,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 19:00:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:26,970 INFO L225 Difference]: With dead ends: 6495 [2019-12-07 19:00:26,970 INFO L226 Difference]: Without dead ends: 6495 [2019-12-07 19:00:26,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-12-07 19:00:27,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 6495. [2019-12-07 19:00:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6495 states. [2019-12-07 19:00:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6495 states to 6495 states and 15036 transitions. [2019-12-07 19:00:27,030 INFO L78 Accepts]: Start accepts. Automaton has 6495 states and 15036 transitions. Word has length 20 [2019-12-07 19:00:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:27,030 INFO L462 AbstractCegarLoop]: Abstraction has 6495 states and 15036 transitions. [2019-12-07 19:00:27,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 6495 states and 15036 transitions. [2019-12-07 19:00:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 19:00:27,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:27,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:27,033 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:27,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1258171186, now seen corresponding path program 1 times [2019-12-07 19:00:27,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:27,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496567195] [2019-12-07 19:00:27,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:27,064 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 19:00:27,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496567195] [2019-12-07 19:00:27,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:27,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:27,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649833675] [2019-12-07 19:00:27,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:00:27,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:27,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:00:27,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:00:27,066 INFO L87 Difference]: Start difference. First operand 6495 states and 15036 transitions. Second operand 5 states. [2019-12-07 19:00:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:27,309 INFO L93 Difference]: Finished difference Result 8792 states and 19920 transitions. [2019-12-07 19:00:27,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:00:27,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 19:00:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:27,316 INFO L225 Difference]: With dead ends: 8792 [2019-12-07 19:00:27,316 INFO L226 Difference]: Without dead ends: 8792 [2019-12-07 19:00:27,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:00:27,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2019-12-07 19:00:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 7888. [2019-12-07 19:00:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7888 states. [2019-12-07 19:00:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7888 states to 7888 states and 18089 transitions. [2019-12-07 19:00:27,394 INFO L78 Accepts]: Start accepts. Automaton has 7888 states and 18089 transitions. Word has length 27 [2019-12-07 19:00:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:27,394 INFO L462 AbstractCegarLoop]: Abstraction has 7888 states and 18089 transitions. [2019-12-07 19:00:27,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:00:27,395 INFO L276 IsEmpty]: Start isEmpty. Operand 7888 states and 18089 transitions. [2019-12-07 19:00:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 19:00:27,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:27,398 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] [2019-12-07 19:00:27,398 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:27,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:27,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1366134434, now seen corresponding path program 1 times [2019-12-07 19:00:27,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:27,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386355181] [2019-12-07 19:00:27,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:27,417 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 19:00:27,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386355181] [2019-12-07 19:00:27,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:27,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554649567] [2019-12-07 19:00:27,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:00:27,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:27,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:00:27,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:27,418 INFO L87 Difference]: Start difference. First operand 7888 states and 18089 transitions. Second operand 3 states. [2019-12-07 19:00:27,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:27,470 INFO L93 Difference]: Finished difference Result 8877 states and 19243 transitions. [2019-12-07 19:00:27,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:00:27,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 19:00:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:27,477 INFO L225 Difference]: With dead ends: 8877 [2019-12-07 19:00:27,477 INFO L226 Difference]: Without dead ends: 8877 [2019-12-07 19:00:27,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:00:27,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8877 states. [2019-12-07 19:00:27,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8877 to 7937. [2019-12-07 19:00:27,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7937 states. [2019-12-07 19:00:27,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7937 states to 7937 states and 17330 transitions. [2019-12-07 19:00:27,556 INFO L78 Accepts]: Start accepts. Automaton has 7937 states and 17330 transitions. Word has length 30 [2019-12-07 19:00:27,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:27,557 INFO L462 AbstractCegarLoop]: Abstraction has 7937 states and 17330 transitions. [2019-12-07 19:00:27,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:00:27,557 INFO L276 IsEmpty]: Start isEmpty. Operand 7937 states and 17330 transitions. [2019-12-07 19:00:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 19:00:27,561 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:27,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:27,562 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash -736726388, now seen corresponding path program 1 times [2019-12-07 19:00:27,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:27,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338100896] [2019-12-07 19:00:27,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:27,600 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 19:00:27,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338100896] [2019-12-07 19:00:27,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:27,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:27,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570904800] [2019-12-07 19:00:27,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:00:27,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:27,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:00:27,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:00:27,602 INFO L87 Difference]: Start difference. First operand 7937 states and 17330 transitions. Second operand 5 states. [2019-12-07 19:00:27,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:27,840 INFO L93 Difference]: Finished difference Result 9260 states and 19952 transitions. [2019-12-07 19:00:27,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 19:00:27,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 19:00:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:27,847 INFO L225 Difference]: With dead ends: 9260 [2019-12-07 19:00:27,847 INFO L226 Difference]: Without dead ends: 9260 [2019-12-07 19:00:27,847 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 19:00:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9260 states. [2019-12-07 19:00:27,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9260 to 7281. [2019-12-07 19:00:27,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7281 states. [2019-12-07 19:00:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7281 states to 7281 states and 15997 transitions. [2019-12-07 19:00:27,918 INFO L78 Accepts]: Start accepts. Automaton has 7281 states and 15997 transitions. Word has length 33 [2019-12-07 19:00:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:27,919 INFO L462 AbstractCegarLoop]: Abstraction has 7281 states and 15997 transitions. [2019-12-07 19:00:27,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:00:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 7281 states and 15997 transitions. [2019-12-07 19:00:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 19:00:27,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:27,924 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] [2019-12-07 19:00:27,924 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:27,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:27,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1616999435, now seen corresponding path program 1 times [2019-12-07 19:00:27,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:27,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798764593] [2019-12-07 19:00:27,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:28,008 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 19:00:28,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798764593] [2019-12-07 19:00:28,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:28,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 19:00:28,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123749104] [2019-12-07 19:00:28,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:00:28,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:28,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:00:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:00:28,009 INFO L87 Difference]: Start difference. First operand 7281 states and 15997 transitions. Second operand 8 states. [2019-12-07 19:00:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:28,688 INFO L93 Difference]: Finished difference Result 10138 states and 21631 transitions. [2019-12-07 19:00:28,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 19:00:28,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-07 19:00:28,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:28,696 INFO L225 Difference]: With dead ends: 10138 [2019-12-07 19:00:28,696 INFO L226 Difference]: Without dead ends: 10137 [2019-12-07 19:00:28,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 19:00:28,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10137 states. [2019-12-07 19:00:28,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10137 to 8685. [2019-12-07 19:00:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8685 states. [2019-12-07 19:00:28,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8685 states to 8685 states and 18822 transitions. [2019-12-07 19:00:28,779 INFO L78 Accepts]: Start accepts. Automaton has 8685 states and 18822 transitions. Word has length 39 [2019-12-07 19:00:28,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:28,780 INFO L462 AbstractCegarLoop]: Abstraction has 8685 states and 18822 transitions. [2019-12-07 19:00:28,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:00:28,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8685 states and 18822 transitions. [2019-12-07 19:00:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 19:00:28,786 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:28,786 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] [2019-12-07 19:00:28,787 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:28,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:28,787 INFO L82 PathProgramCache]: Analyzing trace with hash 27659275, now seen corresponding path program 1 times [2019-12-07 19:00:28,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:28,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866790800] [2019-12-07 19:00:28,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:28,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:28,929 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 19:00:28,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866790800] [2019-12-07 19:00:28,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:28,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:00:28,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215660712] [2019-12-07 19:00:28,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 19:00:28,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:28,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 19:00:28,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:00:28,930 INFO L87 Difference]: Start difference. First operand 8685 states and 18822 transitions. Second operand 9 states. [2019-12-07 19:00:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:29,071 INFO L93 Difference]: Finished difference Result 8735 states and 18922 transitions. [2019-12-07 19:00:29,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 19:00:29,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2019-12-07 19:00:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:29,078 INFO L225 Difference]: With dead ends: 8735 [2019-12-07 19:00:29,078 INFO L226 Difference]: Without dead ends: 8735 [2019-12-07 19:00:29,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:00:29,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8735 states. [2019-12-07 19:00:29,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8735 to 8735. [2019-12-07 19:00:29,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8735 states. [2019-12-07 19:00:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8735 states to 8735 states and 18922 transitions. [2019-12-07 19:00:29,156 INFO L78 Accepts]: Start accepts. Automaton has 8735 states and 18922 transitions. Word has length 42 [2019-12-07 19:00:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:29,157 INFO L462 AbstractCegarLoop]: Abstraction has 8735 states and 18922 transitions. [2019-12-07 19:00:29,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 19:00:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8735 states and 18922 transitions. [2019-12-07 19:00:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 19:00:29,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:29,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:00:29,164 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:29,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:29,164 INFO L82 PathProgramCache]: Analyzing trace with hash 857431396, now seen corresponding path program 1 times [2019-12-07 19:00:29,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:29,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30731136] [2019-12-07 19:00:29,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:29,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 19:00:29,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30731136] [2019-12-07 19:00:29,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:29,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:00:29,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812199174] [2019-12-07 19:00:29,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 19:00:29,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:29,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 19:00:29,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 19:00:29,224 INFO L87 Difference]: Start difference. First operand 8735 states and 18922 transitions. Second operand 6 states. [2019-12-07 19:00:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:29,321 INFO L93 Difference]: Finished difference Result 12549 states and 27279 transitions. [2019-12-07 19:00:29,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 19:00:29,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-07 19:00:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:29,328 INFO L225 Difference]: With dead ends: 12549 [2019-12-07 19:00:29,328 INFO L226 Difference]: Without dead ends: 10359 [2019-12-07 19:00:29,329 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 19:00:29,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10359 states. [2019-12-07 19:00:29,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10359 to 10359. [2019-12-07 19:00:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-12-07 19:00:29,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 22541 transitions. [2019-12-07 19:00:29,420 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 22541 transitions. Word has length 43 [2019-12-07 19:00:29,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:29,420 INFO L462 AbstractCegarLoop]: Abstraction has 10359 states and 22541 transitions. [2019-12-07 19:00:29,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 19:00:29,421 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 22541 transitions. [2019-12-07 19:00:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 19:00:29,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:29,431 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] [2019-12-07 19:00:29,431 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:29,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:29,432 INFO L82 PathProgramCache]: Analyzing trace with hash 520873357, now seen corresponding path program 1 times [2019-12-07 19:00:29,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:29,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391716499] [2019-12-07 19:00:29,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:29,470 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 19:00:29,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391716499] [2019-12-07 19:00:29,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:29,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:29,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682282793] [2019-12-07 19:00:29,471 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:29,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:29,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:29,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:29,471 INFO L87 Difference]: Start difference. First operand 10359 states and 22541 transitions. Second operand 4 states. [2019-12-07 19:00:29,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:29,501 INFO L93 Difference]: Finished difference Result 7471 states and 16306 transitions. [2019-12-07 19:00:29,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:29,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-07 19:00:29,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:29,508 INFO L225 Difference]: With dead ends: 7471 [2019-12-07 19:00:29,508 INFO L226 Difference]: Without dead ends: 7165 [2019-12-07 19:00:29,508 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 19:00:29,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7165 states. [2019-12-07 19:00:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7165 to 6292. [2019-12-07 19:00:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6292 states. [2019-12-07 19:00:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6292 states to 6292 states and 13989 transitions. [2019-12-07 19:00:29,590 INFO L78 Accepts]: Start accepts. Automaton has 6292 states and 13989 transitions. Word has length 44 [2019-12-07 19:00:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:29,590 INFO L462 AbstractCegarLoop]: Abstraction has 6292 states and 13989 transitions. [2019-12-07 19:00:29,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:29,591 INFO L276 IsEmpty]: Start isEmpty. Operand 6292 states and 13989 transitions. [2019-12-07 19:00:29,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 19:00:29,598 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:29,598 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, 1, 1, 1] [2019-12-07 19:00:29,598 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash 19697383, now seen corresponding path program 1 times [2019-12-07 19:00:29,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:29,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760046774] [2019-12-07 19:00:29,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:29,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:29,639 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 19:00:29,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760046774] [2019-12-07 19:00:29,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:29,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:29,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498449998] [2019-12-07 19:00:29,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:29,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:29,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:29,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:29,640 INFO L87 Difference]: Start difference. First operand 6292 states and 13989 transitions. Second operand 4 states. [2019-12-07 19:00:29,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:29,710 INFO L93 Difference]: Finished difference Result 7523 states and 16595 transitions. [2019-12-07 19:00:29,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:29,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-07 19:00:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:29,716 INFO L225 Difference]: With dead ends: 7523 [2019-12-07 19:00:29,716 INFO L226 Difference]: Without dead ends: 7523 [2019-12-07 19:00:29,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 19:00:29,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7523 states. [2019-12-07 19:00:29,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7523 to 6657. [2019-12-07 19:00:29,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6657 states. [2019-12-07 19:00:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 14799 transitions. [2019-12-07 19:00:29,785 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 14799 transitions. Word has length 69 [2019-12-07 19:00:29,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:29,785 INFO L462 AbstractCegarLoop]: Abstraction has 6657 states and 14799 transitions. [2019-12-07 19:00:29,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:29,785 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 14799 transitions. [2019-12-07 19:00:29,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 19:00:29,793 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:29,793 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, 1, 1, 1, 1] [2019-12-07 19:00:29,793 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:29,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:29,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1913503134, now seen corresponding path program 1 times [2019-12-07 19:00:29,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:29,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867851306] [2019-12-07 19:00:29,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:29,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:29,892 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 19:00:29,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867851306] [2019-12-07 19:00:29,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:29,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:00:29,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609313627] [2019-12-07 19:00:29,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:00:29,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:00:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:00:29,894 INFO L87 Difference]: Start difference. First operand 6657 states and 14799 transitions. Second operand 8 states. [2019-12-07 19:00:30,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:30,191 INFO L93 Difference]: Finished difference Result 11613 states and 25657 transitions. [2019-12-07 19:00:30,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 19:00:30,191 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-12-07 19:00:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:30,198 INFO L225 Difference]: With dead ends: 11613 [2019-12-07 19:00:30,198 INFO L226 Difference]: Without dead ends: 10823 [2019-12-07 19:00:30,199 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-12-07 19:00:30,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10823 states. [2019-12-07 19:00:30,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10823 to 8095. [2019-12-07 19:00:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8095 states. [2019-12-07 19:00:30,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8095 states to 8095 states and 18217 transitions. [2019-12-07 19:00:30,290 INFO L78 Accepts]: Start accepts. Automaton has 8095 states and 18217 transitions. Word has length 70 [2019-12-07 19:00:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:30,290 INFO L462 AbstractCegarLoop]: Abstraction has 8095 states and 18217 transitions. [2019-12-07 19:00:30,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:00:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 8095 states and 18217 transitions. [2019-12-07 19:00:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 19:00:30,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:30,298 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, 1, 1, 1, 1] [2019-12-07 19:00:30,298 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash -197595914, now seen corresponding path program 2 times [2019-12-07 19:00:30,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:30,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650661528] [2019-12-07 19:00:30,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:00:30,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650661528] [2019-12-07 19:00:30,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:30,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:00:30,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383911400] [2019-12-07 19:00:30,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:00:30,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:00:30,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:00:30,354 INFO L87 Difference]: Start difference. First operand 8095 states and 18217 transitions. Second operand 4 states. [2019-12-07 19:00:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:30,385 INFO L93 Difference]: Finished difference Result 8824 states and 19772 transitions. [2019-12-07 19:00:30,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:00:30,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 19:00:30,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:30,386 INFO L225 Difference]: With dead ends: 8824 [2019-12-07 19:00:30,386 INFO L226 Difference]: Without dead ends: 891 [2019-12-07 19:00:30,386 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 19:00:30,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2019-12-07 19:00:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2019-12-07 19:00:30,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2019-12-07 19:00:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1854 transitions. [2019-12-07 19:00:30,393 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1854 transitions. Word has length 70 [2019-12-07 19:00:30,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:30,393 INFO L462 AbstractCegarLoop]: Abstraction has 891 states and 1854 transitions. [2019-12-07 19:00:30,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:00:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1854 transitions. [2019-12-07 19:00:30,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 19:00:30,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:30,394 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, 1, 1, 1, 1, 1] [2019-12-07 19:00:30,395 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:30,395 INFO L82 PathProgramCache]: Analyzing trace with hash -101462227, now seen corresponding path program 1 times [2019-12-07 19:00:30,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:30,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930193387] [2019-12-07 19:00:30,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:30,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:00:30,457 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 19:00:30,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930193387] [2019-12-07 19:00:30,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:00:30,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 19:00:30,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434571801] [2019-12-07 19:00:30,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 19:00:30,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 19:00:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 19:00:30,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 19:00:30,458 INFO L87 Difference]: Start difference. First operand 891 states and 1854 transitions. Second operand 8 states. [2019-12-07 19:00:30,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:00:30,615 INFO L93 Difference]: Finished difference Result 1714 states and 3463 transitions. [2019-12-07 19:00:30,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 19:00:30,615 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 71 [2019-12-07 19:00:30,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:00:30,616 INFO L225 Difference]: With dead ends: 1714 [2019-12-07 19:00:30,616 INFO L226 Difference]: Without dead ends: 1263 [2019-12-07 19:00:30,617 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 19:00:30,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-12-07 19:00:30,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 923. [2019-12-07 19:00:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-12-07 19:00:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1914 transitions. [2019-12-07 19:00:30,624 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1914 transitions. Word has length 71 [2019-12-07 19:00:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:00:30,624 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1914 transitions. [2019-12-07 19:00:30,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 19:00:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1914 transitions. [2019-12-07 19:00:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 19:00:30,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:00:30,625 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, 1, 1, 1, 1, 1] [2019-12-07 19:00:30,625 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:00:30,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:00:30,625 INFO L82 PathProgramCache]: Analyzing trace with hash 477046829, now seen corresponding path program 2 times [2019-12-07 19:00:30,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 19:00:30,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510041420] [2019-12-07 19:00:30,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:00:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:00:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 19:00:30,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 19:00:30,700 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 19:00:30,702 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51| 1)) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 |v_ULTIMATE.start_main_~#t1721~0.offset_32|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1721~0.base_51|) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51|) |v_ULTIMATE.start_main_~#t1721~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| 4) |v_#length_17|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, ULTIMATE.start_main_~#t1721~0.offset=|v_ULTIMATE.start_main_~#t1721~0.offset_32|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1721~0.base=|v_ULTIMATE.start_main_~#t1721~0.base_51|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1721~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1722~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1722~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1721~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:00:30,703 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1722~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11|) 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11|) |v_ULTIMATE.start_main_~#t1722~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1722~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1722~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1722~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1722~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 19:00:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x~0_In1097866384 ~x$mem_tmp~0_Out1097866384) (= ~x$r_buff1_thd0~0_Out1097866384 ~x$r_buff0_thd0~0_In1097866384) (= ~x$flush_delayed~0_Out1097866384 ~weak$$choice2~0_Out1097866384) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384)) (= |P0Thread1of1ForFork1_#t~nondet4_In1097866384| ~weak$$choice2~0_Out1097866384) (= 1 ~x$r_buff0_thd1~0_Out1097866384) (= ~x$r_buff1_thd2~0_Out1097866384 ~x$r_buff0_thd2~0_In1097866384) (= |P0Thread1of1ForFork1_#t~nondet3_In1097866384| ~weak$$choice0~0_Out1097866384) (= ~x$r_buff1_thd1~0_Out1097866384 ~x$r_buff0_thd1~0_In1097866384)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1097866384|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1097866384|, ~x~0=~x~0_In1097866384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1097866384, ~x$flush_delayed~0=~x$flush_delayed~0_Out1097866384, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1097866384, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1097866384, ~x$mem_tmp~0=~x$mem_tmp~0_Out1097866384, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1097866384, ~weak$$choice0~0=~weak$$choice0~0_Out1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1097866384|, ~weak$$choice2~0=~weak$$choice2~0_Out1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1097866384|, ~x~0=~x~0_In1097866384} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 19:00:30,704 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In607956245 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out607956245| |P0Thread1of1ForFork1_#t~ite5_Out607956245|)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In607956245 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out607956245| ~x$w_buff1~0_In607956245) .cse2) (and (not .cse0) (= ~x$w_buff0~0_In607956245 |P0Thread1of1ForFork1_#t~ite5_Out607956245|) .cse2 (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In607956245, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} OutVars{~x$w_buff0~0=~x$w_buff0~0_In607956245, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out607956245|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out607956245|, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 19:00:30,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 19:00:30,707 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2096518665 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out2096518665| ~x$mem_tmp~0_In2096518665)) (and (= ~x~0_In2096518665 |P0Thread1of1ForFork1_#t~ite25_Out2096518665|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out2096518665|, ~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 19:00:30,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1955837248 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x~0_In-1955837248) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x$mem_tmp~0_In-1955837248)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1955837248|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 19:00:30,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-109423356 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-109423356 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-109423356 |P1Thread1of1ForFork0_#t~ite55_Out-109423356|)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out-109423356| ~x$w_buff1~0_In-109423356) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, ~x~0=~x~0_In-109423356} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-109423356|, ~x~0=~x~0_In-109423356} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 19:00:30,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 19:00:30,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1128322024 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1128322024 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| ~x$w_buff0_used~0_In1128322024)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1128322024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 19:00:30,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1156168985 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1156168985 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1156168985 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1156168985 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite58_Out1156168985| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1156168985 |P1Thread1of1ForFork0_#t~ite58_Out1156168985|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out1156168985|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 19:00:30,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1880879688 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1880879688 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite59_Out-1880879688| ~x$r_buff0_thd2~0_In-1880879688) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1880879688|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1880879688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 19:00:30,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1059938050 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1059938050 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1059938050 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1059938050 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| ~x$r_buff1_thd2~0_In-1059938050)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1059938050|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 19:00:30,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:00:30,714 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1461465425 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1461465425 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1461465425 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out1461465425|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 19:00:30,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-531794613 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-531794613 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-531794613 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-531794613 256)))) (or (and (= ~x$w_buff1_used~0_In-531794613 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-531794613|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 19:00:30,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-571922733 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-571922733 256) 0)) (.cse2 (= ~x$r_buff0_thd1~0_Out-571922733 ~x$r_buff0_thd1~0_In-571922733))) (or (and (= 0 ~x$r_buff0_thd1~0_Out-571922733) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-571922733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-571922733, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-571922733|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 19:00:30,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1400188275 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1400188275 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1400188275 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1400188275 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In-1400188275 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1400188275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 19:00:30,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 19:00:30,715 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:00:30,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-53921203| |ULTIMATE.start_main_#t~ite63_Out-53921203|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-53921203 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-53921203 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2) (and (= ~x~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-53921203|, ~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-53921203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 19:00:30,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1281840366 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1281840366 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out1281840366| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1281840366 |ULTIMATE.start_main_#t~ite65_Out1281840366|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1281840366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 19:00:30,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-69272350 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-69272350 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-69272350 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-69272350 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| ~x$w_buff1_used~0_In-69272350)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-69272350|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 19:00:30,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1256109260 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1256109260 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out-1256109260| ~x$r_buff0_thd0~0_In-1256109260)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out-1256109260|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1256109260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 19:00:30,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1296962822 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1296962822 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1296962822 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1296962822 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out1296962822|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In1296962822 |ULTIMATE.start_main_#t~ite68_Out1296962822|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1296962822|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 19:00:30,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:00:30,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:00:30 BasicIcfg [2019-12-07 19:00:30,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:00:30,775 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:00:30,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:00:30,775 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:00:30,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:00:05" (3/4) ... [2019-12-07 19:00:30,777 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 19:00:30,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1067] [1067] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p0_EBX~0_82 0) (= v_~main$tmp_guard0~0_19 0) (= v_~main$tmp_guard1~0_73 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51| 1)) (= 0 v_~x~0_344) (= 0 v_~x$w_buff0_used~0_997) (= 0 |v_ULTIMATE.start_main_~#t1721~0.offset_32|) (= 0 v_~__unbuffered_p0_EAX~0_106) (= 0 v_~x$w_buff1~0_221) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1721~0.base_51|) (= v_~y~0_54 0) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff0_thd0~0_190 0) (= 0 v_~x$w_buff0~0_234) (= 0 v_~x$mem_tmp~0_169) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$read_delayed~0_7) (= v_~x$r_buff0_thd1~0_599 0) (= 0 v_~__unbuffered_p1_EBX~0_105) (= v_~__unbuffered_p1_EAX~0_106 0) (= v_~x$r_buff1_thd0~0_225 0) (= 0 v_~x$w_buff1_used~0_499) (= |v_#NULL.offset_5| 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1721~0.base_51|) |v_ULTIMATE.start_main_~#t1721~0.offset_32| 0)) |v_#memory_int_17|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff0_thd2~0_403) (= v_~x$r_buff1_thd1~0_379 0) (= v_~x$flush_delayed~0_191 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1721~0.base_51|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1721~0.base_51| 4) |v_#length_17|) (= v_~weak$$choice2~0_254 0) (= 0 v_~__unbuffered_cnt~0_72) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159) (= 0 v_~x$r_buff1_thd2~0_320))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_234, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_599, ~x$flush_delayed~0=v_~x$flush_delayed~0_191, ULTIMATE.start_main_~#t1721~0.offset=|v_ULTIMATE.start_main_~#t1721~0.offset_32|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_147|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_379, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_73, ~x$mem_tmp~0=v_~x$mem_tmp~0_169, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_39|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_43|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_405|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_106, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_106, #length=|v_#length_17|, ~y~0=v_~y~0_54, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_190, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_105, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_82, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_23|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_320, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_225, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_403, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_997, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_31|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1721~0.base=|v_ULTIMATE.start_main_~#t1721~0.base_51|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, ~weak$$choice2~0=v_~weak$$choice2~0_254, ~x~0=v_~x~0_344, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1721~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1722~0.offset, ~x$w_buff1~0, ULTIMATE.start_main_~#t1722~0.base, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet61, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1721~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 19:00:30,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] L818-1-->L820: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1722~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11| 1)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| 4)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1722~0.base_11|) 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1722~0.base_11|) |v_ULTIMATE.start_main_~#t1722~0.offset_10| 1))) (not (= |v_ULTIMATE.start_main_~#t1722~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t1722~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1722~0.offset=|v_ULTIMATE.start_main_~#t1722~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1722~0.base=|v_ULTIMATE.start_main_~#t1722~0.base_11|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1722~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1722~0.base, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 19:00:30,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L5-->L744: Formula: (and (= ~x~0_In1097866384 ~x$mem_tmp~0_Out1097866384) (= ~x$r_buff1_thd0~0_Out1097866384 ~x$r_buff0_thd0~0_In1097866384) (= ~x$flush_delayed~0_Out1097866384 ~weak$$choice2~0_Out1097866384) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384)) (= |P0Thread1of1ForFork1_#t~nondet4_In1097866384| ~weak$$choice2~0_Out1097866384) (= 1 ~x$r_buff0_thd1~0_Out1097866384) (= ~x$r_buff1_thd2~0_Out1097866384 ~x$r_buff0_thd2~0_In1097866384) (= |P0Thread1of1ForFork1_#t~nondet3_In1097866384| ~weak$$choice0~0_Out1097866384) (= ~x$r_buff1_thd1~0_Out1097866384 ~x$r_buff0_thd1~0_In1097866384)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1097866384|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1097866384|, ~x~0=~x~0_In1097866384} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1097866384, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1097866384, ~x$flush_delayed~0=~x$flush_delayed~0_Out1097866384, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out1097866384, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out1097866384, ~x$mem_tmp~0=~x$mem_tmp~0_Out1097866384, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1097866384, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out1097866384, ~weak$$choice0~0=~weak$$choice0~0_Out1097866384, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1097866384, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1097866384|, ~weak$$choice2~0=~weak$$choice2~0_Out1097866384, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1097866384|, ~x~0=~x~0_In1097866384} AuxVars[] AssignedVars[~weak$$choice0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~nondet3, ~x$mem_tmp~0, ~x$r_buff1_thd0~0, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4] because there is no mapped edge [2019-12-07 19:00:30,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L744-2-->L744-5: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In607956245 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out607956245| |P0Thread1of1ForFork1_#t~ite5_Out607956245|)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In607956245 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out607956245| ~x$w_buff1~0_In607956245) .cse2) (and (not .cse0) (= ~x$w_buff0~0_In607956245 |P0Thread1of1ForFork1_#t~ite5_Out607956245|) .cse2 (not .cse1)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In607956245, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} OutVars{~x$w_buff0~0=~x$w_buff0~0_In607956245, P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out607956245|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In607956245, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out607956245|, ~x$w_buff1~0=~x$w_buff1~0_In607956245, ~x$w_buff0_used~0=~x$w_buff0_used~0_In607956245} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 19:00:30,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_55 256) 0)) (= v_~x$r_buff0_thd1~0_87 v_~x$r_buff0_thd1~0_86)) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_55} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_86, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_6|, ~weak$$choice2~0=v_~weak$$choice2~0_55} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 19:00:30,781 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In2096518665 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out2096518665| ~x$mem_tmp~0_In2096518665)) (and (= ~x~0_In2096518665 |P0Thread1of1ForFork1_#t~ite25_Out2096518665|) .cse0))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} OutVars{P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out2096518665|, ~x$flush_delayed~0=~x$flush_delayed~0_In2096518665, ~x$mem_tmp~0=~x$mem_tmp~0_In2096518665, ~x~0=~x~0_In2096518665} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 19:00:30,786 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$flush_delayed~0_In-1955837248 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x~0_In-1955837248) .cse0) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite54_Out-1955837248| ~x$mem_tmp~0_In-1955837248)))) InVars {~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} OutVars{P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-1955837248|, ~x$flush_delayed~0=~x$flush_delayed~0_In-1955837248, ~x$mem_tmp~0=~x$mem_tmp~0_In-1955837248, ~x~0=~x~0_In-1955837248} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 19:00:30,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-109423356 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-109423356 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In-109423356 |P1Thread1of1ForFork0_#t~ite55_Out-109423356|)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite55_Out-109423356| ~x$w_buff1~0_In-109423356) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, ~x~0=~x~0_In-109423356} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-109423356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-109423356, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-109423356, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out-109423356|, ~x~0=~x~0_In-109423356} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-07 19:00:30,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~x~0_77 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_11|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~x~0=v_~x~0_77} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~x~0] because there is no mapped edge [2019-12-07 19:00:30,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1128322024 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1128322024 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| ~x$w_buff0_used~0_In1128322024)) (and (not .cse0) (= |P1Thread1of1ForFork0_#t~ite57_Out1128322024| 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} OutVars{P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out1128322024|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1128322024, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1128322024} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-07 19:00:30,787 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In1156168985 256))) (.cse3 (= (mod ~x$r_buff0_thd2~0_In1156168985 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1156168985 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In1156168985 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite58_Out1156168985| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$w_buff1_used~0_In1156168985 |P1Thread1of1ForFork0_#t~ite58_Out1156168985|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} OutVars{P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out1156168985|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1156168985, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1156168985, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1156168985, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1156168985} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-07 19:00:30,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L798-->L798-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1880879688 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1880879688 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite59_Out-1880879688| ~x$r_buff0_thd2~0_In-1880879688) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite59_Out-1880879688|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1880879688, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out-1880879688|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1880879688} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-07 19:00:30,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1059938050 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1059938050 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1059938050 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-1059938050 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| ~x$r_buff1_thd2~0_In-1059938050)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite60_Out-1059938050| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} OutVars{P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-1059938050|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1059938050, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1059938050, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1059938050, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1059938050} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-07 19:00:30,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1042] [1042] L799-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~x$r_buff1_thd2~0_192 |v_P1Thread1of1ForFork0_#t~ite60_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_192, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 19:00:30,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1461465425 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1461465425 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1461465425 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)) (and (not .cse1) (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite28_Out1461465425|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1461465425, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out1461465425|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1461465425} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 19:00:30,788 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-531794613 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-531794613 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-531794613 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-531794613 256)))) (or (and (= ~x$w_buff1_used~0_In-531794613 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-531794613|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-531794613, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-531794613|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-531794613, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-531794613, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-531794613} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-07 19:00:30,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L762-->L763: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-571922733 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-571922733 256) 0)) (.cse2 (= ~x$r_buff0_thd1~0_Out-571922733 ~x$r_buff0_thd1~0_In-571922733))) (or (and (= 0 ~x$r_buff0_thd1~0_Out-571922733) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-571922733, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-571922733, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out-571922733|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-571922733} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 19:00:30,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L763-->L763-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd1~0_In-1400188275 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-1400188275 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In-1400188275 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1400188275 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd1~0_In-1400188275 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork1_#t~ite31_Out-1400188275|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1400188275, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1400188275, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1400188275, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1400188275|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1400188275} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 19:00:30,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= v_~x$r_buff1_thd1~0_198 |v_P0Thread1of1ForFork1_#t~ite31_34|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_34|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_198, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_33|} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-07 19:00:30,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 2 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 19:00:30,789 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite64_Out-53921203| |ULTIMATE.start_main_#t~ite63_Out-53921203|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-53921203 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-53921203 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2) (and (= ~x~0_In-53921203 |ULTIMATE.start_main_#t~ite63_Out-53921203|) .cse2 (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-53921203|, ~x$w_buff1~0=~x$w_buff1~0_In-53921203, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-53921203, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-53921203, ~x~0=~x~0_In-53921203, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-53921203|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 19:00:30,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1281840366 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1281840366 256)))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out1281840366| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1281840366 |ULTIMATE.start_main_#t~ite65_Out1281840366|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1281840366, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out1281840366|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1281840366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 19:00:30,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L828-->L828-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-69272350 256))) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-69272350 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-69272350 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-69272350 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| ~x$w_buff1_used~0_In-69272350)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite66_Out-69272350| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-69272350, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-69272350, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-69272350|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-69272350, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-69272350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 19:00:30,790 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1256109260 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1256109260 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite67_Out-1256109260| ~x$r_buff0_thd0~0_In-1256109260)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out-1256109260|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1256109260, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1256109260|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1256109260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 19:00:30,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1012] [1012] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1296962822 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1296962822 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1296962822 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1296962822 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out1296962822|)) (and (or .cse1 .cse0) (= ~x$r_buff1_thd0~0_In1296962822 |ULTIMATE.start_main_#t~ite68_Out1296962822|) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1296962822, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1296962822, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1296962822|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1296962822, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1296962822} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 19:00:30,791 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_40 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_40 (ite (= (ite (not (and (= 1 v_~__unbuffered_p0_EAX~0_62) (= 1 v_~__unbuffered_p1_EAX~0_73) (= v_~__unbuffered_p0_EBX~0_47 0) (= v_~__unbuffered_p1_EBX~0_62 0))) 1 0) 0) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~x$r_buff1_thd0~0_188 |v_ULTIMATE.start_main_#t~ite68_83|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_83|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_62, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_73, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_82|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_188, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 19:00:30,848 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_55817b24-37fb-47aa-b9da-a19dc5fbfc7f/bin/uautomizer/witness.graphml [2019-12-07 19:00:30,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:00:30,849 INFO L168 Benchmark]: Toolchain (without parser) took 26006.72 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 938.8 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 775.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:30,849 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:00:30,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:30,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:00:30,850 INFO L168 Benchmark]: Boogie Preprocessor took 28.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:30,850 INFO L168 Benchmark]: RCFGBuilder took 464.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:30,851 INFO L168 Benchmark]: TraceAbstraction took 25003.35 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 719.5 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:30,851 INFO L168 Benchmark]: Witness Printer took 73.58 ms. Allocated memory is still 3.3 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:00:30,852 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 938.8 MB in the beginning and 1.1 GB in the end (delta: -131.5 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 464.18 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 60.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25003.35 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 719.5 MB. Max. memory is 11.5 GB. * Witness Printer took 73.58 ms. Allocated memory is still 3.3 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 113 ProgramPointsAfterwards, 246 TransitionsBefore, 136 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 9685 VarBasedMoverChecksPositive, 320 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 419 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 146813 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$w_buff1 = x$w_buff0 [L730] 1 x$w_buff0 = 1 [L731] 1 x$w_buff1_used = x$w_buff0_used [L732] 1 x$w_buff0_used = (_Bool)1 [L744] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L745] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L746] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L746] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L747] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L748] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 1 x = x$flush_delayed ? x$mem_tmp : x [L753] 1 x$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 [L776] 2 __unbuffered_p1_EAX = y [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 x$flush_delayed = weak$$choice2 [L782] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L784] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L784] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L785] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L785] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L786] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L786] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L787] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L788] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L789] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L791] 2 x = x$flush_delayed ? x$mem_tmp : x [L792] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L761] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 24.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4505 SDtfs, 4111 SDslu, 9146 SDs, 0 SdLazy, 3324 SolverSat, 169 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74579occurred 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: 12.3s AutomataMinimizationTime, 20 MinimizatonAttempts, 42159 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 739 NumberOfCodeBlocks, 739 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 144782 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...