./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe002_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_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe002_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/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 16401fd32fa640c43cb7c4dc2368e88535e4a607 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:48:36,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:48:36,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:48:36,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:48:36,092 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:48:36,093 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:48:36,094 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:48:36,095 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:48:36,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:48:36,097 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:48:36,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:48:36,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:48:36,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:48:36,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:48:36,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:48:36,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:48:36,101 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:48:36,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:48:36,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:48:36,105 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:48:36,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:48:36,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:48:36,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:48:36,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:48:36,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:48:36,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:48:36,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:48:36,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:48:36,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:48:36,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:48:36,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:48:36,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:48:36,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:48:36,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:48:36,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:48:36,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:48:36,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:48:36,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:48:36,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:48:36,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:48:36,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:48:36,115 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:48:36,124 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:48:36,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:48:36,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:48:36,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:48:36,125 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:48:36,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:48:36,126 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:48:36,127 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:48:36,127 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:48:36,127 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:48:36,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:48:36,127 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:48:36,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:48:36,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:48:36,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:48:36,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:48:36,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:48:36,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:48:36,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:48:36,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:48:36,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:48:36,128 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_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/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 -> 16401fd32fa640c43cb7c4dc2368e88535e4a607 [2019-12-07 11:48:36,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:48:36,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:48:36,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:48:36,246 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:48:36,246 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:48:36,247 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe002_pso.opt.i [2019-12-07 11:48:36,293 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/data/eb534b3fe/83beed1bed154a518b41be4fa7729f76/FLAG2e0cdfb29 [2019-12-07 11:48:36,760 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:48:36,760 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/sv-benchmarks/c/pthread-wmm/safe002_pso.opt.i [2019-12-07 11:48:36,770 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/data/eb534b3fe/83beed1bed154a518b41be4fa7729f76/FLAG2e0cdfb29 [2019-12-07 11:48:36,779 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/data/eb534b3fe/83beed1bed154a518b41be4fa7729f76 [2019-12-07 11:48:36,781 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:48:36,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:48:36,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:48:36,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:48:36,785 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:48:36,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:48:36" (1/1) ... [2019-12-07 11:48:36,787 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@595214f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:36, skipping insertion in model container [2019-12-07 11:48:36,787 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:48:36" (1/1) ... [2019-12-07 11:48:36,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:48:36,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:48:37,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:48:37,070 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:48:37,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:48:37,160 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:48:37,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37 WrapperNode [2019-12-07 11:48:37,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:48:37,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:48:37,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:48:37,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:48:37,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,181 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,199 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:48:37,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:48:37,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:48:37,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:48:37,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,209 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... [2019-12-07 11:48:37,224 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:48:37,225 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:48:37,225 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:48:37,225 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:48:37,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:48:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:48:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:48:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:48:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:48:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:48:37,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:48:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:48:37,265 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:48:37,265 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:48:37,266 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:48:37,266 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:48:37,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:48:37,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:48:37,267 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:48:37,623 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:48:37,624 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:48:37,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:48:37 BoogieIcfgContainer [2019-12-07 11:48:37,624 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:48:37,625 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:48:37,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:48:37,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:48:37,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:48:36" (1/3) ... [2019-12-07 11:48:37,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49388e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:48:37, skipping insertion in model container [2019-12-07 11:48:37,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:48:37" (2/3) ... [2019-12-07 11:48:37,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49388e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:48:37, skipping insertion in model container [2019-12-07 11:48:37,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:48:37" (3/3) ... [2019-12-07 11:48:37,629 INFO L109 eAbstractionObserver]: Analyzing ICFG safe002_pso.opt.i [2019-12-07 11:48:37,635 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:48:37,635 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:48:37,640 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:48:37,641 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:48:37,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,668 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,669 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,685 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,685 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,686 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,691 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,691 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:48:37,711 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:48:37,725 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:48:37,725 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:48:37,725 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:48:37,725 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:48:37,725 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:48:37,725 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:48:37,726 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:48:37,726 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:48:37,741 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-07 11:48:37,743 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 11:48:37,811 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 11:48:37,811 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:48:37,821 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 11:48:37,835 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-07 11:48:37,861 INFO L134 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-07 11:48:37,861 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:48:37,867 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 716 event pairs. 9/157 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 11:48:37,882 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-07 11:48:37,883 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:48:40,903 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-07 11:48:41,009 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 11:48:41,025 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64859 [2019-12-07 11:48:41,025 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 11:48:41,029 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 91 transitions [2019-12-07 11:48:49,142 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80448 states. [2019-12-07 11:48:49,143 INFO L276 IsEmpty]: Start isEmpty. Operand 80448 states. [2019-12-07 11:48:49,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 11:48:49,147 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:49,148 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 11:48:49,148 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:49,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:49,152 INFO L82 PathProgramCache]: Analyzing trace with hash 798334706, now seen corresponding path program 1 times [2019-12-07 11:48:49,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:49,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226293046] [2019-12-07 11:48:49,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:49,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:49,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:48:49,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226293046] [2019-12-07 11:48:49,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:48:49,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:48:49,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466440366] [2019-12-07 11:48:49,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:48:49,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:49,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:48:49,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:48:49,313 INFO L87 Difference]: Start difference. First operand 80448 states. Second operand 3 states. [2019-12-07 11:48:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:49,937 INFO L93 Difference]: Finished difference Result 79498 states and 344058 transitions. [2019-12-07 11:48:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:48:49,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 11:48:49,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:50,318 INFO L225 Difference]: With dead ends: 79498 [2019-12-07 11:48:50,318 INFO L226 Difference]: Without dead ends: 74626 [2019-12-07 11:48:50,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:48:53,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74626 states. [2019-12-07 11:48:54,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74626 to 74626. [2019-12-07 11:48:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74626 states. [2019-12-07 11:48:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74626 states to 74626 states and 322484 transitions. [2019-12-07 11:48:54,398 INFO L78 Accepts]: Start accepts. Automaton has 74626 states and 322484 transitions. Word has length 5 [2019-12-07 11:48:54,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:54,398 INFO L462 AbstractCegarLoop]: Abstraction has 74626 states and 322484 transitions. [2019-12-07 11:48:54,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:48:54,398 INFO L276 IsEmpty]: Start isEmpty. Operand 74626 states and 322484 transitions. [2019-12-07 11:48:54,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:48:54,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:54,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:54,406 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:54,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:54,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1987891641, now seen corresponding path program 1 times [2019-12-07 11:48:54,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:54,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824449364] [2019-12-07 11:48:54,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:54,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:48:54,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824449364] [2019-12-07 11:48:54,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:48:54,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:48:54,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400279944] [2019-12-07 11:48:54,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:48:54,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:54,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:48:54,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:48:54,458 INFO L87 Difference]: Start difference. First operand 74626 states and 322484 transitions. Second operand 3 states. [2019-12-07 11:48:54,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:54,557 INFO L93 Difference]: Finished difference Result 19918 states and 69198 transitions. [2019-12-07 11:48:54,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:48:54,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 11:48:54,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:54,596 INFO L225 Difference]: With dead ends: 19918 [2019-12-07 11:48:54,596 INFO L226 Difference]: Without dead ends: 19918 [2019-12-07 11:48:54,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:48:54,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19918 states. [2019-12-07 11:48:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19918 to 19918. [2019-12-07 11:48:54,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19918 states. [2019-12-07 11:48:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19918 states to 19918 states and 69198 transitions. [2019-12-07 11:48:54,933 INFO L78 Accepts]: Start accepts. Automaton has 19918 states and 69198 transitions. Word has length 13 [2019-12-07 11:48:54,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:54,934 INFO L462 AbstractCegarLoop]: Abstraction has 19918 states and 69198 transitions. [2019-12-07 11:48:54,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:48:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 19918 states and 69198 transitions. [2019-12-07 11:48:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:48:54,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:54,935 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:54,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:54,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:54,936 INFO L82 PathProgramCache]: Analyzing trace with hash -225338063, now seen corresponding path program 1 times [2019-12-07 11:48:54,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:54,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156267702] [2019-12-07 11:48:54,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:48:55,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156267702] [2019-12-07 11:48:55,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:48:55,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:48:55,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573777968] [2019-12-07 11:48:55,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:48:55,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:55,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:48:55,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:48:55,008 INFO L87 Difference]: Start difference. First operand 19918 states and 69198 transitions. Second operand 4 states. [2019-12-07 11:48:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:55,247 INFO L93 Difference]: Finished difference Result 29603 states and 99212 transitions. [2019-12-07 11:48:55,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:48:55,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 11:48:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:55,298 INFO L225 Difference]: With dead ends: 29603 [2019-12-07 11:48:55,298 INFO L226 Difference]: Without dead ends: 29589 [2019-12-07 11:48:55,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:48:55,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29589 states. [2019-12-07 11:48:56,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29589 to 26899. [2019-12-07 11:48:56,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26899 states. [2019-12-07 11:48:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26899 states to 26899 states and 90919 transitions. [2019-12-07 11:48:56,624 INFO L78 Accepts]: Start accepts. Automaton has 26899 states and 90919 transitions. Word has length 13 [2019-12-07 11:48:56,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:56,625 INFO L462 AbstractCegarLoop]: Abstraction has 26899 states and 90919 transitions. [2019-12-07 11:48:56,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:48:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 26899 states and 90919 transitions. [2019-12-07 11:48:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 11:48:56,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:56,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:56,626 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash -457982250, now seen corresponding path program 1 times [2019-12-07 11:48:56,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:56,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046254429] [2019-12-07 11:48:56,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:48:56,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046254429] [2019-12-07 11:48:56,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:48:56,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:48:56,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028828066] [2019-12-07 11:48:56,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:48:56,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:56,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:48:56,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:48:56,680 INFO L87 Difference]: Start difference. First operand 26899 states and 90919 transitions. Second operand 5 states. [2019-12-07 11:48:56,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:56,973 INFO L93 Difference]: Finished difference Result 40028 states and 132579 transitions. [2019-12-07 11:48:56,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:48:56,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 11:48:56,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:57,029 INFO L225 Difference]: With dead ends: 40028 [2019-12-07 11:48:57,029 INFO L226 Difference]: Without dead ends: 40010 [2019-12-07 11:48:57,030 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 11:48:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40010 states. [2019-12-07 11:48:57,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40010 to 31276. [2019-12-07 11:48:57,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31276 states. [2019-12-07 11:48:57,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31276 states to 31276 states and 104921 transitions. [2019-12-07 11:48:57,604 INFO L78 Accepts]: Start accepts. Automaton has 31276 states and 104921 transitions. Word has length 14 [2019-12-07 11:48:57,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:57,605 INFO L462 AbstractCegarLoop]: Abstraction has 31276 states and 104921 transitions. [2019-12-07 11:48:57,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:48:57,605 INFO L276 IsEmpty]: Start isEmpty. Operand 31276 states and 104921 transitions. [2019-12-07 11:48:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:48:57,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:57,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:57,612 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:57,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:57,612 INFO L82 PathProgramCache]: Analyzing trace with hash -620486811, now seen corresponding path program 1 times [2019-12-07 11:48:57,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:57,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485865012] [2019-12-07 11:48:57,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:48:57,706 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485865012] [2019-12-07 11:48:57,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:48:57,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:48:57,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495890290] [2019-12-07 11:48:57,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:48:57,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:57,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:48:57,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:48:57,708 INFO L87 Difference]: Start difference. First operand 31276 states and 104921 transitions. Second operand 6 states. [2019-12-07 11:48:58,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:58,397 INFO L93 Difference]: Finished difference Result 54414 states and 177321 transitions. [2019-12-07 11:48:58,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:48:58,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 11:48:58,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:58,481 INFO L225 Difference]: With dead ends: 54414 [2019-12-07 11:48:58,481 INFO L226 Difference]: Without dead ends: 54384 [2019-12-07 11:48:58,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:48:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54384 states. [2019-12-07 11:48:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54384 to 36377. [2019-12-07 11:48:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36377 states. [2019-12-07 11:48:59,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36377 states to 36377 states and 120495 transitions. [2019-12-07 11:48:59,196 INFO L78 Accepts]: Start accepts. Automaton has 36377 states and 120495 transitions. Word has length 22 [2019-12-07 11:48:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:48:59,196 INFO L462 AbstractCegarLoop]: Abstraction has 36377 states and 120495 transitions. [2019-12-07 11:48:59,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:48:59,196 INFO L276 IsEmpty]: Start isEmpty. Operand 36377 states and 120495 transitions. [2019-12-07 11:48:59,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:48:59,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:48:59,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:48:59,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:48:59,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:48:59,202 INFO L82 PathProgramCache]: Analyzing trace with hash -2022809675, now seen corresponding path program 2 times [2019-12-07 11:48:59,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:48:59,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383134123] [2019-12-07 11:48:59,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:48:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:48:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:48:59,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383134123] [2019-12-07 11:48:59,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:48:59,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:48:59,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849297762] [2019-12-07 11:48:59,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:48:59,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:48:59,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:48:59,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:48:59,290 INFO L87 Difference]: Start difference. First operand 36377 states and 120495 transitions. Second operand 7 states. [2019-12-07 11:48:59,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:48:59,857 INFO L93 Difference]: Finished difference Result 54885 states and 178707 transitions. [2019-12-07 11:48:59,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:48:59,858 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 11:48:59,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:48:59,943 INFO L225 Difference]: With dead ends: 54885 [2019-12-07 11:48:59,943 INFO L226 Difference]: Without dead ends: 54843 [2019-12-07 11:48:59,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:49:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54843 states. [2019-12-07 11:49:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54843 to 31795. [2019-12-07 11:49:00,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-12-07 11:49:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 106002 transitions. [2019-12-07 11:49:00,691 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 106002 transitions. Word has length 22 [2019-12-07 11:49:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:00,691 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 106002 transitions. [2019-12-07 11:49:00,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:49:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 106002 transitions. [2019-12-07 11:49:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:49:00,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:00,700 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] [2019-12-07 11:49:00,701 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -364842915, now seen corresponding path program 1 times [2019-12-07 11:49:00,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:00,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005144512] [2019-12-07 11:49:00,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:00,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005144512] [2019-12-07 11:49:00,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:00,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:49:00,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230831879] [2019-12-07 11:49:00,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:49:00,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:49:00,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:49:00,834 INFO L87 Difference]: Start difference. First operand 31795 states and 106002 transitions. Second operand 7 states. [2019-12-07 11:49:01,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:01,238 INFO L93 Difference]: Finished difference Result 43280 states and 141905 transitions. [2019-12-07 11:49:01,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:49:01,239 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-07 11:49:01,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:01,299 INFO L225 Difference]: With dead ends: 43280 [2019-12-07 11:49:01,300 INFO L226 Difference]: Without dead ends: 43256 [2019-12-07 11:49:01,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:49:01,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43256 states. [2019-12-07 11:49:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43256 to 36906. [2019-12-07 11:49:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36906 states. [2019-12-07 11:49:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36906 states to 36906 states and 121991 transitions. [2019-12-07 11:49:01,936 INFO L78 Accepts]: Start accepts. Automaton has 36906 states and 121991 transitions. Word has length 25 [2019-12-07 11:49:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:01,936 INFO L462 AbstractCegarLoop]: Abstraction has 36906 states and 121991 transitions. [2019-12-07 11:49:01,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:49:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 36906 states and 121991 transitions. [2019-12-07 11:49:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:49:01,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:01,950 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] [2019-12-07 11:49:01,950 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:01,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:01,951 INFO L82 PathProgramCache]: Analyzing trace with hash -20249452, now seen corresponding path program 1 times [2019-12-07 11:49:01,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:01,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901172434] [2019-12-07 11:49:01,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:01,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901172434] [2019-12-07 11:49:01,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:01,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:49:01,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95739567] [2019-12-07 11:49:01,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:01,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:01,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:01,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:01,992 INFO L87 Difference]: Start difference. First operand 36906 states and 121991 transitions. Second operand 4 states. [2019-12-07 11:49:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:02,043 INFO L93 Difference]: Finished difference Result 13915 states and 42809 transitions. [2019-12-07 11:49:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:02,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 11:49:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:02,061 INFO L225 Difference]: With dead ends: 13915 [2019-12-07 11:49:02,061 INFO L226 Difference]: Without dead ends: 13915 [2019-12-07 11:49:02,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13915 states. [2019-12-07 11:49:02,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13915 to 13539. [2019-12-07 11:49:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13539 states. [2019-12-07 11:49:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13539 states to 13539 states and 41673 transitions. [2019-12-07 11:49:02,260 INFO L78 Accepts]: Start accepts. Automaton has 13539 states and 41673 transitions. Word has length 28 [2019-12-07 11:49:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:02,260 INFO L462 AbstractCegarLoop]: Abstraction has 13539 states and 41673 transitions. [2019-12-07 11:49:02,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 13539 states and 41673 transitions. [2019-12-07 11:49:02,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:49:02,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:02,278 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:02,278 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:02,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:02,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1598965693, now seen corresponding path program 1 times [2019-12-07 11:49:02,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:02,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565595572] [2019-12-07 11:49:02,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:02,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565595572] [2019-12-07 11:49:02,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:02,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:49:02,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771684214] [2019-12-07 11:49:02,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:49:02,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:49:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:02,326 INFO L87 Difference]: Start difference. First operand 13539 states and 41673 transitions. Second operand 5 states. [2019-12-07 11:49:02,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:02,663 INFO L93 Difference]: Finished difference Result 19504 states and 59572 transitions. [2019-12-07 11:49:02,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:49:02,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-07 11:49:02,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:02,684 INFO L225 Difference]: With dead ends: 19504 [2019-12-07 11:49:02,684 INFO L226 Difference]: Without dead ends: 19504 [2019-12-07 11:49:02,684 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 11:49:02,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19504 states. [2019-12-07 11:49:02,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19504 to 17985. [2019-12-07 11:49:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17985 states. [2019-12-07 11:49:02,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17985 states to 17985 states and 55256 transitions. [2019-12-07 11:49:02,948 INFO L78 Accepts]: Start accepts. Automaton has 17985 states and 55256 transitions. Word has length 39 [2019-12-07 11:49:02,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:02,948 INFO L462 AbstractCegarLoop]: Abstraction has 17985 states and 55256 transitions. [2019-12-07 11:49:02,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:49:02,948 INFO L276 IsEmpty]: Start isEmpty. Operand 17985 states and 55256 transitions. [2019-12-07 11:49:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 11:49:02,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:02,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:02,969 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2135894693, now seen corresponding path program 2 times [2019-12-07 11:49:02,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:02,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248348814] [2019-12-07 11:49:02,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:03,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248348814] [2019-12-07 11:49:03,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:03,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:03,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056697718] [2019-12-07 11:49:03,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:49:03,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:03,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:49:03,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:03,020 INFO L87 Difference]: Start difference. First operand 17985 states and 55256 transitions. Second operand 3 states. [2019-12-07 11:49:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:03,068 INFO L93 Difference]: Finished difference Result 17189 states and 52247 transitions. [2019-12-07 11:49:03,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:49:03,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-07 11:49:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:03,087 INFO L225 Difference]: With dead ends: 17189 [2019-12-07 11:49:03,087 INFO L226 Difference]: Without dead ends: 17189 [2019-12-07 11:49:03,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:03,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17189 states. [2019-12-07 11:49:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17189 to 17101. [2019-12-07 11:49:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17101 states. [2019-12-07 11:49:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17101 states to 17101 states and 52003 transitions. [2019-12-07 11:49:03,304 INFO L78 Accepts]: Start accepts. Automaton has 17101 states and 52003 transitions. Word has length 39 [2019-12-07 11:49:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:03,304 INFO L462 AbstractCegarLoop]: Abstraction has 17101 states and 52003 transitions. [2019-12-07 11:49:03,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:49:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 17101 states and 52003 transitions. [2019-12-07 11:49:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 11:49:03,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:03,321 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] [2019-12-07 11:49:03,322 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:03,322 INFO L82 PathProgramCache]: Analyzing trace with hash 790151032, now seen corresponding path program 1 times [2019-12-07 11:49:03,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:03,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645062801] [2019-12-07 11:49:03,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:03,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645062801] [2019-12-07 11:49:03,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:03,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:49:03,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075461977] [2019-12-07 11:49:03,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:49:03,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:03,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:49:03,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:03,373 INFO L87 Difference]: Start difference. First operand 17101 states and 52003 transitions. Second operand 5 states. [2019-12-07 11:49:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:03,437 INFO L93 Difference]: Finished difference Result 15548 states and 48108 transitions. [2019-12-07 11:49:03,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:49:03,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 11:49:03,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:03,454 INFO L225 Difference]: With dead ends: 15548 [2019-12-07 11:49:03,454 INFO L226 Difference]: Without dead ends: 15548 [2019-12-07 11:49:03,454 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:03,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15548 states. [2019-12-07 11:49:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15548 to 13775. [2019-12-07 11:49:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13775 states. [2019-12-07 11:49:03,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13775 states to 13775 states and 42858 transitions. [2019-12-07 11:49:03,653 INFO L78 Accepts]: Start accepts. Automaton has 13775 states and 42858 transitions. Word has length 40 [2019-12-07 11:49:03,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:03,653 INFO L462 AbstractCegarLoop]: Abstraction has 13775 states and 42858 transitions. [2019-12-07 11:49:03,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:49:03,653 INFO L276 IsEmpty]: Start isEmpty. Operand 13775 states and 42858 transitions. [2019-12-07 11:49:03,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:49:03,665 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:03,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:03,665 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:03,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash 875448344, now seen corresponding path program 1 times [2019-12-07 11:49:03,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:03,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118320355] [2019-12-07 11:49:03,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:03,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:03,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118320355] [2019-12-07 11:49:03,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:03,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:49:03,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330079617] [2019-12-07 11:49:03,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:49:03,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:03,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:49:03,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:03,708 INFO L87 Difference]: Start difference. First operand 13775 states and 42858 transitions. Second operand 3 states. [2019-12-07 11:49:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:03,768 INFO L93 Difference]: Finished difference Result 18601 states and 57951 transitions. [2019-12-07 11:49:03,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:49:03,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 11:49:03,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:03,789 INFO L225 Difference]: With dead ends: 18601 [2019-12-07 11:49:03,789 INFO L226 Difference]: Without dead ends: 18601 [2019-12-07 11:49:03,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:03,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18601 states. [2019-12-07 11:49:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18601 to 15607. [2019-12-07 11:49:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15607 states. [2019-12-07 11:49:04,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15607 states to 15607 states and 49073 transitions. [2019-12-07 11:49:04,017 INFO L78 Accepts]: Start accepts. Automaton has 15607 states and 49073 transitions. Word has length 55 [2019-12-07 11:49:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:04,017 INFO L462 AbstractCegarLoop]: Abstraction has 15607 states and 49073 transitions. [2019-12-07 11:49:04,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:49:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 15607 states and 49073 transitions. [2019-12-07 11:49:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 11:49:04,031 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:04,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:04,031 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:04,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:04,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1829960825, now seen corresponding path program 1 times [2019-12-07 11:49:04,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:04,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792357005] [2019-12-07 11:49:04,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:04,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792357005] [2019-12-07 11:49:04,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:04,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:49:04,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754484771] [2019-12-07 11:49:04,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:49:04,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:04,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:49:04,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:04,091 INFO L87 Difference]: Start difference. First operand 15607 states and 49073 transitions. Second operand 3 states. [2019-12-07 11:49:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:04,141 INFO L93 Difference]: Finished difference Result 15607 states and 49071 transitions. [2019-12-07 11:49:04,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:49:04,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 11:49:04,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:04,159 INFO L225 Difference]: With dead ends: 15607 [2019-12-07 11:49:04,159 INFO L226 Difference]: Without dead ends: 15607 [2019-12-07 11:49:04,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15607 states. [2019-12-07 11:49:04,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15607 to 14620. [2019-12-07 11:49:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14620 states. [2019-12-07 11:49:04,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14620 states to 14620 states and 46248 transitions. [2019-12-07 11:49:04,369 INFO L78 Accepts]: Start accepts. Automaton has 14620 states and 46248 transitions. Word has length 55 [2019-12-07 11:49:04,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:04,369 INFO L462 AbstractCegarLoop]: Abstraction has 14620 states and 46248 transitions. [2019-12-07 11:49:04,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:49:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14620 states and 46248 transitions. [2019-12-07 11:49:04,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:49:04,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:04,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:04,383 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:04,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:04,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1826980617, now seen corresponding path program 1 times [2019-12-07 11:49:04,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:04,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601234705] [2019-12-07 11:49:04,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:04,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601234705] [2019-12-07 11:49:04,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:04,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:49:04,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620841756] [2019-12-07 11:49:04,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:49:04,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:49:04,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:04,455 INFO L87 Difference]: Start difference. First operand 14620 states and 46248 transitions. Second operand 5 states. [2019-12-07 11:49:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:04,568 INFO L93 Difference]: Finished difference Result 38006 states and 120382 transitions. [2019-12-07 11:49:04,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:49:04,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 11:49:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:04,595 INFO L225 Difference]: With dead ends: 38006 [2019-12-07 11:49:04,595 INFO L226 Difference]: Without dead ends: 23076 [2019-12-07 11:49:04,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:49:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23076 states. [2019-12-07 11:49:04,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23076 to 13804. [2019-12-07 11:49:04,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13804 states. [2019-12-07 11:49:04,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 43687 transitions. [2019-12-07 11:49:04,863 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 43687 transitions. Word has length 56 [2019-12-07 11:49:04,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:04,864 INFO L462 AbstractCegarLoop]: Abstraction has 13804 states and 43687 transitions. [2019-12-07 11:49:04,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:49:04,864 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 43687 transitions. [2019-12-07 11:49:04,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:49:04,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:04,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:04,881 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:04,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:04,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1502708477, now seen corresponding path program 2 times [2019-12-07 11:49:04,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:04,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333368019] [2019-12-07 11:49:04,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333368019] [2019-12-07 11:49:04,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:04,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:49:04,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612881388] [2019-12-07 11:49:04,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:49:04,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:04,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:49:04,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:04,951 INFO L87 Difference]: Start difference. First operand 13804 states and 43687 transitions. Second operand 5 states. [2019-12-07 11:49:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:05,124 INFO L93 Difference]: Finished difference Result 38534 states and 122679 transitions. [2019-12-07 11:49:05,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:49:05,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-07 11:49:05,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:05,132 INFO L225 Difference]: With dead ends: 38534 [2019-12-07 11:49:05,132 INFO L226 Difference]: Without dead ends: 7630 [2019-12-07 11:49:05,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:49:05,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7630 states. [2019-12-07 11:49:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7630 to 7630. [2019-12-07 11:49:05,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7630 states. [2019-12-07 11:49:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7630 states to 7630 states and 24403 transitions. [2019-12-07 11:49:05,240 INFO L78 Accepts]: Start accepts. Automaton has 7630 states and 24403 transitions. Word has length 56 [2019-12-07 11:49:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:05,240 INFO L462 AbstractCegarLoop]: Abstraction has 7630 states and 24403 transitions. [2019-12-07 11:49:05,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:49:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 7630 states and 24403 transitions. [2019-12-07 11:49:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:49:05,247 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:05,247 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:05,247 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:05,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:05,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1692402453, now seen corresponding path program 3 times [2019-12-07 11:49:05,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:05,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869920829] [2019-12-07 11:49:05,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:05,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869920829] [2019-12-07 11:49:05,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:05,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 11:49:05,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703971462] [2019-12-07 11:49:05,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:49:05,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:05,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:49:05,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:49:05,431 INFO L87 Difference]: Start difference. First operand 7630 states and 24403 transitions. Second operand 11 states. [2019-12-07 11:49:06,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:06,133 INFO L93 Difference]: Finished difference Result 17361 states and 54545 transitions. [2019-12-07 11:49:06,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-07 11:49:06,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-07 11:49:06,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:06,144 INFO L225 Difference]: With dead ends: 17361 [2019-12-07 11:49:06,144 INFO L226 Difference]: Without dead ends: 9870 [2019-12-07 11:49:06,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:49:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9870 states. [2019-12-07 11:49:06,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9870 to 8750. [2019-12-07 11:49:06,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8750 states. [2019-12-07 11:49:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8750 states to 8750 states and 27296 transitions. [2019-12-07 11:49:06,270 INFO L78 Accepts]: Start accepts. Automaton has 8750 states and 27296 transitions. Word has length 56 [2019-12-07 11:49:06,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:06,270 INFO L462 AbstractCegarLoop]: Abstraction has 8750 states and 27296 transitions. [2019-12-07 11:49:06,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:49:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 8750 states and 27296 transitions. [2019-12-07 11:49:06,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 11:49:06,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:06,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:06,277 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:06,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:06,277 INFO L82 PathProgramCache]: Analyzing trace with hash -374963123, now seen corresponding path program 4 times [2019-12-07 11:49:06,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:06,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204575600] [2019-12-07 11:49:06,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:49:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:49:06,353 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:49:06,353 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:49:06,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39| 1)) (= 0 v_~__unbuffered_p0_EAX~0_82) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39|) |v_ULTIMATE.start_main_~#t1834~0.offset_25| 0)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1834~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39|) 0) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t1834~0.offset_25|) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1834~0.base_39|) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ULTIMATE.start_main_~#t1834~0.base=|v_ULTIMATE.start_main_~#t1834~0.base_39|, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_16|, ~x~0=v_~x~0_186, ULTIMATE.start_main_~#t1834~0.offset=|v_ULTIMATE.start_main_~#t1834~0.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1834~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1836~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1835~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1835~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1834~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:49:06,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1835~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1835~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1835~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10|) |v_ULTIMATE.start_main_~#t1835~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1835~0.base_10| 4)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1835~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1835~0.base] because there is no mapped edge [2019-12-07 11:49:06,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t1836~0.offset_9| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10|) |v_ULTIMATE.start_main_~#t1836~0.offset_9| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1836~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1836~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1836~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_9|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1836~0.base, #length, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:49:06,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:49:06,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2048298416 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-2048298416 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-2048298416| ~x~0_In-2048298416)) (and (not .cse1) (= ~x$w_buff1~0_In-2048298416 |P2Thread1of1ForFork1_#t~ite32_Out-2048298416|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2048298416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2048298416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2048298416, ~x~0=~x~0_In-2048298416} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-2048298416|, ~x$w_buff1~0=~x$w_buff1~0_In-2048298416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2048298416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2048298416, ~x~0=~x~0_In-2048298416} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:49:06,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In207578744 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In207578744 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out207578744| ~x$w_buff0_used~0_In207578744)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out207578744| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In207578744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In207578744} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In207578744, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out207578744|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In207578744} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:49:06,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:49:06,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1318113800 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1318113800 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1318113800 |P2Thread1of1ForFork1_#t~ite34_Out1318113800|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1318113800| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1318113800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318113800} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1318113800|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1318113800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318113800} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:49:06,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1909323183 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1909323183 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1909323183 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1909323183 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1909323183|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1909323183 |P1Thread1of1ForFork0_#t~ite29_Out-1909323183|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1909323183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1909323183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1909323183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1909323183} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1909323183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1909323183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1909323183, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1909323183|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1909323183} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:49:06,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In867877906 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In867877906 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In867877906 ~x$r_buff0_thd2~0_Out867877906))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out867877906 0)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In867877906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In867877906} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out867877906|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out867877906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In867877906} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:49:06,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-306588155 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-306588155 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-306588155 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-306588155 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-306588155| ~x$r_buff1_thd2~0_In-306588155) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-306588155|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-306588155, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-306588155, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-306588155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-306588155} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-306588155|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-306588155, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-306588155, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-306588155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-306588155} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:49:06,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:49:06,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1650330499 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1650330499 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1650330499 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1650330499 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1650330499| 0)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1650330499| ~x$w_buff1_used~0_In-1650330499) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650330499, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1650330499, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1650330499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650330499} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1650330499|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650330499, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1650330499, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1650330499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650330499} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:49:06,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-163219801 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-163219801 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-163219801|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-163219801 |P2Thread1of1ForFork1_#t~ite36_Out-163219801|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-163219801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163219801} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-163219801|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-163219801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163219801} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:49:06,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In673491762 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out673491762| ~x$w_buff1~0_In673491762) (= |P0Thread1of1ForFork2_#t~ite12_Out673491762| |P0Thread1of1ForFork2_#t~ite11_Out673491762|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In673491762 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In673491762 256))) (= 0 (mod ~x$w_buff0_used~0_In673491762 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In673491762 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out673491762| ~x$w_buff1~0_In673491762) (= |P0Thread1of1ForFork2_#t~ite11_In673491762| |P0Thread1of1ForFork2_#t~ite11_Out673491762|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In673491762, ~x$w_buff1~0=~x$w_buff1~0_In673491762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In673491762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In673491762, ~weak$$choice2~0=~weak$$choice2~0_In673491762, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In673491762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In673491762} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In673491762, ~x$w_buff1~0=~x$w_buff1~0_In673491762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In673491762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In673491762, ~weak$$choice2~0=~weak$$choice2~0_In673491762, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out673491762|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out673491762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In673491762} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:49:06,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2139357163 256)))) (or (and (= ~x$w_buff0_used~0_In-2139357163 |P0Thread1of1ForFork2_#t~ite15_Out-2139357163|) (= |P0Thread1of1ForFork2_#t~ite14_In-2139357163| |P0Thread1of1ForFork2_#t~ite14_Out-2139357163|) (not .cse0)) (and (= ~x$w_buff0_used~0_In-2139357163 |P0Thread1of1ForFork2_#t~ite14_Out-2139357163|) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-2139357163| |P0Thread1of1ForFork2_#t~ite14_Out-2139357163|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2139357163 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-2139357163 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-2139357163 256) 0)) (= (mod ~x$w_buff0_used~0_In-2139357163 256) 0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2139357163, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139357163, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2139357163, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-2139357163|, ~weak$$choice2~0=~weak$$choice2~0_In-2139357163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139357163} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2139357163, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139357163, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-2139357163|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2139357163, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-2139357163|, ~weak$$choice2~0=~weak$$choice2~0_In-2139357163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139357163} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 11:49:06,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:49:06,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1041187711 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-1041187711| ~x$r_buff1_thd1~0_In-1041187711) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-1041187711| |P0Thread1of1ForFork2_#t~ite23_Out-1041187711|)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out-1041187711| ~x$r_buff1_thd1~0_In-1041187711) (= |P0Thread1of1ForFork2_#t~ite24_Out-1041187711| |P0Thread1of1ForFork2_#t~ite23_Out-1041187711|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1041187711 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1041187711 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1041187711 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1041187711 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1041187711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1041187711, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1041187711, ~weak$$choice2~0=~weak$$choice2~0_In-1041187711, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1041187711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1041187711} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1041187711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1041187711, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1041187711, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1041187711|, ~weak$$choice2~0=~weak$$choice2~0_In-1041187711, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1041187711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1041187711} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 11:49:06,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:49:06,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In211481468 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In211481468 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In211481468 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In211481468 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out211481468|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In211481468 |P2Thread1of1ForFork1_#t~ite37_Out211481468|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In211481468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In211481468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In211481468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211481468} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out211481468|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In211481468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In211481468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In211481468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211481468} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:49:06,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:49:06,364 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:49:06,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In462212356 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out462212356| |ULTIMATE.start_main_#t~ite41_Out462212356|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In462212356 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~x~0_In462212356 |ULTIMATE.start_main_#t~ite41_Out462212356|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out462212356| ~x$w_buff1~0_In462212356) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In462212356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In462212356, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In462212356, ~x~0=~x~0_In462212356} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out462212356|, ~x$w_buff1~0=~x$w_buff1~0_In462212356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In462212356, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In462212356, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out462212356|, ~x~0=~x~0_In462212356} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:49:06,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1131934994 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1131934994 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1131934994| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1131934994| ~x$w_buff0_used~0_In-1131934994) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1131934994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1131934994} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1131934994, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1131934994|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1131934994} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:49:06,365 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1905742036 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1905742036 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1905742036 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1905742036 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1905742036| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1905742036| ~x$w_buff1_used~0_In-1905742036) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905742036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905742036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905742036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905742036} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905742036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905742036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905742036, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1905742036|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905742036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:49:06,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1325738466 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1325738466 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1325738466|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1325738466| ~x$r_buff0_thd0~0_In1325738466) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1325738466, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1325738466} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1325738466, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1325738466|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1325738466} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:49:06,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1271846708 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1271846708 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1271846708 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1271846708 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1271846708 |ULTIMATE.start_main_#t~ite46_Out-1271846708|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1271846708|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1271846708, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1271846708, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1271846708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271846708} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1271846708, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1271846708|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1271846708, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1271846708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271846708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:49:06,366 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:49:06,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:49:06 BasicIcfg [2019-12-07 11:49:06,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:49:06,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:49:06,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:49:06,414 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:49:06,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:48:37" (3/4) ... [2019-12-07 11:49:06,416 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:49:06,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_310 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff0_thd1~0_312 0) (= v_~x$flush_delayed~0_79 0) (= v_~main$tmp_guard0~0_19 0) (= v_~x$r_buff1_thd0~0_282 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39| 1)) (= 0 v_~__unbuffered_p0_EAX~0_82) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1834~0.base_39|) |v_ULTIMATE.start_main_~#t1834~0.offset_25| 0)) |v_#memory_int_21|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1834~0.base_39| 4)) (= |v_#NULL.offset_3| 0) (= 0 v_~x$w_buff1_used~0_528) (= 0 v_~x$r_buff0_thd2~0_267) (= 0 v_~x$r_buff1_thd2~0_231) (= v_~main$tmp_guard1~0_61 0) (= v_~y~0_262 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~weak$$choice2~0_142 0) (= 0 v_~x$read_delayed~0_6) (= (select .cse0 |v_ULTIMATE.start_main_~#t1834~0.base_39|) 0) (= 0 v_~__unbuffered_p2_EAX~0_70) (= 0 v_~x$w_buff1~0_255) (= v_~x$mem_tmp~0_46 0) (= v_~__unbuffered_cnt~0_141 0) (= 0 |v_ULTIMATE.start_main_~#t1834~0.offset_25|) (= 0 |v_#NULL.base_3|) (= 0 v_~x~0_186) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t1834~0.base_39|) (= 0 v_~x$r_buff1_thd3~0_228) (= 0 v_~weak$$choice0~0_40) (= 0 v_~x$w_buff0~0_335) (= v_~__unbuffered_p0_EBX~0_68 0) (= 0 v_~x$r_buff0_thd3~0_132) (= v_~x$r_buff0_thd0~0_156 0) (= 0 v_~x$w_buff0_used~0_798))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_335, ~x$flush_delayed~0=v_~x$flush_delayed~0_79, #NULL.offset=|v_#NULL.offset_3|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_310, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_132, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_25|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_70, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_37|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_156, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_68, ULTIMATE.start_main_~#t1834~0.base=|v_ULTIMATE.start_main_~#t1834~0.base_39|, ~x$w_buff1~0=v_~x$w_buff1~0_255, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_528, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_231, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_16|, ~x~0=v_~x~0_186, ULTIMATE.start_main_~#t1834~0.offset=|v_ULTIMATE.start_main_~#t1834~0.offset_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_312, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_123|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_228, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~x$mem_tmp~0=v_~x$mem_tmp~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_230|, ~y~0=v_~y~0_262, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_282, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_267, #NULL.base=|v_#NULL.base_3|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_798, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_142, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t1834~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_~#t1836~0.base, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1835~0.offset, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1835~0.base, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1834~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 11:49:06,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L816-1-->L818: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1835~0.offset_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1835~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1835~0.base_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1835~0.base_10|) |v_ULTIMATE.start_main_~#t1835~0.offset_10| 1)) |v_#memory_int_15|) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1835~0.base_10| 4)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1835~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1835~0.offset=|v_ULTIMATE.start_main_~#t1835~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1835~0.base=|v_ULTIMATE.start_main_~#t1835~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1835~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1835~0.base] because there is no mapped edge [2019-12-07 11:49:06,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-1-->L820: Formula: (and (= |v_ULTIMATE.start_main_~#t1836~0.offset_9| 0) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1836~0.base_10|) |v_ULTIMATE.start_main_~#t1836~0.offset_9| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1836~0.base_10| 4)) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t1836~0.base_10| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1836~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1836~0.base_10| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1836~0.base=|v_ULTIMATE.start_main_~#t1836~0.base_10|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1836~0.offset=|v_ULTIMATE.start_main_~#t1836~0.offset_9|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1836~0.base, #length, ULTIMATE.start_main_~#t1836~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 11:49:06,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L5-->L773: Formula: (and (= v_~x$r_buff1_thd1~0_19 v_~x$r_buff0_thd1~0_39) (= v_~x$r_buff1_thd0~0_10 v_~x$r_buff0_thd0~0_14) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_7) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4)) (= v_~x$r_buff1_thd3~0_10 v_~x$r_buff0_thd3~0_14) (= 1 v_~x$r_buff0_thd2~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_14, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_39, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_4, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_10, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_19, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_14, ~y~0=v_~y~0_7, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_10} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 11:49:06,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L793-2-->L793-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2048298416 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-2048298416 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-2048298416| ~x~0_In-2048298416)) (and (not .cse1) (= ~x$w_buff1~0_In-2048298416 |P2Thread1of1ForFork1_#t~ite32_Out-2048298416|) (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2048298416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2048298416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2048298416, ~x~0=~x~0_In-2048298416} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-2048298416|, ~x$w_buff1~0=~x$w_buff1~0_In-2048298416, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2048298416, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2048298416, ~x~0=~x~0_In-2048298416} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 11:49:06,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In207578744 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In207578744 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out207578744| ~x$w_buff0_used~0_In207578744)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out207578744| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In207578744, ~x$w_buff0_used~0=~x$w_buff0_used~0_In207578744} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In207578744, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out207578744|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In207578744} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 11:49:06,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L793-4-->L794: Formula: (= v_~x~0_69 |v_P2Thread1of1ForFork1_#t~ite32_20|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_20|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_19|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_37|, ~x~0=v_~x~0_69} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-07 11:49:06,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1318113800 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1318113800 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In1318113800 |P2Thread1of1ForFork1_#t~ite34_Out1318113800|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite34_Out1318113800| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1318113800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318113800} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out1318113800|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1318113800, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1318113800} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 11:49:06,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L775-->L775-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1909323183 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1909323183 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1909323183 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1909323183 256) 0))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-1909323183|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-1909323183 |P1Thread1of1ForFork0_#t~ite29_Out-1909323183|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1909323183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1909323183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1909323183, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1909323183} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1909323183, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1909323183, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1909323183, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1909323183|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1909323183} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 11:49:06,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L776-->L777: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In867877906 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In867877906 256) 0)) (.cse2 (= ~x$r_buff0_thd2~0_In867877906 ~x$r_buff0_thd2~0_Out867877906))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out867877906 0)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In867877906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In867877906} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out867877906|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out867877906, ~x$w_buff0_used~0=~x$w_buff0_used~0_In867877906} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 11:49:06,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-306588155 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-306588155 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-306588155 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In-306588155 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-306588155| ~x$r_buff1_thd2~0_In-306588155) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-306588155|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-306588155, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-306588155, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-306588155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-306588155} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-306588155|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-306588155, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-306588155, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-306588155, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-306588155} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:49:06,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L777-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_68 |v_P1Thread1of1ForFork0_#t~ite31_44|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_43|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_68, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 11:49:06,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In-1650330499 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1650330499 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1650330499 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1650330499 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1650330499| 0)) (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1650330499| ~x$w_buff1_used~0_In-1650330499) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650330499, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1650330499, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1650330499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650330499} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1650330499|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1650330499, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1650330499, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1650330499, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1650330499} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 11:49:06,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-163219801 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-163219801 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out-163219801|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd3~0_In-163219801 |P2Thread1of1ForFork1_#t~ite36_Out-163219801|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-163219801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163219801} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-163219801|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-163219801, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-163219801} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 11:49:06,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In673491762 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite11_Out673491762| ~x$w_buff1~0_In673491762) (= |P0Thread1of1ForFork2_#t~ite12_Out673491762| |P0Thread1of1ForFork2_#t~ite11_Out673491762|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In673491762 256) 0))) (or (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In673491762 256))) (= 0 (mod ~x$w_buff0_used~0_In673491762 256)) (and .cse1 (= (mod ~x$w_buff1_used~0_In673491762 256) 0))))) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite12_Out673491762| ~x$w_buff1~0_In673491762) (= |P0Thread1of1ForFork2_#t~ite11_In673491762| |P0Thread1of1ForFork2_#t~ite11_Out673491762|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In673491762, ~x$w_buff1~0=~x$w_buff1~0_In673491762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In673491762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In673491762, ~weak$$choice2~0=~weak$$choice2~0_In673491762, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In673491762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In673491762} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In673491762, ~x$w_buff1~0=~x$w_buff1~0_In673491762, ~x$w_buff1_used~0=~x$w_buff1_used~0_In673491762, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In673491762, ~weak$$choice2~0=~weak$$choice2~0_In673491762, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out673491762|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out673491762|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In673491762} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:49:06,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2139357163 256)))) (or (and (= ~x$w_buff0_used~0_In-2139357163 |P0Thread1of1ForFork2_#t~ite15_Out-2139357163|) (= |P0Thread1of1ForFork2_#t~ite14_In-2139357163| |P0Thread1of1ForFork2_#t~ite14_Out-2139357163|) (not .cse0)) (and (= ~x$w_buff0_used~0_In-2139357163 |P0Thread1of1ForFork2_#t~ite14_Out-2139357163|) .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out-2139357163| |P0Thread1of1ForFork2_#t~ite14_Out-2139357163|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-2139357163 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In-2139357163 256) 0)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-2139357163 256) 0)) (= (mod ~x$w_buff0_used~0_In-2139357163 256) 0)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2139357163, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139357163, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2139357163, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-2139357163|, ~weak$$choice2~0=~weak$$choice2~0_In-2139357163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139357163} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2139357163, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2139357163, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-2139357163|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-2139357163, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-2139357163|, ~weak$$choice2~0=~weak$$choice2~0_In-2139357163, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2139357163} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 11:49:06,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_98 v_~x$r_buff0_thd1~0_97) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_98, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_97, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_11|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_6|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 11:49:06,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1041187711 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite24_Out-1041187711| ~x$r_buff1_thd1~0_In-1041187711) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite23_In-1041187711| |P0Thread1of1ForFork2_#t~ite23_Out-1041187711|)) (and (= |P0Thread1of1ForFork2_#t~ite23_Out-1041187711| ~x$r_buff1_thd1~0_In-1041187711) (= |P0Thread1of1ForFork2_#t~ite24_Out-1041187711| |P0Thread1of1ForFork2_#t~ite23_Out-1041187711|) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1041187711 256) 0))) (or (and (= (mod ~x$r_buff1_thd1~0_In-1041187711 256) 0) .cse1) (= 0 (mod ~x$w_buff0_used~0_In-1041187711 256)) (and (= 0 (mod ~x$w_buff1_used~0_In-1041187711 256)) .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1041187711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1041187711, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1041187711, ~weak$$choice2~0=~weak$$choice2~0_In-1041187711, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1041187711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1041187711} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1041187711, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1041187711, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1041187711, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1041187711|, ~weak$$choice2~0=~weak$$choice2~0_In-1041187711, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1041187711|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1041187711} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-07 11:49:06,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_4 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_9|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 11:49:06,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L797-->L797-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In211481468 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In211481468 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In211481468 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In211481468 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out211481468|)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In211481468 |P2Thread1of1ForFork1_#t~ite37_Out211481468|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In211481468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In211481468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In211481468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211481468} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out211481468|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In211481468, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In211481468, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In211481468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In211481468} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 11:49:06,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L797-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_64 (+ v_~__unbuffered_cnt~0_65 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 11:49:06,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L820-1-->L826: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_35) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:49:06,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L826-2-->L826-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In462212356 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite42_Out462212356| |ULTIMATE.start_main_#t~ite41_Out462212356|)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In462212356 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~x~0_In462212356 |ULTIMATE.start_main_#t~ite41_Out462212356|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out462212356| ~x$w_buff1~0_In462212356) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In462212356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In462212356, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In462212356, ~x~0=~x~0_In462212356} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out462212356|, ~x$w_buff1~0=~x$w_buff1~0_In462212356, ~x$w_buff1_used~0=~x$w_buff1_used~0_In462212356, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In462212356, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out462212356|, ~x~0=~x~0_In462212356} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 11:49:06,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1131934994 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1131934994 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite43_Out-1131934994| 0)) (and (= |ULTIMATE.start_main_#t~ite43_Out-1131934994| ~x$w_buff0_used~0_In-1131934994) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1131934994, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1131934994} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1131934994, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1131934994|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1131934994} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 11:49:06,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1905742036 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1905742036 256))) (.cse3 (= (mod ~x$r_buff1_thd0~0_In-1905742036 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1905742036 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out-1905742036| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1905742036| ~x$w_buff1_used~0_In-1905742036) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905742036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905742036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905742036, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905742036} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1905742036, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1905742036, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1905742036, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1905742036|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1905742036} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 11:49:06,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1325738466 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1325738466 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out1325738466|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite45_Out1325738466| ~x$r_buff0_thd0~0_In1325738466) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1325738466, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1325738466} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1325738466, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1325738466|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1325738466} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 11:49:06,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd0~0_In-1271846708 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In-1271846708 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1271846708 256))) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-1271846708 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-1271846708 |ULTIMATE.start_main_#t~ite46_Out-1271846708|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite46_Out-1271846708|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1271846708, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1271846708, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1271846708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271846708} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1271846708, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1271846708|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1271846708, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1271846708, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1271846708} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 11:49:06,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_31) (= v_~__unbuffered_p0_EBX~0_30 0) (= v_~y~0_138 2) (= 2 v_~__unbuffered_p0_EAX~0_46))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_24) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15| (mod v_~main$tmp_guard1~0_24 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite46_51|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_51|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_30, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_50|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_31, ~y~0=v_~y~0_138, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:49:06,477 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7fa66c2e-c7f2-4320-8eb2-1fbc2fa4a35a/bin/uautomizer/witness.graphml [2019-12-07 11:49:06,477 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:49:06,478 INFO L168 Benchmark]: Toolchain (without parser) took 29696.69 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 944.7 MB in the beginning and 2.4 GB in the end (delta: -1.5 GB). Peak memory consumption was 982.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:06,479 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:06,479 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:06,479 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:06,479 INFO L168 Benchmark]: Boogie Preprocessor took 24.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:06,480 INFO L168 Benchmark]: RCFGBuilder took 399.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:06,480 INFO L168 Benchmark]: TraceAbstraction took 28788.42 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 936.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:06,480 INFO L168 Benchmark]: Witness Printer took 63.60 ms. Allocated memory is still 3.5 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:06,482 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 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.3 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.0 MB). Peak memory consumption was 54.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28788.42 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 1.0 GB in the beginning and 2.4 GB in the end (delta: -1.4 GB). Peak memory consumption was 936.6 MB. Max. memory is 11.5 GB. * Witness Printer took 63.60 ms. Allocated memory is still 3.5 GB. Free memory was 2.4 GB in the beginning and 2.4 GB in the end (delta: 10.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 163 ProgramPointsBefore, 82 ProgramPointsAfterwards, 194 TransitionsBefore, 91 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 6655 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 98 SemBasedMoverChecksPositive, 236 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 64859 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t1834, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L818] FCALL, FORK 0 pthread_create(&t1835, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L820] FCALL, FORK 0 pthread_create(&t1836, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 3 __unbuffered_p2_EAX = y [L790] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L793] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L773] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 __unbuffered_p0_EAX = y [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L737] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L775] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L738] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L740] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L829] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 28.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2322 SDtfs, 3310 SDslu, 5101 SDs, 0 SdLazy, 2659 SolverSat, 180 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80448occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 76958 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 594 NumberOfCodeBlocks, 594 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 522 ConstructedInterpolants, 0 QuantifiedInterpolants, 141170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...