./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/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 d8d2fbb7e8f32489f0aa9220db00cd28db1defb7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 12:21:31,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:21:31,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:21:31,281 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:21:31,281 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:21:31,282 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:21:31,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:21:31,284 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:21:31,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:21:31,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:21:31,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:21:31,287 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:21:31,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:21:31,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:21:31,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:21:31,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:21:31,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:21:31,291 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:21:31,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:21:31,294 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:21:31,295 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:21:31,295 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:21:31,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:21:31,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:21:31,298 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:21:31,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:21:31,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:21:31,299 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:21:31,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:21:31,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:21:31,300 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:21:31,301 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:21:31,301 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:21:31,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:21:31,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:21:31,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:21:31,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:21:31,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:21:31,303 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:21:31,303 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:21:31,304 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:21:31,304 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 12:21:31,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:21:31,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:21:31,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 12:21:31,315 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 12:21:31,315 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 12:21:31,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:21:31,315 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:21:31,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:21:31,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:21:31,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:21:31,316 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:21:31,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:21:31,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:21:31,316 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:21:31,316 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:21:31,316 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:21:31,316 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:21:31,317 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:21:31,317 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 12:21:31,317 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:21:31,317 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:21:31,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:21:31,317 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:21:31,317 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:21:31,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:21:31,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 12:21:31,318 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:21:31,318 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:21:31,318 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:21:31,318 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_72969f5f-bd97-490d-9801-39e312f4e784/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 -> d8d2fbb7e8f32489f0aa9220db00cd28db1defb7 [2019-12-07 12:21:31,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:21:31,427 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:21:31,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:21:31,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:21:31,431 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:21:31,432 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/podwr000_pso.opt.i [2019-12-07 12:21:31,472 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/data/87dd0ab1a/b1f2b608eefc45069837c2eef3110f95/FLAG7fe1c25fa [2019-12-07 12:21:31,946 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:21:31,946 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/sv-benchmarks/c/pthread-wmm/podwr000_pso.opt.i [2019-12-07 12:21:31,959 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/data/87dd0ab1a/b1f2b608eefc45069837c2eef3110f95/FLAG7fe1c25fa [2019-12-07 12:21:31,971 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/data/87dd0ab1a/b1f2b608eefc45069837c2eef3110f95 [2019-12-07 12:21:31,973 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:21:31,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:21:31,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:21:31,975 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:21:31,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:21:31,977 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:21:31" (1/1) ... [2019-12-07 12:21:31,979 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 12:21:31, skipping insertion in model container [2019-12-07 12:21:31,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:21:31" (1/1) ... [2019-12-07 12:21:31,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:21:32,016 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:21:32,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:21:32,267 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:21:32,307 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:21:32,351 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:21:32,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32 WrapperNode [2019-12-07 12:21:32,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:21:32,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:21:32,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:21:32,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:21:32,358 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,389 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:21:32,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:21:32,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:21:32,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:21:32,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,399 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,399 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... [2019-12-07 12:21:32,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:21:32,414 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:21:32,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:21:32,414 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:21:32,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:21:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:21:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:21:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:21:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:21:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:21:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:21:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:21:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:21:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:21:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:21:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:21:32,461 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 12:21:32,801 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:21:32,801 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:21:32,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:32 BoogieIcfgContainer [2019-12-07 12:21:32,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:21:32,803 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:21:32,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:21:32,805 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:21:32,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:21:31" (1/3) ... [2019-12-07 12:21:32,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cef8a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:21:32, skipping insertion in model container [2019-12-07 12:21:32,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:21:32" (2/3) ... [2019-12-07 12:21:32,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cef8a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:21:32, skipping insertion in model container [2019-12-07 12:21:32,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:32" (3/3) ... [2019-12-07 12:21:32,807 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr000_pso.opt.i [2019-12-07 12:21:32,813 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:21:32,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:21:32,817 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:21:32,818 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:21:32,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,841 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,845 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,848 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,849 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,850 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,851 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,856 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,857 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:21:32,867 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 12:21:32,880 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:21:32,880 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:21:32,880 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:21:32,880 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:21:32,880 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:21:32,880 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:21:32,880 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:21:32,880 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:21:32,890 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 12:21:32,891 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 12:21:32,937 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 12:21:32,937 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:21:32,946 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:21:32,958 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 12:21:32,981 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 12:21:32,981 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:21:32,985 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 569 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 12:21:32,995 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 12:21:32,996 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:21:35,544 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 12:21:35,655 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-07 12:21:35,655 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-07 12:21:35,657 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-07 12:21:35,964 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-07 12:21:35,966 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-07 12:21:35,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 12:21:35,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:35,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 12:21:35,970 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:35,974 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-07 12:21:35,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:35,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317263874] [2019-12-07 12:21:35,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:36,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317263874] [2019-12-07 12:21:36,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:36,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:21:36,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910030968] [2019-12-07 12:21:36,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:21:36,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:36,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:21:36,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:21:36,128 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-07 12:21:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:36,316 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-07 12:21:36,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:21:36,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 12:21:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:36,379 INFO L225 Difference]: With dead ends: 8074 [2019-12-07 12:21:36,380 INFO L226 Difference]: Without dead ends: 7606 [2019-12-07 12:21:36,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:21:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-07 12:21:36,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-07 12:21:36,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-07 12:21:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-07 12:21:36,658 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-07 12:21:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:36,659 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-07 12:21:36,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:21:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-07 12:21:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 12:21:36,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:36,662 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:36,662 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-07 12:21:36,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:36,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646618909] [2019-12-07 12:21:36,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:36,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:36,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646618909] [2019-12-07 12:21:36,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:36,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:21:36,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085373836] [2019-12-07 12:21:36,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:21:36,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:36,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:21:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:21:36,756 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-07 12:21:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:36,976 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-07 12:21:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:21:36,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 12:21:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:37,026 INFO L225 Difference]: With dead ends: 11630 [2019-12-07 12:21:37,026 INFO L226 Difference]: Without dead ends: 11623 [2019-12-07 12:21:37,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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 12:21:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-07 12:21:37,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-07 12:21:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-07 12:21:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-07 12:21:37,308 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-07 12:21:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:37,309 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-07 12:21:37,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:21:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-07 12:21:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 12:21:37,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:37,312 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:37,313 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-07 12:21:37,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:37,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858483312] [2019-12-07 12:21:37,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:37,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858483312] [2019-12-07 12:21:37,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:37,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:21:37,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292090260] [2019-12-07 12:21:37,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:21:37,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:37,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:21:37,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:21:37,373 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-07 12:21:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:37,608 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-07 12:21:37,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:21:37,609 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 12:21:37,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:37,645 INFO L225 Difference]: With dead ends: 14471 [2019-12-07 12:21:37,645 INFO L226 Difference]: Without dead ends: 14471 [2019-12-07 12:21:37,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:21:37,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-07 12:21:37,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-07 12:21:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-07 12:21:37,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-07 12:21:37,889 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-07 12:21:37,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:37,889 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-07 12:21:37,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:21:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-07 12:21:37,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:21:37,892 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:37,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:37,892 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:37,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-07 12:21:37,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:37,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677649927] [2019-12-07 12:21:37,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:37,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:37,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677649927] [2019-12-07 12:21:37,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:37,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:21:37,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009403073] [2019-12-07 12:21:37,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:21:37,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:21:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:21:37,943 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-07 12:21:37,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:37,978 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-07 12:21:37,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:21:37,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 12:21:37,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:37,995 INFO L225 Difference]: With dead ends: 10750 [2019-12-07 12:21:37,995 INFO L226 Difference]: Without dead ends: 10750 [2019-12-07 12:21:37,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:21:38,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-07 12:21:38,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-07 12:21:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-07 12:21:38,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-07 12:21:38,190 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-07 12:21:38,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:38,190 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-07 12:21:38,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:21:38,190 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-07 12:21:38,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:21:38,192 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:38,192 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:38,192 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:38,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:38,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-07 12:21:38,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:38,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685908629] [2019-12-07 12:21:38,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:38,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:38,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685908629] [2019-12-07 12:21:38,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:38,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:21:38,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131376019] [2019-12-07 12:21:38,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:21:38,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:38,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:21:38,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:21:38,232 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-07 12:21:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:38,253 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-07 12:21:38,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:21:38,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 12:21:38,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:38,256 INFO L225 Difference]: With dead ends: 2054 [2019-12-07 12:21:38,256 INFO L226 Difference]: Without dead ends: 1457 [2019-12-07 12:21:38,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:21:38,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-07 12:21:38,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-07 12:21:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-07 12:21:38,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-07 12:21:38,277 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-07 12:21:38,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:38,277 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-07 12:21:38,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:21:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-07 12:21:38,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:21:38,280 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:38,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:38,280 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:38,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-07 12:21:38,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:38,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021879698] [2019-12-07 12:21:38,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:38,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021879698] [2019-12-07 12:21:38,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:38,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:21:38,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332659242] [2019-12-07 12:21:38,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:21:38,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:38,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:21:38,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:21:38,359 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-07 12:21:38,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:38,593 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-07 12:21:38,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:21:38,593 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 12:21:38,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:38,595 INFO L225 Difference]: With dead ends: 2249 [2019-12-07 12:21:38,595 INFO L226 Difference]: Without dead ends: 2197 [2019-12-07 12:21:38,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:21:38,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-07 12:21:38,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-07 12:21:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-07 12:21:38,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-07 12:21:38,611 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-07 12:21:38,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:38,611 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-07 12:21:38,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:21:38,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-07 12:21:38,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 12:21:38,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:38,613 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 12:21:38,613 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:38,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-07 12:21:38,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:38,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279115158] [2019-12-07 12:21:38,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:38,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:38,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279115158] [2019-12-07 12:21:38,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:38,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:21:38,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868005315] [2019-12-07 12:21:38,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:21:38,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:38,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:21:38,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:21:38,674 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 5 states. [2019-12-07 12:21:38,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:38,700 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-07 12:21:38,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:21:38,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 12:21:38,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:38,701 INFO L225 Difference]: With dead ends: 752 [2019-12-07 12:21:38,701 INFO L226 Difference]: Without dead ends: 689 [2019-12-07 12:21:38,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:21:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-07 12:21:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-07 12:21:38,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-07 12:21:38,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-07 12:21:38,707 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-07 12:21:38,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:38,708 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-07 12:21:38,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:21:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-07 12:21:38,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:21:38,710 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:38,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:38,710 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:38,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:38,710 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-07 12:21:38,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:38,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79909463] [2019-12-07 12:21:38,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:38,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79909463] [2019-12-07 12:21:38,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:38,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:21:38,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488960036] [2019-12-07 12:21:38,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:21:38,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:21:38,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:21:38,790 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 5 states. [2019-12-07 12:21:39,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:39,001 INFO L93 Difference]: Finished difference Result 1105 states and 2341 transitions. [2019-12-07 12:21:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:21:39,001 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 12:21:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:39,002 INFO L225 Difference]: With dead ends: 1105 [2019-12-07 12:21:39,002 INFO L226 Difference]: Without dead ends: 1105 [2019-12-07 12:21:39,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:21:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1105 states. [2019-12-07 12:21:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1105 to 896. [2019-12-07 12:21:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 896 states. [2019-12-07 12:21:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 1944 transitions. [2019-12-07 12:21:39,012 INFO L78 Accepts]: Start accepts. Automaton has 896 states and 1944 transitions. Word has length 51 [2019-12-07 12:21:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:39,012 INFO L462 AbstractCegarLoop]: Abstraction has 896 states and 1944 transitions. [2019-12-07 12:21:39,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:21:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 896 states and 1944 transitions. [2019-12-07 12:21:39,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 12:21:39,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:39,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:39,014 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:39,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1015680243, now seen corresponding path program 2 times [2019-12-07 12:21:39,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:39,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509957151] [2019-12-07 12:21:39,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:39,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:39,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509957151] [2019-12-07 12:21:39,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:39,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:21:39,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54348285] [2019-12-07 12:21:39,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:21:39,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:39,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:21:39,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:21:39,059 INFO L87 Difference]: Start difference. First operand 896 states and 1944 transitions. Second operand 3 states. [2019-12-07 12:21:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:39,098 INFO L93 Difference]: Finished difference Result 1184 states and 2559 transitions. [2019-12-07 12:21:39,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:21:39,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 12:21:39,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:39,099 INFO L225 Difference]: With dead ends: 1184 [2019-12-07 12:21:39,099 INFO L226 Difference]: Without dead ends: 1184 [2019-12-07 12:21:39,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:21:39,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-07 12:21:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 956. [2019-12-07 12:21:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-12-07 12:21:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 2092 transitions. [2019-12-07 12:21:39,109 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 2092 transitions. Word has length 51 [2019-12-07 12:21:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:39,109 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 2092 transitions. [2019-12-07 12:21:39,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:21:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 2092 transitions. [2019-12-07 12:21:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:21:39,111 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:39,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:39,111 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:39,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1042109596, now seen corresponding path program 1 times [2019-12-07 12:21:39,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:39,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363825606] [2019-12-07 12:21:39,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:39,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363825606] [2019-12-07 12:21:39,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:39,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:21:39,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517332610] [2019-12-07 12:21:39,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:21:39,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:21:39,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:21:39,172 INFO L87 Difference]: Start difference. First operand 956 states and 2092 transitions. Second operand 5 states. [2019-12-07 12:21:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:39,187 INFO L93 Difference]: Finished difference Result 1646 states and 3628 transitions. [2019-12-07 12:21:39,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:21:39,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 12:21:39,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:39,188 INFO L225 Difference]: With dead ends: 1646 [2019-12-07 12:21:39,188 INFO L226 Difference]: Without dead ends: 759 [2019-12-07 12:21:39,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:21:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-07 12:21:39,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-12-07 12:21:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-07 12:21:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1666 transitions. [2019-12-07 12:21:39,195 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1666 transitions. Word has length 52 [2019-12-07 12:21:39,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:39,195 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1666 transitions. [2019-12-07 12:21:39,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:21:39,195 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1666 transitions. [2019-12-07 12:21:39,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:21:39,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:39,197 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:39,197 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:39,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:39,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2120720198, now seen corresponding path program 2 times [2019-12-07 12:21:39,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:39,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764615793] [2019-12-07 12:21:39,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:39,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764615793] [2019-12-07 12:21:39,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:39,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 12:21:39,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813212642] [2019-12-07 12:21:39,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 12:21:39,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 12:21:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:21:39,450 INFO L87 Difference]: Start difference. First operand 759 states and 1666 transitions. Second operand 13 states. [2019-12-07 12:21:40,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:40,281 INFO L93 Difference]: Finished difference Result 1086 states and 2309 transitions. [2019-12-07 12:21:40,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 12:21:40,281 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2019-12-07 12:21:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:40,282 INFO L225 Difference]: With dead ends: 1086 [2019-12-07 12:21:40,282 INFO L226 Difference]: Without dead ends: 865 [2019-12-07 12:21:40,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-07 12:21:40,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2019-12-07 12:21:40,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 790. [2019-12-07 12:21:40,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-12-07 12:21:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1740 transitions. [2019-12-07 12:21:40,289 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1740 transitions. Word has length 52 [2019-12-07 12:21:40,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:40,289 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1740 transitions. [2019-12-07 12:21:40,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 12:21:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1740 transitions. [2019-12-07 12:21:40,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:21:40,291 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:40,291 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:40,291 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash 925896582, now seen corresponding path program 3 times [2019-12-07 12:21:40,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:40,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403466305] [2019-12-07 12:21:40,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:40,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:40,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:40,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403466305] [2019-12-07 12:21:40,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 12:21:40,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86719784] [2019-12-07 12:21:40,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 12:21:40,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 12:21:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 12:21:40,479 INFO L87 Difference]: Start difference. First operand 790 states and 1740 transitions. Second operand 12 states. [2019-12-07 12:21:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:41,219 INFO L93 Difference]: Finished difference Result 1116 states and 2400 transitions. [2019-12-07 12:21:41,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 12:21:41,219 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2019-12-07 12:21:41,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:41,220 INFO L225 Difference]: With dead ends: 1116 [2019-12-07 12:21:41,220 INFO L226 Difference]: Without dead ends: 777 [2019-12-07 12:21:41,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-12-07 12:21:41,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2019-12-07 12:21:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 768. [2019-12-07 12:21:41,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-07 12:21:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1674 transitions. [2019-12-07 12:21:41,226 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1674 transitions. Word has length 52 [2019-12-07 12:21:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:41,227 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1674 transitions. [2019-12-07 12:21:41,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 12:21:41,227 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1674 transitions. [2019-12-07 12:21:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:21:41,228 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:41,228 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:41,228 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:41,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:41,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1604907066, now seen corresponding path program 4 times [2019-12-07 12:21:41,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:41,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11664217] [2019-12-07 12:21:41,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:21:41,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:21:41,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11664217] [2019-12-07 12:21:41,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:21:41,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 12:21:41,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345819474] [2019-12-07 12:21:41,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:21:41,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:21:41,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:21:41,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:21:41,278 INFO L87 Difference]: Start difference. First operand 768 states and 1674 transitions. Second operand 7 states. [2019-12-07 12:21:41,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:21:41,380 INFO L93 Difference]: Finished difference Result 1250 states and 2650 transitions. [2019-12-07 12:21:41,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:21:41,380 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 12:21:41,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:21:41,381 INFO L225 Difference]: With dead ends: 1250 [2019-12-07 12:21:41,381 INFO L226 Difference]: Without dead ends: 919 [2019-12-07 12:21:41,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:21:41,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2019-12-07 12:21:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 754. [2019-12-07 12:21:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-07 12:21:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-07 12:21:41,388 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 52 [2019-12-07 12:21:41,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:21:41,388 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-07 12:21:41,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:21:41,388 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-07 12:21:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 12:21:41,389 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:21:41,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:21:41,389 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:21:41,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:21:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 5 times [2019-12-07 12:21:41,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:21:41,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348257325] [2019-12-07 12:21:41,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:21:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:21:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:21:41,457 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:21:41,457 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:21:41,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1551~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1551~0.base_40|) |v_ULTIMATE.start_main_~#t1551~0.offset_27| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1551~0.base_40|) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1551~0.base_40| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1551~0.base_40|) 0) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1551~0.base_40| 1)) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= 0 |v_ULTIMATE.start_main_~#t1551~0.offset_27|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1551~0.base=|v_ULTIMATE.start_main_~#t1551~0.base_40|, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1552~0.offset=|v_ULTIMATE.start_main_~#t1552~0.offset_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ULTIMATE.start_main_~#t1551~0.offset=|v_ULTIMATE.start_main_~#t1551~0.offset_27|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ULTIMATE.start_main_~#t1552~0.base=|v_ULTIMATE.start_main_~#t1552~0.base_41|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1551~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1552~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1551~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t1552~0.base, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:21:41,460 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1552~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1552~0.base_13|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1552~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1552~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1552~0.base_13|) |v_ULTIMATE.start_main_~#t1552~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1552~0.base_13| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t1552~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t1552~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1552~0.offset=|v_ULTIMATE.start_main_~#t1552~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1552~0.base=|v_ULTIMATE.start_main_~#t1552~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1552~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1552~0.base] because there is no mapped edge [2019-12-07 12:21:41,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_Out135584871 1) (= ~y$r_buff0_thd1~0_In135584871 ~y$r_buff1_thd1~0_Out135584871) (= ~y$r_buff0_thd2~0_In135584871 ~y$r_buff1_thd2~0_Out135584871) (= ~x~0_In135584871 ~__unbuffered_p0_EAX~0_Out135584871) (= ~y$r_buff1_thd0~0_Out135584871 ~y$r_buff0_thd0~0_In135584871) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In135584871 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In135584871, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In135584871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135584871, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In135584871, ~x~0=~x~0_In135584871} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out135584871, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out135584871, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out135584871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In135584871, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out135584871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135584871, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In135584871, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out135584871, ~x~0=~x~0_In135584871} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:21:41,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In252406004 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In252406004 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out252406004| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out252406004| ~y$w_buff0_used~0_In252406004) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In252406004, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In252406004} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out252406004|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In252406004, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In252406004} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:21:41,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In845054676 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out845054676| ~y$w_buff0_used~0_In845054676) (= |P1Thread1of1ForFork1_#t~ite21_Out845054676| |P1Thread1of1ForFork1_#t~ite20_Out845054676|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In845054676 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In845054676 256)) .cse1) (= (mod ~y$w_buff0_used~0_In845054676 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In845054676 256)) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out845054676| ~y$w_buff0_used~0_In845054676) (= |P1Thread1of1ForFork1_#t~ite20_In845054676| |P1Thread1of1ForFork1_#t~ite20_Out845054676|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In845054676|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845054676, ~weak$$choice2~0=~weak$$choice2~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out845054676|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845054676, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out845054676|, ~weak$$choice2~0=~weak$$choice2~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:21:41,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In-2120394537 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2120394537 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-2120394537 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2120394537 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-2120394537| |P1Thread1of1ForFork1_#t~ite23_Out-2120394537|)) (.cse2 (= 0 (mod ~weak$$choice2~0_In-2120394537 256)))) (or (let ((.cse4 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-2120394537| 0) (not .cse0) .cse1 .cse2 (= |P1Thread1of1ForFork1_#t~ite23_Out-2120394537| |P1Thread1of1ForFork1_#t~ite22_Out-2120394537|) (or (not .cse3) .cse4) (or (not .cse5) .cse4))) (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-2120394537| ~y$w_buff1_used~0_In-2120394537) (= |P1Thread1of1ForFork1_#t~ite23_Out-2120394537| |P1Thread1of1ForFork1_#t~ite23_In-2120394537|) (not .cse2)) (and (or (and .cse6 .cse5) .cse0 (and .cse6 .cse3)) .cse1 .cse2 (= |P1Thread1of1ForFork1_#t~ite23_Out-2120394537| ~y$w_buff1_used~0_In-2120394537))) (= |P1Thread1of1ForFork1_#t~ite22_In-2120394537| |P1Thread1of1ForFork1_#t~ite22_Out-2120394537|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120394537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120394537, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2120394537|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2120394537|, ~weak$$choice2~0=~weak$$choice2~0_In-2120394537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120394537} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120394537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120394537, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2120394537|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2120394537|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2120394537|, ~weak$$choice2~0=~weak$$choice2~0_In-2120394537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120394537} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 12:21:41,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In521048916 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In521048916 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In521048916 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In521048916 256)))) (or (and (= ~y$w_buff1_used~0_In521048916 |P0Thread1of1ForFork0_#t~ite6_Out521048916|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out521048916|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In521048916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In521048916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In521048916} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out521048916|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In521048916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In521048916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In521048916} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:21:41,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In1136776121 ~y$r_buff0_thd1~0_Out1136776121)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1136776121 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1136776121 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out1136776121)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1136776121} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1136776121|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1136776121} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:21:41,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In230540460 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In230540460 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In230540460 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In230540460 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In230540460 |P0Thread1of1ForFork0_#t~ite8_Out230540460|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out230540460|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In230540460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In230540460, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230540460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In230540460} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In230540460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In230540460, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out230540460|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230540460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In230540460} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:21:41,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:21:41,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In135271969 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In135271969 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In135271969 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In135271969 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In135271969 256)))) .cse1 (= ~y$r_buff1_thd2~0_In135271969 |P1Thread1of1ForFork1_#t~ite29_Out135271969|) (= |P1Thread1of1ForFork1_#t~ite30_Out135271969| |P1Thread1of1ForFork1_#t~ite29_Out135271969|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In135271969| |P1Thread1of1ForFork1_#t~ite29_Out135271969|) (= |P1Thread1of1ForFork1_#t~ite30_Out135271969| ~y$r_buff1_thd2~0_In135271969) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In135271969, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In135271969|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In135271969, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135271969, ~weak$$choice2~0=~weak$$choice2~0_In135271969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In135271969} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In135271969, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out135271969|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out135271969|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In135271969, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135271969, ~weak$$choice2~0=~weak$$choice2~0_In135271969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In135271969} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:21:41,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:21:41,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1553668176 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1553668176 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1553668176| ~y$w_buff1~0_In1553668176)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1553668176| ~y~0_In1553668176)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff1~0=~y$w_buff1~0_In1553668176, ~y~0=~y~0_In1553668176, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff1~0=~y$w_buff1~0_In1553668176, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1553668176|, ~y~0=~y~0_In1553668176, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:21:41,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 12:21:41,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In544671081 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In544671081 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out544671081| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out544671081| ~y$w_buff0_used~0_In544671081) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In544671081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In544671081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In544671081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In544671081, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out544671081|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:21:41,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1416616963 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1416616963 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1416616963 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1416616963 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1416616963| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out-1416616963| ~y$w_buff1_used~0_In-1416616963)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1416616963, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416616963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1416616963, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416616963} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1416616963, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416616963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1416616963, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1416616963|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416616963} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:21:41,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1202497918 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1202497918 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1202497918|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1202497918| ~y$r_buff0_thd2~0_In-1202497918) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1202497918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1202497918} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1202497918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1202497918, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1202497918|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:21:41,466 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In800285029 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In800285029 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In800285029 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In800285029 256)))) (or (and (= ~y$r_buff1_thd2~0_In800285029 |P1Thread1of1ForFork1_#t~ite37_Out800285029|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out800285029| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out800285029|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:21:41,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:21:41,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:21:41,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:21:41,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-179819414 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-179819414 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-179819414| ~y~0_In-179819414) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-179819414| ~y$w_buff1~0_In-179819414) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-179819414, ~y~0=~y~0_In-179819414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-179819414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-179819414} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-179819414|, ~y$w_buff1~0=~y$w_buff1~0_In-179819414, ~y~0=~y~0_In-179819414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-179819414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-179819414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:21:41,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 12:21:41,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In745546079 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In745546079 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out745546079| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out745546079| ~y$w_buff0_used~0_In745546079)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out745546079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:21:41,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1117729706 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1117729706 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1117729706 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1117729706 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1117729706| ~y$w_buff1_used~0_In-1117729706) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1117729706| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117729706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117729706, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117729706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117729706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117729706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117729706, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1117729706|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117729706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117729706} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:21:41,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1226500845 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1226500845 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1226500845 |ULTIMATE.start_main_#t~ite44_Out1226500845|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1226500845|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1226500845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1226500845} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1226500845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1226500845, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1226500845|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:21:41,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1431504905 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1431504905 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1431504905 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1431504905 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1431504905| ~y$r_buff1_thd0~0_In1431504905) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1431504905|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1431504905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1431504905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1431504905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1431504905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1431504905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1431504905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1431504905, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1431504905|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1431504905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:21:41,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:21:41,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:21:41 BasicIcfg [2019-12-07 12:21:41,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:21:41,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:21:41,505 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:21:41,505 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:21:41,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:21:32" (3/4) ... [2019-12-07 12:21:41,507 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:21:41,507 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1551~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1551~0.base_40|) |v_ULTIMATE.start_main_~#t1551~0.offset_27| 0)) |v_#memory_int_17|) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1551~0.base_40|) (= v_~y$read_delayed~0_6 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1551~0.base_40| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1551~0.base_40|) 0) (= 0 v_~y$r_buff1_thd2~0_235) (= |v_#valid_65| (store .cse0 |v_ULTIMATE.start_main_~#t1551~0.base_40| 1)) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= 0 |v_ULTIMATE.start_main_~#t1551~0.offset_27|) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ULTIMATE.start_main_~#t1551~0.base=|v_ULTIMATE.start_main_~#t1551~0.base_40|, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1552~0.offset=|v_ULTIMATE.start_main_~#t1552~0.offset_27|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ULTIMATE.start_main_~#t1551~0.offset=|v_ULTIMATE.start_main_~#t1551~0.offset_27|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ULTIMATE.start_main_~#t1552~0.base=|v_ULTIMATE.start_main_~#t1552~0.base_41|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1551~0.base, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1552~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_~#t1551~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ULTIMATE.start_main_~#t1552~0.base, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:21:41,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1552~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1552~0.base_13|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1552~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1552~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1552~0.base_13|) |v_ULTIMATE.start_main_~#t1552~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1552~0.base_13| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t1552~0.base_13| 0)) (= 0 |v_ULTIMATE.start_main_~#t1552~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1552~0.offset=|v_ULTIMATE.start_main_~#t1552~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1552~0.base=|v_ULTIMATE.start_main_~#t1552~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1552~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1552~0.base] because there is no mapped edge [2019-12-07 12:21:41,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= ~y$r_buff0_thd1~0_Out135584871 1) (= ~y$r_buff0_thd1~0_In135584871 ~y$r_buff1_thd1~0_Out135584871) (= ~y$r_buff0_thd2~0_In135584871 ~y$r_buff1_thd2~0_Out135584871) (= ~x~0_In135584871 ~__unbuffered_p0_EAX~0_Out135584871) (= ~y$r_buff1_thd0~0_Out135584871 ~y$r_buff0_thd0~0_In135584871) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In135584871 0))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In135584871, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In135584871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135584871, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In135584871, ~x~0=~x~0_In135584871} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out135584871, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out135584871, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out135584871, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In135584871, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out135584871, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135584871, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In135584871, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out135584871, ~x~0=~x~0_In135584871} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:21:41,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In252406004 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In252406004 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out252406004| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out252406004| ~y$w_buff0_used~0_In252406004) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In252406004, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In252406004} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out252406004|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In252406004, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In252406004} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 12:21:41,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In845054676 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out845054676| ~y$w_buff0_used~0_In845054676) (= |P1Thread1of1ForFork1_#t~ite21_Out845054676| |P1Thread1of1ForFork1_#t~ite20_Out845054676|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In845054676 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In845054676 256)) .cse1) (= (mod ~y$w_buff0_used~0_In845054676 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In845054676 256)) .cse1)))) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out845054676| ~y$w_buff0_used~0_In845054676) (= |P1Thread1of1ForFork1_#t~ite20_In845054676| |P1Thread1of1ForFork1_#t~ite20_Out845054676|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In845054676|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845054676, ~weak$$choice2~0=~weak$$choice2~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In845054676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In845054676, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out845054676|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In845054676, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out845054676|, ~weak$$choice2~0=~weak$$choice2~0_In845054676, ~y$w_buff1_used~0=~y$w_buff1_used~0_In845054676} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 12:21:41,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= 0 (mod ~y$r_buff1_thd2~0_In-2120394537 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-2120394537 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-2120394537 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-2120394537 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-2120394537| |P1Thread1of1ForFork1_#t~ite23_Out-2120394537|)) (.cse2 (= 0 (mod ~weak$$choice2~0_In-2120394537 256)))) (or (let ((.cse4 (not .cse6))) (and (= |P1Thread1of1ForFork1_#t~ite22_Out-2120394537| 0) (not .cse0) .cse1 .cse2 (= |P1Thread1of1ForFork1_#t~ite23_Out-2120394537| |P1Thread1of1ForFork1_#t~ite22_Out-2120394537|) (or (not .cse3) .cse4) (or (not .cse5) .cse4))) (and (or (and (= |P1Thread1of1ForFork1_#t~ite24_Out-2120394537| ~y$w_buff1_used~0_In-2120394537) (= |P1Thread1of1ForFork1_#t~ite23_Out-2120394537| |P1Thread1of1ForFork1_#t~ite23_In-2120394537|) (not .cse2)) (and (or (and .cse6 .cse5) .cse0 (and .cse6 .cse3)) .cse1 .cse2 (= |P1Thread1of1ForFork1_#t~ite23_Out-2120394537| ~y$w_buff1_used~0_In-2120394537))) (= |P1Thread1of1ForFork1_#t~ite22_In-2120394537| |P1Thread1of1ForFork1_#t~ite22_Out-2120394537|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120394537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120394537, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-2120394537|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-2120394537|, ~weak$$choice2~0=~weak$$choice2~0_In-2120394537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120394537} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2120394537, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2120394537, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2120394537, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-2120394537|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-2120394537|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-2120394537|, ~weak$$choice2~0=~weak$$choice2~0_In-2120394537, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2120394537} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-07 12:21:41,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In521048916 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd1~0_In521048916 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In521048916 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In521048916 256)))) (or (and (= ~y$w_buff1_used~0_In521048916 |P0Thread1of1ForFork0_#t~ite6_Out521048916|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out521048916|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In521048916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In521048916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In521048916} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out521048916|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In521048916, ~y$w_buff0_used~0=~y$w_buff0_used~0_In521048916, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In521048916, ~y$w_buff1_used~0=~y$w_buff1_used~0_In521048916} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 12:21:41,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= ~y$r_buff0_thd1~0_In1136776121 ~y$r_buff0_thd1~0_Out1136776121)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1136776121 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1136776121 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (not .cse2) (= 0 ~y$r_buff0_thd1~0_Out1136776121)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1136776121} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1136776121, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1136776121|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1136776121} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:21:41,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In230540460 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In230540460 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In230540460 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In230540460 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In230540460 |P0Thread1of1ForFork0_#t~ite8_Out230540460|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out230540460|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In230540460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In230540460, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230540460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In230540460} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In230540460, ~y$w_buff0_used~0=~y$w_buff0_used~0_In230540460, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out230540460|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230540460, ~y$w_buff1_used~0=~y$w_buff1_used~0_In230540460} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 12:21:41,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_27|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_26|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_26|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_22|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_27|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_29|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:21:41,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In135271969 256) 0))) (or (and (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In135271969 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In135271969 256) 0) .cse0) (and (= (mod ~y$r_buff1_thd2~0_In135271969 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In135271969 256)))) .cse1 (= ~y$r_buff1_thd2~0_In135271969 |P1Thread1of1ForFork1_#t~ite29_Out135271969|) (= |P1Thread1of1ForFork1_#t~ite30_Out135271969| |P1Thread1of1ForFork1_#t~ite29_Out135271969|)) (and (= |P1Thread1of1ForFork1_#t~ite29_In135271969| |P1Thread1of1ForFork1_#t~ite29_Out135271969|) (= |P1Thread1of1ForFork1_#t~ite30_Out135271969| ~y$r_buff1_thd2~0_In135271969) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In135271969, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In135271969|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In135271969, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135271969, ~weak$$choice2~0=~weak$$choice2~0_In135271969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In135271969} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In135271969, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out135271969|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out135271969|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In135271969, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In135271969, ~weak$$choice2~0=~weak$$choice2~0_In135271969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In135271969} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 12:21:41,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 12:21:41,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1553668176 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1553668176 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out1553668176| ~y$w_buff1~0_In1553668176)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1553668176| ~y~0_In1553668176)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff1~0=~y$w_buff1~0_In1553668176, ~y~0=~y~0_In1553668176, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1553668176, ~y$w_buff1~0=~y$w_buff1~0_In1553668176, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1553668176|, ~y~0=~y~0_In1553668176, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1553668176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 12:21:41,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_11|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 12:21:41,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In544671081 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In544671081 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out544671081| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out544671081| ~y$w_buff0_used~0_In544671081) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In544671081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In544671081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In544671081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In544671081, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out544671081|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 12:21:41,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1416616963 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1416616963 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1416616963 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1416616963 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite35_Out-1416616963| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out-1416616963| ~y$w_buff1_used~0_In-1416616963)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1416616963, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416616963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1416616963, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416616963} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1416616963, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1416616963, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1416616963, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1416616963|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416616963} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 12:21:41,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1202497918 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1202497918 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1202497918|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1202497918| ~y$r_buff0_thd2~0_In-1202497918) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1202497918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1202497918} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1202497918, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1202497918, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1202497918|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 12:21:41,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In800285029 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In800285029 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In800285029 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In800285029 256)))) (or (and (= ~y$r_buff1_thd2~0_In800285029 |P1Thread1of1ForFork1_#t~ite37_Out800285029|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite37_Out800285029| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In800285029, ~y$w_buff0_used~0=~y$w_buff0_used~0_In800285029, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In800285029, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out800285029|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In800285029} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:21:41,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_26|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_25|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 12:21:41,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:21:41,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 12:21:41,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-179819414 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-179819414 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-179819414| ~y~0_In-179819414) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-179819414| ~y$w_buff1~0_In-179819414) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-179819414, ~y~0=~y~0_In-179819414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-179819414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-179819414} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-179819414|, ~y$w_buff1~0=~y$w_buff1~0_In-179819414, ~y~0=~y~0_In-179819414, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-179819414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-179819414} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 12:21:41,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 12:21:41,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In745546079 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In745546079 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out745546079| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite42_Out745546079| ~y$w_buff0_used~0_In745546079)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In745546079, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In745546079, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out745546079|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:21:41,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1117729706 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1117729706 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1117729706 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1117729706 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1117729706| ~y$w_buff1_used~0_In-1117729706) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1117729706| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117729706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117729706, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117729706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117729706} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1117729706, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1117729706, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1117729706|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1117729706, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1117729706} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 12:21:41,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1226500845 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1226500845 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1226500845 |ULTIMATE.start_main_#t~ite44_Out1226500845|)) (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1226500845|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1226500845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1226500845} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1226500845, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1226500845, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1226500845|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:21:41,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1431504905 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1431504905 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1431504905 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1431504905 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out1431504905| ~y$r_buff1_thd0~0_In1431504905) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1431504905|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1431504905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1431504905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1431504905, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1431504905} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1431504905, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1431504905, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1431504905, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1431504905|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1431504905} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:21:41,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_13) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:21:41,561 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_72969f5f-bd97-490d-9801-39e312f4e784/bin/uautomizer/witness.graphml [2019-12-07 12:21:41,561 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:21:41,562 INFO L168 Benchmark]: Toolchain (without parser) took 9588.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.4 MB). Free memory was 932.6 MB in the beginning and 869.5 MB in the end (delta: 63.2 MB). Peak memory consumption was 448.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:41,563 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:21:41,563 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:41,563 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.28 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 12:21:41,564 INFO L168 Benchmark]: Boogie Preprocessor took 24.27 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 12:21:41,564 INFO L168 Benchmark]: RCFGBuilder took 388.31 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: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:41,564 INFO L168 Benchmark]: TraceAbstraction took 8701.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 289.9 MB). Free memory was 1.0 GB in the beginning and 883.6 MB in the end (delta: 122.7 MB). Peak memory consumption was 412.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:41,565 INFO L168 Benchmark]: Witness Printer took 56.87 ms. Allocated memory is still 1.4 GB. Free memory was 883.6 MB in the beginning and 869.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:21:41,566 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.32 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -130.5 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.27 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 388.31 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: 51.4 MB). Peak memory consumption was 51.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8701.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 289.9 MB). Free memory was 1.0 GB in the beginning and 883.6 MB in the end (delta: 122.7 MB). Peak memory consumption was 412.7 MB. Max. memory is 11.5 GB. * Witness Printer took 56.87 ms. Allocated memory is still 1.4 GB. Free memory was 883.6 MB in the beginning and 869.5 MB in the end (delta: 14.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1551, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1552, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.5s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1534 SDtfs, 1938 SDslu, 3718 SDs, 0 SdLazy, 3130 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 17 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 5854 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 473 NumberOfCodeBlocks, 473 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 408 ConstructedInterpolants, 0 QuantifiedInterpolants, 88906 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...