./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/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 14e0c6f0ffbee5ee5649491fca2f61bbb742601f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:24:42,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:24:42,088 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:24:42,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:24:42,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:24:42,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:24:42,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:24:42,098 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:24:42,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:24:42,100 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:24:42,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:24:42,102 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:24:42,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:24:42,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:24:42,103 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:24:42,104 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:24:42,105 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:24:42,105 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:24:42,106 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:24:42,108 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:24:42,109 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:24:42,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:24:42,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:24:42,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:24:42,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:24:42,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:24:42,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:24:42,114 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:24:42,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:24:42,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:24:42,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:24:42,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:24:42,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:24:42,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:24:42,116 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:24:42,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:24:42,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:24:42,117 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:24:42,117 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:24:42,118 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:24:42,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:24:42,119 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:24:42,128 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:24:42,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:24:42,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:24:42,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:24:42,129 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:24:42,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:24:42,130 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:24:42,130 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:24:42,130 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:24:42,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:24:42,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:24:42,131 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:24:42,131 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:24:42,131 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:24:42,131 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:24:42,131 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:24:42,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:24:42,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:24:42,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:24:42,132 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:24:42,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:24:42,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:24:42,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:24:42,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:24:42,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:24:42,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:24:42,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:24:42,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:24:42,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:24:42,133 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_a4c47f25-a87f-464c-b36e-cabaa2158512/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 -> 14e0c6f0ffbee5ee5649491fca2f61bbb742601f [2019-12-07 17:24:42,231 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:24:42,239 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:24:42,241 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:24:42,242 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:24:42,242 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:24:42,243 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix027_power.opt.i [2019-12-07 17:24:42,278 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/data/6b3108cb9/2b4d2f996af343eb9ea45c593fde003a/FLAGaf839532a [2019-12-07 17:24:42,782 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:24:42,782 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/sv-benchmarks/c/pthread-wmm/mix027_power.opt.i [2019-12-07 17:24:42,792 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/data/6b3108cb9/2b4d2f996af343eb9ea45c593fde003a/FLAGaf839532a [2019-12-07 17:24:42,801 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/data/6b3108cb9/2b4d2f996af343eb9ea45c593fde003a [2019-12-07 17:24:42,803 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:24:42,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:24:42,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:24:42,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:24:42,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:24:42,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:24:42" (1/1) ... [2019-12-07 17:24:42,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fb68fac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:42, skipping insertion in model container [2019-12-07 17:24:42,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:24:42" (1/1) ... [2019-12-07 17:24:42,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:24:42,843 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:24:43,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:24:43,159 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:24:43,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:24:43,266 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:24:43,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43 WrapperNode [2019-12-07 17:24:43,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:24:43,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:24:43,267 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:24:43,267 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:24:43,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,286 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:24:43,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:24:43,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:24:43,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:24:43,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,316 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... [2019-12-07 17:24:43,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:24:43,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:24:43,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:24:43,332 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:24:43,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:24:43,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:24:43,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:24:43,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:24:43,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:24:43,374 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:24:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:24:43,374 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:24:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:24:43,374 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:24:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:24:43,374 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:24:43,374 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:24:43,375 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:24:43,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:24:43,375 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:24:43,376 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:24:43,732 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:24:43,732 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:24:43,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:43 BoogieIcfgContainer [2019-12-07 17:24:43,733 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:24:43,734 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:24:43,734 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:24:43,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:24:43,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:24:42" (1/3) ... [2019-12-07 17:24:43,736 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa07de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:24:43, skipping insertion in model container [2019-12-07 17:24:43,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:24:43" (2/3) ... [2019-12-07 17:24:43,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa07de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:24:43, skipping insertion in model container [2019-12-07 17:24:43,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:43" (3/3) ... [2019-12-07 17:24:43,738 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_power.opt.i [2019-12-07 17:24:43,744 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:24:43,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:24:43,749 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:24:43,750 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:24:43,775 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,782 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,783 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,784 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,788 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,789 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,790 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,791 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,792 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,793 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,794 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:24:43,806 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:24:43,819 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:24:43,819 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:24:43,819 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:24:43,819 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:24:43,819 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:24:43,819 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:24:43,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:24:43,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:24:43,830 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-07 17:24:43,831 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 17:24:43,884 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 17:24:43,884 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:24:43,895 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 17:24:43,911 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 17:24:43,942 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 17:24:43,942 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:24:43,948 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 17:24:43,963 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 17:24:43,964 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:24:46,984 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 17:24:47,082 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-07 17:24:47,082 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 17:24:47,085 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-07 17:25:19,125 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-07 17:25:19,127 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-07 17:25:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 17:25:19,131 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:19,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:19,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:19,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-07 17:25:19,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:19,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41985311] [2019-12-07 17:25:19,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:19,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:25:19,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41985311] [2019-12-07 17:25:19,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:19,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:25:19,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464631578] [2019-12-07 17:25:19,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:25:19,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:25:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:19,309 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-07 17:25:20,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:20,522 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-07 17:25:20,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:25:20,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 17:25:20,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:21,275 INFO L225 Difference]: With dead ends: 169554 [2019-12-07 17:25:21,275 INFO L226 Difference]: Without dead ends: 159076 [2019-12-07 17:25:21,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:25:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-07 17:25:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-07 17:25:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-07 17:25:32,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-07 17:25:32,577 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-07 17:25:32,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:32,578 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-07 17:25:32,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:25:32,578 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-07 17:25:32,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:25:32,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:32,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:32,586 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:32,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:32,586 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-07 17:25:32,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:32,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217763304] [2019-12-07 17:25:32,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:32,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:25:32,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217763304] [2019-12-07 17:25:32,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:32,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:32,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122548931] [2019-12-07 17:25:32,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:25:32,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:32,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:25:32,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:25:32,668 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-07 17:25:34,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:34,511 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-07 17:25:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:25:34,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:25:34,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:35,348 INFO L225 Difference]: With dead ends: 251868 [2019-12-07 17:25:35,348 INFO L226 Difference]: Without dead ends: 251658 [2019-12-07 17:25:35,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:25:45,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-07 17:25:48,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-07 17:25:48,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-07 17:25:50,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-07 17:25:50,049 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-07 17:25:50,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:50,049 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-07 17:25:50,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:25:50,049 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-07 17:25:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:25:50,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:50,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:25:50,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:50,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:50,053 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-07 17:25:50,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:25:50,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067005232] [2019-12-07 17:25:50,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:25:50,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:25:50,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067005232] [2019-12-07 17:25:50,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:50,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:25:50,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797295540] [2019-12-07 17:25:50,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:25:50,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:25:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:25:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:25:50,109 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 4 states. [2019-12-07 17:25:52,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:52,716 INFO L93 Difference]: Finished difference Result 333248 states and 1520275 transitions. [2019-12-07 17:25:52,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:25:52,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:25:52,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:53,640 INFO L225 Difference]: With dead ends: 333248 [2019-12-07 17:25:53,640 INFO L226 Difference]: Without dead ends: 333008 [2019-12-07 17:25:53,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:26:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333008 states. [2019-12-07 17:26:10,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333008 to 282040. [2019-12-07 17:26:10,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282040 states. [2019-12-07 17:26:11,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282040 states to 282040 states and 1305129 transitions. [2019-12-07 17:26:11,172 INFO L78 Accepts]: Start accepts. Automaton has 282040 states and 1305129 transitions. Word has length 15 [2019-12-07 17:26:11,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:11,172 INFO L462 AbstractCegarLoop]: Abstraction has 282040 states and 1305129 transitions. [2019-12-07 17:26:11,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:26:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 282040 states and 1305129 transitions. [2019-12-07 17:26:11,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:26:11,177 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:11,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:11,177 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-07 17:26:11,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:11,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377203457] [2019-12-07 17:26:11,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:11,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:11,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377203457] [2019-12-07 17:26:11,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:11,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:26:11,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226805526] [2019-12-07 17:26:11,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:26:11,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:26:11,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:26:11,234 INFO L87 Difference]: Start difference. First operand 282040 states and 1305129 transitions. Second operand 5 states. [2019-12-07 17:26:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:13,920 INFO L93 Difference]: Finished difference Result 380594 states and 1735388 transitions. [2019-12-07 17:26:13,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:26:13,921 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 17:26:13,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:15,759 INFO L225 Difference]: With dead ends: 380594 [2019-12-07 17:26:15,759 INFO L226 Difference]: Without dead ends: 380290 [2019-12-07 17:26:15,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:26:28,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380290 states. [2019-12-07 17:26:33,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380290 to 310408. [2019-12-07 17:26:33,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310408 states. [2019-12-07 17:26:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310408 states to 310408 states and 1434469 transitions. [2019-12-07 17:26:34,974 INFO L78 Accepts]: Start accepts. Automaton has 310408 states and 1434469 transitions. Word has length 16 [2019-12-07 17:26:34,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:34,975 INFO L462 AbstractCegarLoop]: Abstraction has 310408 states and 1434469 transitions. [2019-12-07 17:26:34,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:26:34,975 INFO L276 IsEmpty]: Start isEmpty. Operand 310408 states and 1434469 transitions. [2019-12-07 17:26:34,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:26:34,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:34,997 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:34,997 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:34,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:34,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1371682190, now seen corresponding path program 1 times [2019-12-07 17:26:34,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:34,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852161154] [2019-12-07 17:26:34,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:35,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:35,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852161154] [2019-12-07 17:26:35,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:35,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:26:35,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220067346] [2019-12-07 17:26:35,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:26:35,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:35,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:26:35,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:26:35,037 INFO L87 Difference]: Start difference. First operand 310408 states and 1434469 transitions. Second operand 3 states. [2019-12-07 17:26:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:35,903 INFO L93 Difference]: Finished difference Result 188449 states and 783822 transitions. [2019-12-07 17:26:35,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:26:35,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:26:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:36,379 INFO L225 Difference]: With dead ends: 188449 [2019-12-07 17:26:36,380 INFO L226 Difference]: Without dead ends: 188449 [2019-12-07 17:26:36,380 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 17:26:41,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188449 states. [2019-12-07 17:26:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188449 to 188449. [2019-12-07 17:26:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188449 states. [2019-12-07 17:26:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188449 states to 188449 states and 783822 transitions. [2019-12-07 17:26:47,406 INFO L78 Accepts]: Start accepts. Automaton has 188449 states and 783822 transitions. Word has length 20 [2019-12-07 17:26:47,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:47,406 INFO L462 AbstractCegarLoop]: Abstraction has 188449 states and 783822 transitions. [2019-12-07 17:26:47,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:26:47,406 INFO L276 IsEmpty]: Start isEmpty. Operand 188449 states and 783822 transitions. [2019-12-07 17:26:47,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:26:47,420 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:47,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:26:47,421 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:47,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:47,421 INFO L82 PathProgramCache]: Analyzing trace with hash -524999669, now seen corresponding path program 1 times [2019-12-07 17:26:47,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:26:47,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999336028] [2019-12-07 17:26:47,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:26:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:47,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:47,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999336028] [2019-12-07 17:26:47,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:47,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:26:47,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373161857] [2019-12-07 17:26:47,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:26:47,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:26:47,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:26:47,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:26:47,488 INFO L87 Difference]: Start difference. First operand 188449 states and 783822 transitions. Second operand 4 states. [2019-12-07 17:26:49,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:49,534 INFO L93 Difference]: Finished difference Result 361097 states and 1492871 transitions. [2019-12-07 17:26:49,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:26:49,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:26:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:50,406 INFO L225 Difference]: With dead ends: 361097 [2019-12-07 17:26:50,406 INFO L226 Difference]: Without dead ends: 345101 [2019-12-07 17:26:50,406 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:26:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345101 states. [2019-12-07 17:27:01,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345101 to 334440. [2019-12-07 17:27:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334440 states. [2019-12-07 17:27:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334440 states to 334440 states and 1384194 transitions. [2019-12-07 17:27:02,817 INFO L78 Accepts]: Start accepts. Automaton has 334440 states and 1384194 transitions. Word has length 21 [2019-12-07 17:27:02,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:02,817 INFO L462 AbstractCegarLoop]: Abstraction has 334440 states and 1384194 transitions. [2019-12-07 17:27:02,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:02,817 INFO L276 IsEmpty]: Start isEmpty. Operand 334440 states and 1384194 transitions. [2019-12-07 17:27:02,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:27:02,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:02,852 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 17:27:02,852 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:02,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:02,853 INFO L82 PathProgramCache]: Analyzing trace with hash -441224904, now seen corresponding path program 1 times [2019-12-07 17:27:02,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:02,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809722997] [2019-12-07 17:27:02,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:02,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:27:02,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809722997] [2019-12-07 17:27:02,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:02,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:27:02,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958376998] [2019-12-07 17:27:02,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:27:02,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:02,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:27:02,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:27:02,885 INFO L87 Difference]: Start difference. First operand 334440 states and 1384194 transitions. Second operand 3 states. [2019-12-07 17:27:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:07,158 INFO L93 Difference]: Finished difference Result 334440 states and 1370962 transitions. [2019-12-07 17:27:07,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:07,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 17:27:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:08,041 INFO L225 Difference]: With dead ends: 334440 [2019-12-07 17:27:08,041 INFO L226 Difference]: Without dead ends: 334440 [2019-12-07 17:27:08,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:27:14,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334440 states. [2019-12-07 17:27:18,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334440 to 329548. [2019-12-07 17:27:18,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329548 states. [2019-12-07 17:27:19,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329548 states to 329548 states and 1352725 transitions. [2019-12-07 17:27:19,632 INFO L78 Accepts]: Start accepts. Automaton has 329548 states and 1352725 transitions. Word has length 22 [2019-12-07 17:27:19,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:19,632 INFO L462 AbstractCegarLoop]: Abstraction has 329548 states and 1352725 transitions. [2019-12-07 17:27:19,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:27:19,632 INFO L276 IsEmpty]: Start isEmpty. Operand 329548 states and 1352725 transitions. [2019-12-07 17:27:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:27:19,663 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:19,663 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 17:27:19,663 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:19,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:19,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2116532531, now seen corresponding path program 1 times [2019-12-07 17:27:19,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:19,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13200740] [2019-12-07 17:27:19,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:27:19,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13200740] [2019-12-07 17:27:19,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:19,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:27:19,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950613123] [2019-12-07 17:27:19,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:27:19,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:19,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:27:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:27:19,705 INFO L87 Difference]: Start difference. First operand 329548 states and 1352725 transitions. Second operand 5 states. [2019-12-07 17:27:22,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:22,388 INFO L93 Difference]: Finished difference Result 435596 states and 1758254 transitions. [2019-12-07 17:27:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:27:23,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 17:27:23,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:24,182 INFO L225 Difference]: With dead ends: 435596 [2019-12-07 17:27:24,182 INFO L226 Difference]: Without dead ends: 435037 [2019-12-07 17:27:24,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:27:34,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435037 states. [2019-12-07 17:27:40,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435037 to 344058. [2019-12-07 17:27:40,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344058 states. [2019-12-07 17:27:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344058 states to 344058 states and 1410060 transitions. [2019-12-07 17:27:41,696 INFO L78 Accepts]: Start accepts. Automaton has 344058 states and 1410060 transitions. Word has length 22 [2019-12-07 17:27:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:41,696 INFO L462 AbstractCegarLoop]: Abstraction has 344058 states and 1410060 transitions. [2019-12-07 17:27:41,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:27:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 344058 states and 1410060 transitions. [2019-12-07 17:27:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:27:41,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:41,726 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 17:27:41,726 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:41,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:41,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1596932964, now seen corresponding path program 1 times [2019-12-07 17:27:41,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:41,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194402566] [2019-12-07 17:27:41,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:27:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:41,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:27:41,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194402566] [2019-12-07 17:27:41,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:41,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:27:41,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892452943] [2019-12-07 17:27:41,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:27:41,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:27:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:27:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:41,771 INFO L87 Difference]: Start difference. First operand 344058 states and 1410060 transitions. Second operand 4 states. [2019-12-07 17:27:44,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:44,515 INFO L93 Difference]: Finished difference Result 453533 states and 1849686 transitions. [2019-12-07 17:27:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:27:44,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 17:27:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:45,664 INFO L225 Difference]: With dead ends: 453533 [2019-12-07 17:27:45,664 INFO L226 Difference]: Without dead ends: 442345 [2019-12-07 17:27:45,665 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:27:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442345 states. [2019-12-07 17:27:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442345 to 325796. [2019-12-07 17:27:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325796 states. [2019-12-07 17:27:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325796 states to 325796 states and 1333960 transitions. [2019-12-07 17:27:59,011 INFO L78 Accepts]: Start accepts. Automaton has 325796 states and 1333960 transitions. Word has length 22 [2019-12-07 17:27:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:59,012 INFO L462 AbstractCegarLoop]: Abstraction has 325796 states and 1333960 transitions. [2019-12-07 17:27:59,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 325796 states and 1333960 transitions. [2019-12-07 17:27:59,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:27:59,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:59,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:27:59,049 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:59,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash -276850441, now seen corresponding path program 1 times [2019-12-07 17:27:59,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:27:59,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575644757] [2019-12-07 17:27:59,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:03,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:03,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575644757] [2019-12-07 17:28:03,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:03,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:03,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622021352] [2019-12-07 17:28:03,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:03,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:03,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:03,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:03,496 INFO L87 Difference]: Start difference. First operand 325796 states and 1333960 transitions. Second operand 5 states. [2019-12-07 17:28:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:06,478 INFO L93 Difference]: Finished difference Result 582403 states and 2367962 transitions. [2019-12-07 17:28:06,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:28:06,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-07 17:28:06,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:07,358 INFO L225 Difference]: With dead ends: 582403 [2019-12-07 17:28:07,358 INFO L226 Difference]: Without dead ends: 358655 [2019-12-07 17:28:07,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358655 states. [2019-12-07 17:28:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358655 to 330966. [2019-12-07 17:28:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330966 states. [2019-12-07 17:28:20,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330966 states to 330966 states and 1337871 transitions. [2019-12-07 17:28:20,275 INFO L78 Accepts]: Start accepts. Automaton has 330966 states and 1337871 transitions. Word has length 23 [2019-12-07 17:28:20,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:20,275 INFO L462 AbstractCegarLoop]: Abstraction has 330966 states and 1337871 transitions. [2019-12-07 17:28:20,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 330966 states and 1337871 transitions. [2019-12-07 17:28:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 17:28:20,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:20,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:20,314 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:20,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:20,314 INFO L82 PathProgramCache]: Analyzing trace with hash 149935729, now seen corresponding path program 2 times [2019-12-07 17:28:20,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:20,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528616895] [2019-12-07 17:28:20,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:20,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528616895] [2019-12-07 17:28:20,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:20,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:20,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548407097] [2019-12-07 17:28:20,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:20,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:20,350 INFO L87 Difference]: Start difference. First operand 330966 states and 1337871 transitions. Second operand 4 states. [2019-12-07 17:28:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:20,629 INFO L93 Difference]: Finished difference Result 80241 states and 275912 transitions. [2019-12-07 17:28:20,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:20,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 17:28:20,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:20,760 INFO L225 Difference]: With dead ends: 80241 [2019-12-07 17:28:20,760 INFO L226 Difference]: Without dead ends: 80241 [2019-12-07 17:28:20,760 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 17:28:21,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80241 states. [2019-12-07 17:28:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80241 to 79305. [2019-12-07 17:28:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79305 states. [2019-12-07 17:28:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79305 states to 79305 states and 271808 transitions. [2019-12-07 17:28:22,674 INFO L78 Accepts]: Start accepts. Automaton has 79305 states and 271808 transitions. Word has length 23 [2019-12-07 17:28:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:22,674 INFO L462 AbstractCegarLoop]: Abstraction has 79305 states and 271808 transitions. [2019-12-07 17:28:22,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 79305 states and 271808 transitions. [2019-12-07 17:28:22,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:28:22,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:22,689 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:22,690 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:22,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:22,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-07 17:28:22,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:22,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970357713] [2019-12-07 17:28:22,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:22,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:22,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970357713] [2019-12-07 17:28:22,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:22,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:22,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954378323] [2019-12-07 17:28:22,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:28:22,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:22,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:28:22,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:22,762 INFO L87 Difference]: Start difference. First operand 79305 states and 271808 transitions. Second operand 6 states. [2019-12-07 17:28:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:23,466 INFO L93 Difference]: Finished difference Result 106477 states and 356639 transitions. [2019-12-07 17:28:23,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:28:23,467 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 17:28:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:23,657 INFO L225 Difference]: With dead ends: 106477 [2019-12-07 17:28:23,658 INFO L226 Difference]: Without dead ends: 106250 [2019-12-07 17:28:23,658 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 17:28:24,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106250 states. [2019-12-07 17:28:25,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106250 to 83905. [2019-12-07 17:28:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83905 states. [2019-12-07 17:28:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83905 states to 83905 states and 286522 transitions. [2019-12-07 17:28:25,813 INFO L78 Accepts]: Start accepts. Automaton has 83905 states and 286522 transitions. Word has length 24 [2019-12-07 17:28:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:25,813 INFO L462 AbstractCegarLoop]: Abstraction has 83905 states and 286522 transitions. [2019-12-07 17:28:25,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:28:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 83905 states and 286522 transitions. [2019-12-07 17:28:25,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:28:25,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:25,828 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:25,828 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:25,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:25,828 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-07 17:28:25,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:25,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038302040] [2019-12-07 17:28:25,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:25,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038302040] [2019-12-07 17:28:25,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:25,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:25,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839108864] [2019-12-07 17:28:25,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:28:25,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:25,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:28:25,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:25,880 INFO L87 Difference]: Start difference. First operand 83905 states and 286522 transitions. Second operand 6 states. [2019-12-07 17:28:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:26,768 INFO L93 Difference]: Finished difference Result 121052 states and 402830 transitions. [2019-12-07 17:28:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:28:26,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 17:28:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:26,994 INFO L225 Difference]: With dead ends: 121052 [2019-12-07 17:28:26,994 INFO L226 Difference]: Without dead ends: 120814 [2019-12-07 17:28:26,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:28:27,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120814 states. [2019-12-07 17:28:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120814 to 89401. [2019-12-07 17:28:29,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89401 states. [2019-12-07 17:28:30,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89401 states to 89401 states and 304063 transitions. [2019-12-07 17:28:30,110 INFO L78 Accepts]: Start accepts. Automaton has 89401 states and 304063 transitions. Word has length 24 [2019-12-07 17:28:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:30,110 INFO L462 AbstractCegarLoop]: Abstraction has 89401 states and 304063 transitions. [2019-12-07 17:28:30,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:28:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 89401 states and 304063 transitions. [2019-12-07 17:28:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:28:30,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:30,152 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] [2019-12-07 17:28:30,152 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:30,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1179330183, now seen corresponding path program 1 times [2019-12-07 17:28:30,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:30,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161112386] [2019-12-07 17:28:30,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:30,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161112386] [2019-12-07 17:28:30,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:30,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:30,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693105616] [2019-12-07 17:28:30,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:28:30,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:30,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:28:30,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:30,217 INFO L87 Difference]: Start difference. First operand 89401 states and 304063 transitions. Second operand 6 states. [2019-12-07 17:28:30,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:30,892 INFO L93 Difference]: Finished difference Result 116408 states and 387986 transitions. [2019-12-07 17:28:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:28:30,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 17:28:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:31,097 INFO L225 Difference]: With dead ends: 116408 [2019-12-07 17:28:31,098 INFO L226 Difference]: Without dead ends: 115657 [2019-12-07 17:28:31,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:28:31,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115657 states. [2019-12-07 17:28:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115657 to 92813. [2019-12-07 17:28:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92813 states. [2019-12-07 17:28:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92813 states to 92813 states and 315251 transitions. [2019-12-07 17:28:32,930 INFO L78 Accepts]: Start accepts. Automaton has 92813 states and 315251 transitions. Word has length 31 [2019-12-07 17:28:32,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:32,930 INFO L462 AbstractCegarLoop]: Abstraction has 92813 states and 315251 transitions. [2019-12-07 17:28:32,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:28:32,930 INFO L276 IsEmpty]: Start isEmpty. Operand 92813 states and 315251 transitions. [2019-12-07 17:28:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:28:32,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:32,983 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:32,983 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1043452722, now seen corresponding path program 1 times [2019-12-07 17:28:32,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:32,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458534172] [2019-12-07 17:28:32,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:32,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:33,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:33,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458534172] [2019-12-07 17:28:33,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:33,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:33,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079893505] [2019-12-07 17:28:33,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:33,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:33,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:33,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:33,038 INFO L87 Difference]: Start difference. First operand 92813 states and 315251 transitions. Second operand 4 states. [2019-12-07 17:28:33,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:33,490 INFO L93 Difference]: Finished difference Result 132179 states and 449949 transitions. [2019-12-07 17:28:33,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:33,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 17:28:33,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:33,581 INFO L225 Difference]: With dead ends: 132179 [2019-12-07 17:28:33,582 INFO L226 Difference]: Without dead ends: 53989 [2019-12-07 17:28:33,582 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 17:28:33,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53989 states. [2019-12-07 17:28:34,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53989 to 52210. [2019-12-07 17:28:34,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52210 states. [2019-12-07 17:28:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52210 states to 52210 states and 173970 transitions. [2019-12-07 17:28:34,732 INFO L78 Accepts]: Start accepts. Automaton has 52210 states and 173970 transitions. Word has length 33 [2019-12-07 17:28:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:34,732 INFO L462 AbstractCegarLoop]: Abstraction has 52210 states and 173970 transitions. [2019-12-07 17:28:34,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:34,732 INFO L276 IsEmpty]: Start isEmpty. Operand 52210 states and 173970 transitions. [2019-12-07 17:28:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:28:34,764 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:34,764 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] [2019-12-07 17:28:34,764 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:34,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:34,765 INFO L82 PathProgramCache]: Analyzing trace with hash -127004127, now seen corresponding path program 1 times [2019-12-07 17:28:34,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:34,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588232832] [2019-12-07 17:28:34,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:34,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588232832] [2019-12-07 17:28:34,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:34,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:28:34,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403521924] [2019-12-07 17:28:34,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:34,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:34,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:34,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:34,813 INFO L87 Difference]: Start difference. First operand 52210 states and 173970 transitions. Second operand 5 states. [2019-12-07 17:28:34,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:34,914 INFO L93 Difference]: Finished difference Result 25151 states and 84255 transitions. [2019-12-07 17:28:34,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:28:34,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 17:28:34,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:34,954 INFO L225 Difference]: With dead ends: 25151 [2019-12-07 17:28:34,955 INFO L226 Difference]: Without dead ends: 25035 [2019-12-07 17:28:34,955 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 17:28:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25035 states. [2019-12-07 17:28:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25035 to 23040. [2019-12-07 17:28:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23040 states. [2019-12-07 17:28:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23040 states to 23040 states and 78288 transitions. [2019-12-07 17:28:35,360 INFO L78 Accepts]: Start accepts. Automaton has 23040 states and 78288 transitions. Word has length 34 [2019-12-07 17:28:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:35,360 INFO L462 AbstractCegarLoop]: Abstraction has 23040 states and 78288 transitions. [2019-12-07 17:28:35,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 23040 states and 78288 transitions. [2019-12-07 17:28:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:28:35,383 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:35,384 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:35,384 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:35,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-07 17:28:35,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:35,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099585130] [2019-12-07 17:28:35,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:35,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099585130] [2019-12-07 17:28:35,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:35,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:35,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855679746] [2019-12-07 17:28:35,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:35,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:35,462 INFO L87 Difference]: Start difference. First operand 23040 states and 78288 transitions. Second operand 7 states. [2019-12-07 17:28:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:35,953 INFO L93 Difference]: Finished difference Result 30166 states and 98394 transitions. [2019-12-07 17:28:35,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:28:35,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 17:28:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:35,993 INFO L225 Difference]: With dead ends: 30166 [2019-12-07 17:28:35,994 INFO L226 Difference]: Without dead ends: 29857 [2019-12-07 17:28:35,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:28:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29857 states. [2019-12-07 17:28:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29857 to 23288. [2019-12-07 17:28:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23288 states. [2019-12-07 17:28:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23288 states to 23288 states and 79003 transitions. [2019-12-07 17:28:36,415 INFO L78 Accepts]: Start accepts. Automaton has 23288 states and 79003 transitions. Word has length 43 [2019-12-07 17:28:36,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:36,415 INFO L462 AbstractCegarLoop]: Abstraction has 23288 states and 79003 transitions. [2019-12-07 17:28:36,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:36,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23288 states and 79003 transitions. [2019-12-07 17:28:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:28:36,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:36,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:36,438 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash 2106102698, now seen corresponding path program 2 times [2019-12-07 17:28:36,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:36,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922405353] [2019-12-07 17:28:36,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:36,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922405353] [2019-12-07 17:28:36,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:36,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:36,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829822313] [2019-12-07 17:28:36,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:36,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:36,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:36,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:36,505 INFO L87 Difference]: Start difference. First operand 23288 states and 79003 transitions. Second operand 7 states. [2019-12-07 17:28:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:37,055 INFO L93 Difference]: Finished difference Result 29150 states and 95127 transitions. [2019-12-07 17:28:37,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 17:28:37,055 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 17:28:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:37,094 INFO L225 Difference]: With dead ends: 29150 [2019-12-07 17:28:37,094 INFO L226 Difference]: Without dead ends: 28588 [2019-12-07 17:28:37,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:28:37,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28588 states. [2019-12-07 17:28:37,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28588 to 21293. [2019-12-07 17:28:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21293 states. [2019-12-07 17:28:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21293 states to 21293 states and 73036 transitions. [2019-12-07 17:28:37,526 INFO L78 Accepts]: Start accepts. Automaton has 21293 states and 73036 transitions. Word has length 43 [2019-12-07 17:28:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:37,526 INFO L462 AbstractCegarLoop]: Abstraction has 21293 states and 73036 transitions. [2019-12-07 17:28:37,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:37,526 INFO L276 IsEmpty]: Start isEmpty. Operand 21293 states and 73036 transitions. [2019-12-07 17:28:37,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:28:37,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:37,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:37,547 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:37,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:37,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1441960170, now seen corresponding path program 1 times [2019-12-07 17:28:37,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:37,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924791444] [2019-12-07 17:28:37,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:37,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:37,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924791444] [2019-12-07 17:28:37,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:37,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:37,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242340906] [2019-12-07 17:28:37,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:37,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:37,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:37,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:37,592 INFO L87 Difference]: Start difference. First operand 21293 states and 73036 transitions. Second operand 5 states. [2019-12-07 17:28:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:37,974 INFO L93 Difference]: Finished difference Result 34839 states and 116928 transitions. [2019-12-07 17:28:37,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:28:37,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-07 17:28:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:38,027 INFO L225 Difference]: With dead ends: 34839 [2019-12-07 17:28:38,027 INFO L226 Difference]: Without dead ends: 34839 [2019-12-07 17:28:38,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34839 states. [2019-12-07 17:28:38,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34839 to 30526. [2019-12-07 17:28:38,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30526 states. [2019-12-07 17:28:38,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30526 states to 30526 states and 103825 transitions. [2019-12-07 17:28:38,573 INFO L78 Accepts]: Start accepts. Automaton has 30526 states and 103825 transitions. Word has length 44 [2019-12-07 17:28:38,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:38,573 INFO L462 AbstractCegarLoop]: Abstraction has 30526 states and 103825 transitions. [2019-12-07 17:28:38,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:38,573 INFO L276 IsEmpty]: Start isEmpty. Operand 30526 states and 103825 transitions. [2019-12-07 17:28:38,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 17:28:38,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:38,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:38,606 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:38,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:38,606 INFO L82 PathProgramCache]: Analyzing trace with hash 707630878, now seen corresponding path program 2 times [2019-12-07 17:28:38,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:38,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232089979] [2019-12-07 17:28:38,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:38,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232089979] [2019-12-07 17:28:38,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:38,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:28:38,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424976320] [2019-12-07 17:28:38,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:38,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:38,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:38,643 INFO L87 Difference]: Start difference. First operand 30526 states and 103825 transitions. Second operand 3 states. [2019-12-07 17:28:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:38,714 INFO L93 Difference]: Finished difference Result 21293 states and 71872 transitions. [2019-12-07 17:28:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:38,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 17:28:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:38,743 INFO L225 Difference]: With dead ends: 21293 [2019-12-07 17:28:38,743 INFO L226 Difference]: Without dead ends: 21293 [2019-12-07 17:28:38,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21293 states. [2019-12-07 17:28:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21293 to 20994. [2019-12-07 17:28:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20994 states. [2019-12-07 17:28:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20994 states to 20994 states and 71001 transitions. [2019-12-07 17:28:39,105 INFO L78 Accepts]: Start accepts. Automaton has 20994 states and 71001 transitions. Word has length 44 [2019-12-07 17:28:39,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:39,105 INFO L462 AbstractCegarLoop]: Abstraction has 20994 states and 71001 transitions. [2019-12-07 17:28:39,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:39,106 INFO L276 IsEmpty]: Start isEmpty. Operand 20994 states and 71001 transitions. [2019-12-07 17:28:39,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 17:28:39,125 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:39,125 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] [2019-12-07 17:28:39,125 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:39,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:39,125 INFO L82 PathProgramCache]: Analyzing trace with hash -696296869, now seen corresponding path program 1 times [2019-12-07 17:28:39,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:39,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122675661] [2019-12-07 17:28:39,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:39,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:39,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122675661] [2019-12-07 17:28:39,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:39,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:28:39,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572899283] [2019-12-07 17:28:39,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:28:39,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:39,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:28:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:39,173 INFO L87 Difference]: Start difference. First operand 20994 states and 71001 transitions. Second operand 6 states. [2019-12-07 17:28:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:39,256 INFO L93 Difference]: Finished difference Result 19574 states and 67613 transitions. [2019-12-07 17:28:39,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:28:39,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 17:28:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:39,280 INFO L225 Difference]: With dead ends: 19574 [2019-12-07 17:28:39,280 INFO L226 Difference]: Without dead ends: 16714 [2019-12-07 17:28:39,281 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:28:39,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16714 states. [2019-12-07 17:28:39,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16714 to 12965. [2019-12-07 17:28:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12965 states. [2019-12-07 17:28:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12965 states to 12965 states and 46584 transitions. [2019-12-07 17:28:39,596 INFO L78 Accepts]: Start accepts. Automaton has 12965 states and 46584 transitions. Word has length 45 [2019-12-07 17:28:39,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:39,596 INFO L462 AbstractCegarLoop]: Abstraction has 12965 states and 46584 transitions. [2019-12-07 17:28:39,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:28:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 12965 states and 46584 transitions. [2019-12-07 17:28:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:28:39,610 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:39,610 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:39,610 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash -205676228, now seen corresponding path program 1 times [2019-12-07 17:28:39,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:39,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807689130] [2019-12-07 17:28:39,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:39,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:39,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807689130] [2019-12-07 17:28:39,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:39,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:39,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971634413] [2019-12-07 17:28:39,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:28:39,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:39,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:28:39,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:39,639 INFO L87 Difference]: Start difference. First operand 12965 states and 46584 transitions. Second operand 3 states. [2019-12-07 17:28:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:39,719 INFO L93 Difference]: Finished difference Result 17355 states and 60743 transitions. [2019-12-07 17:28:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:39,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 17:28:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:39,745 INFO L225 Difference]: With dead ends: 17355 [2019-12-07 17:28:39,745 INFO L226 Difference]: Without dead ends: 17355 [2019-12-07 17:28:39,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:28:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17355 states. [2019-12-07 17:28:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17355 to 14352. [2019-12-07 17:28:39,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14352 states. [2019-12-07 17:28:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14352 states to 14352 states and 51353 transitions. [2019-12-07 17:28:40,019 INFO L78 Accepts]: Start accepts. Automaton has 14352 states and 51353 transitions. Word has length 59 [2019-12-07 17:28:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:40,020 INFO L462 AbstractCegarLoop]: Abstraction has 14352 states and 51353 transitions. [2019-12-07 17:28:40,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:28:40,020 INFO L276 IsEmpty]: Start isEmpty. Operand 14352 states and 51353 transitions. [2019-12-07 17:28:40,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:28:40,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:40,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:40,035 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:40,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:40,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1547307155, now seen corresponding path program 1 times [2019-12-07 17:28:40,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:40,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565670082] [2019-12-07 17:28:40,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:40,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:40,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565670082] [2019-12-07 17:28:40,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:40,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:28:40,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906376454] [2019-12-07 17:28:40,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:40,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:28:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:40,100 INFO L87 Difference]: Start difference. First operand 14352 states and 51353 transitions. Second operand 4 states. [2019-12-07 17:28:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:40,165 INFO L93 Difference]: Finished difference Result 20890 states and 72218 transitions. [2019-12-07 17:28:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:28:40,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 17:28:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:40,171 INFO L225 Difference]: With dead ends: 20890 [2019-12-07 17:28:40,172 INFO L226 Difference]: Without dead ends: 5688 [2019-12-07 17:28:40,172 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 17:28:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5688 states. [2019-12-07 17:28:40,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5688 to 5688. [2019-12-07 17:28:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5688 states. [2019-12-07 17:28:40,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 17944 transitions. [2019-12-07 17:28:40,260 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 17944 transitions. Word has length 59 [2019-12-07 17:28:40,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:40,260 INFO L462 AbstractCegarLoop]: Abstraction has 5688 states and 17944 transitions. [2019-12-07 17:28:40,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:40,261 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 17944 transitions. [2019-12-07 17:28:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:28:40,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:40,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:28:40,265 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:40,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 2 times [2019-12-07 17:28:40,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:28:40,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685905302] [2019-12-07 17:28:40,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:28:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:28:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:28:40,341 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:28:40,341 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:28:40,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21|) 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t717~0.base_21| 4) |v_#length_29|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21|) |v_ULTIMATE.start_main_~#t717~0.offset_16| 0)) |v_#memory_int_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21| 1) |v_#valid_66|) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t717~0.base_21|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 0 |v_ULTIMATE.start_main_~#t717~0.offset_16|) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_22|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t717~0.offset=|v_ULTIMATE.start_main_~#t717~0.offset_16|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_17|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t717~0.base=|v_ULTIMATE.start_main_~#t717~0.base_21|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_22|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t720~0.base, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t717~0.offset, ULTIMATE.start_main_~#t720~0.offset, ULTIMATE.start_main_~#t718~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t717~0.base, ULTIMATE.start_main_~#t718~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t719~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:28:40,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t718~0.base_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10|) |v_ULTIMATE.start_main_~#t718~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t718~0.base_10|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t718~0.base_10| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t718~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t718~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t718~0.base] because there is no mapped edge [2019-12-07 17:28:40,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t719~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t719~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t719~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t719~0.base_11| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11|) |v_ULTIMATE.start_main_~#t719~0.offset_10| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_11|, ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.base, ULTIMATE.start_main_~#t719~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:28:40,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:28:40,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11|) |v_ULTIMATE.start_main_~#t720~0.offset_10| 3)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t720~0.offset_10| 0) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t720~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t720~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t720~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t720~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t720~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:28:40,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1515646335| |P3Thread1of1ForFork0_#t~ite33_Out1515646335|)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1515646335 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1515646335 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1515646335| ~y~0_In1515646335) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out1515646335| ~y$w_buff1~0_In1515646335)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1515646335, ~y$w_buff1~0=~y$w_buff1~0_In1515646335, ~y~0=~y~0_In1515646335, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1515646335} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1515646335, ~y$w_buff1~0=~y$w_buff1~0_In1515646335, ~y~0=~y~0_In1515646335, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1515646335|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1515646335|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1515646335} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 17:28:40,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:28:40,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In822110983 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In822110983 256)))) (or (and (= ~y$w_buff0_used~0_In822110983 |P3Thread1of1ForFork0_#t~ite34_Out822110983|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out822110983|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In822110983, ~y$w_buff0_used~0=~y$w_buff0_used~0_In822110983} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In822110983, ~y$w_buff0_used~0=~y$w_buff0_used~0_In822110983, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out822110983|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 17:28:40,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In109489656 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In109489656 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In109489656 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In109489656 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite35_Out109489656| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out109489656| ~y$w_buff1_used~0_In109489656) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In109489656, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In109489656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In109489656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In109489656} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In109489656, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In109489656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In109489656, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out109489656|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In109489656} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 17:28:40,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-42858107 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-42858107 256) 0))) (or (and (= ~y$r_buff0_thd4~0_In-42858107 |P3Thread1of1ForFork0_#t~ite36_Out-42858107|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-42858107|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-42858107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-42858107} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-42858107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-42858107, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-42858107|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 17:28:40,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In878680084 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In878680084 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In878680084 256))) (.cse2 (= (mod ~y$r_buff0_thd4~0_In878680084 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out878680084|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd4~0_In878680084 |P3Thread1of1ForFork0_#t~ite37_Out878680084|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In878680084, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In878680084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In878680084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878680084} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In878680084, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In878680084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In878680084, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out878680084|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878680084} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 17:28:40,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:28:40,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In95598538 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out95598538| ~y$w_buff1~0_In95598538) (= |P1Thread1of1ForFork2_#t~ite11_In95598538| |P1Thread1of1ForFork2_#t~ite11_Out95598538|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In95598538 256)))) (or (= (mod ~y$w_buff0_used~0_In95598538 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In95598538 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In95598538 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite11_Out95598538| ~y$w_buff1~0_In95598538) (= |P1Thread1of1ForFork2_#t~ite12_Out95598538| |P1Thread1of1ForFork2_#t~ite11_Out95598538|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In95598538, ~y$w_buff1~0=~y$w_buff1~0_In95598538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In95598538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In95598538, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In95598538|, ~weak$$choice2~0=~weak$$choice2~0_In95598538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In95598538} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In95598538, ~y$w_buff1~0=~y$w_buff1~0_In95598538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In95598538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In95598538, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out95598538|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out95598538|, ~weak$$choice2~0=~weak$$choice2~0_In95598538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In95598538} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 17:28:40,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2012356454 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-2012356454| |P1Thread1of1ForFork2_#t~ite14_Out-2012356454|) (= ~y$w_buff0_used~0_In-2012356454 |P1Thread1of1ForFork2_#t~ite15_Out-2012356454|)) (and (= ~y$w_buff0_used~0_In-2012356454 |P1Thread1of1ForFork2_#t~ite14_Out-2012356454|) (= |P1Thread1of1ForFork2_#t~ite15_Out-2012356454| |P1Thread1of1ForFork2_#t~ite14_Out-2012356454|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2012356454 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2012356454 256))) (and (= (mod ~y$r_buff1_thd2~0_In-2012356454 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2012356454 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2012356454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2012356454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2012356454, ~weak$$choice2~0=~weak$$choice2~0_In-2012356454, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-2012356454|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2012356454} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2012356454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2012356454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2012356454, ~weak$$choice2~0=~weak$$choice2~0_In-2012356454, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2012356454|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-2012356454|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2012356454} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 17:28:40,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 17:28:40,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In140712418 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out140712418| |P1Thread1of1ForFork2_#t~ite23_Out140712418|) (= |P1Thread1of1ForFork2_#t~ite23_Out140712418| ~y$r_buff1_thd2~0_In140712418) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In140712418 256)))) (or (and (= (mod ~y$w_buff1_used~0_In140712418 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In140712418 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In140712418 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite23_In140712418| |P1Thread1of1ForFork2_#t~ite23_Out140712418|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out140712418| ~y$r_buff1_thd2~0_In140712418)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In140712418, ~y$w_buff0_used~0=~y$w_buff0_used~0_In140712418, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In140712418, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In140712418|, ~weak$$choice2~0=~weak$$choice2~0_In140712418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In140712418} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In140712418, ~y$w_buff0_used~0=~y$w_buff0_used~0_In140712418, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In140712418, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out140712418|, ~weak$$choice2~0=~weak$$choice2~0_In140712418, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out140712418|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In140712418} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 17:28:40,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:28:40,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-579189770 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-579189770 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-579189770|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-579189770 |P2Thread1of1ForFork3_#t~ite28_Out-579189770|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-579189770, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-579189770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-579189770, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-579189770, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-579189770|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 17:28:40,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-2086259141 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2086259141 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2086259141 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-2086259141 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-2086259141|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-2086259141| ~y$w_buff1_used~0_In-2086259141)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2086259141, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086259141, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2086259141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2086259141} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2086259141, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086259141, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2086259141, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-2086259141|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2086259141} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 17:28:40,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In-1139466565 ~y$r_buff0_thd3~0_Out-1139466565)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1139466565 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1139466565 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-1139466565) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1139466565, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1139466565} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1139466565|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1139466565, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1139466565} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 17:28:40,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-717497085 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-717497085 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-717497085 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-717497085 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-717497085| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-717497085| ~y$r_buff1_thd3~0_In-717497085)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-717497085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-717497085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-717497085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-717497085} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-717497085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-717497085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-717497085, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-717497085|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-717497085} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 17:28:40,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:28:40,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:28:40,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out1922973936| |ULTIMATE.start_main_#t~ite43_Out1922973936|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1922973936 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1922973936 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite42_Out1922973936| ~y$w_buff1~0_In1922973936)) (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out1922973936| ~y~0_In1922973936) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1922973936, ~y~0=~y~0_In1922973936, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1922973936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1922973936} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1922973936, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1922973936|, ~y~0=~y~0_In1922973936, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1922973936|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1922973936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1922973936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:28:40,355 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1725292097 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1725292097 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1725292097|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1725292097| ~y$w_buff0_used~0_In-1725292097) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1725292097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1725292097} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1725292097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1725292097, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1725292097|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:28:40,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In289384234 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In289384234 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In289384234 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In289384234 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out289384234| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out289384234| ~y$w_buff1_used~0_In289384234)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In289384234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289384234, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In289384234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289384234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In289384234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289384234, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In289384234, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out289384234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289384234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:28:40,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1809861575 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1809861575 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1809861575| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1809861575| ~y$r_buff0_thd0~0_In-1809861575)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809861575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1809861575} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809861575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1809861575, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1809861575|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:28:40,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1419614936 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1419614936 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1419614936 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1419614936 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite47_Out1419614936| ~y$r_buff1_thd0~0_In1419614936)) (and (= |ULTIMATE.start_main_#t~ite47_Out1419614936| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1419614936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1419614936, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1419614936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1419614936} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1419614936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1419614936, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1419614936|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1419614936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1419614936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 17:28:40,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:28:40,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:28:40 BasicIcfg [2019-12-07 17:28:40,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:28:40,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:28:40,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:28:40,413 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:28:40,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:43" (3/4) ... [2019-12-07 17:28:40,414 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:28:40,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21|) 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t717~0.base_21| 4) |v_#length_29|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t717~0.base_21|) |v_ULTIMATE.start_main_~#t717~0.offset_16| 0)) |v_#memory_int_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t717~0.base_21| 1) |v_#valid_66|) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t717~0.base_21|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= 0 |v_ULTIMATE.start_main_~#t717~0.offset_16|) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_17|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_22|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t717~0.offset=|v_ULTIMATE.start_main_~#t717~0.offset_16|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_17|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_21|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t717~0.base=|v_ULTIMATE.start_main_~#t717~0.base_21|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_17|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_22|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t720~0.base, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t717~0.offset, ULTIMATE.start_main_~#t720~0.offset, ULTIMATE.start_main_~#t718~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t717~0.base, ULTIMATE.start_main_~#t718~0.offset, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t719~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 17:28:40,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t718~0.base_10|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t718~0.base_10|) |v_ULTIMATE.start_main_~#t718~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t718~0.base_10|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t718~0.base_10| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t718~0.offset_10|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t718~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t718~0.offset=|v_ULTIMATE.start_main_~#t718~0.offset_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t718~0.base=|v_ULTIMATE.start_main_~#t718~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t718~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t718~0.base] because there is no mapped edge [2019-12-07 17:28:40,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t719~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t719~0.offset_10|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t719~0.base_11| 4)) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11| 1)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t719~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t719~0.base_11| 0)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t719~0.base_11|) |v_ULTIMATE.start_main_~#t719~0.offset_10| 2)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t719~0.base=|v_ULTIMATE.start_main_~#t719~0.base_11|, ULTIMATE.start_main_~#t719~0.offset=|v_ULTIMATE.start_main_~#t719~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t719~0.base, ULTIMATE.start_main_~#t719~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 17:28:40,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 17:28:40,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t720~0.base_11|) |v_ULTIMATE.start_main_~#t720~0.offset_10| 3)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t720~0.offset_10| 0) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t720~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t720~0.base_11|)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t720~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t720~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t720~0.base=|v_ULTIMATE.start_main_~#t720~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t720~0.offset=|v_ULTIMATE.start_main_~#t720~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t720~0.base, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t720~0.offset, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:28:40,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1515646335| |P3Thread1of1ForFork0_#t~ite33_Out1515646335|)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In1515646335 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1515646335 256) 0))) (or (and .cse0 (= |P3Thread1of1ForFork0_#t~ite32_Out1515646335| ~y~0_In1515646335) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out1515646335| ~y$w_buff1~0_In1515646335)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1515646335, ~y$w_buff1~0=~y$w_buff1~0_In1515646335, ~y~0=~y~0_In1515646335, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1515646335} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1515646335, ~y$w_buff1~0=~y$w_buff1~0_In1515646335, ~y~0=~y~0_In1515646335, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1515646335|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1515646335|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1515646335} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 17:28:40,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 17:28:40,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In822110983 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In822110983 256)))) (or (and (= ~y$w_buff0_used~0_In822110983 |P3Thread1of1ForFork0_#t~ite34_Out822110983|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out822110983|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In822110983, ~y$w_buff0_used~0=~y$w_buff0_used~0_In822110983} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In822110983, ~y$w_buff0_used~0=~y$w_buff0_used~0_In822110983, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out822110983|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 17:28:40,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In109489656 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In109489656 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In109489656 256))) (.cse3 (= (mod ~y$r_buff0_thd4~0_In109489656 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork0_#t~ite35_Out109489656| 0)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out109489656| ~y$w_buff1_used~0_In109489656) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In109489656, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In109489656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In109489656, ~y$w_buff1_used~0=~y$w_buff1_used~0_In109489656} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In109489656, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In109489656, ~y$w_buff0_used~0=~y$w_buff0_used~0_In109489656, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out109489656|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In109489656} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 17:28:40,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-42858107 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-42858107 256) 0))) (or (and (= ~y$r_buff0_thd4~0_In-42858107 |P3Thread1of1ForFork0_#t~ite36_Out-42858107|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-42858107|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-42858107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-42858107} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-42858107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-42858107, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-42858107|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 17:28:40,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd4~0_In878680084 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In878680084 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In878680084 256))) (.cse2 (= (mod ~y$r_buff0_thd4~0_In878680084 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out878680084|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$r_buff1_thd4~0_In878680084 |P3Thread1of1ForFork0_#t~ite37_Out878680084|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In878680084, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In878680084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In878680084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878680084} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In878680084, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In878680084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In878680084, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out878680084|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In878680084} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 17:28:40,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 17:28:40,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In95598538 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out95598538| ~y$w_buff1~0_In95598538) (= |P1Thread1of1ForFork2_#t~ite11_In95598538| |P1Thread1of1ForFork2_#t~ite11_Out95598538|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In95598538 256)))) (or (= (mod ~y$w_buff0_used~0_In95598538 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In95598538 256) 0)) (and (= (mod ~y$r_buff1_thd2~0_In95598538 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite11_Out95598538| ~y$w_buff1~0_In95598538) (= |P1Thread1of1ForFork2_#t~ite12_Out95598538| |P1Thread1of1ForFork2_#t~ite11_Out95598538|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In95598538, ~y$w_buff1~0=~y$w_buff1~0_In95598538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In95598538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In95598538, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In95598538|, ~weak$$choice2~0=~weak$$choice2~0_In95598538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In95598538} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In95598538, ~y$w_buff1~0=~y$w_buff1~0_In95598538, ~y$w_buff0_used~0=~y$w_buff0_used~0_In95598538, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In95598538, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out95598538|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out95598538|, ~weak$$choice2~0=~weak$$choice2~0_In95598538, ~y$w_buff1_used~0=~y$w_buff1_used~0_In95598538} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 17:28:40,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2012356454 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-2012356454| |P1Thread1of1ForFork2_#t~ite14_Out-2012356454|) (= ~y$w_buff0_used~0_In-2012356454 |P1Thread1of1ForFork2_#t~ite15_Out-2012356454|)) (and (= ~y$w_buff0_used~0_In-2012356454 |P1Thread1of1ForFork2_#t~ite14_Out-2012356454|) (= |P1Thread1of1ForFork2_#t~ite15_Out-2012356454| |P1Thread1of1ForFork2_#t~ite14_Out-2012356454|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2012356454 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2012356454 256))) (and (= (mod ~y$r_buff1_thd2~0_In-2012356454 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-2012356454 256))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2012356454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2012356454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2012356454, ~weak$$choice2~0=~weak$$choice2~0_In-2012356454, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-2012356454|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2012356454} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2012356454, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2012356454, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2012356454, ~weak$$choice2~0=~weak$$choice2~0_In-2012356454, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2012356454|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-2012356454|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2012356454} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 17:28:40,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 17:28:40,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In140712418 256)))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out140712418| |P1Thread1of1ForFork2_#t~ite23_Out140712418|) (= |P1Thread1of1ForFork2_#t~ite23_Out140712418| ~y$r_buff1_thd2~0_In140712418) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In140712418 256)))) (or (and (= (mod ~y$w_buff1_used~0_In140712418 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In140712418 256) 0) (and (= (mod ~y$r_buff1_thd2~0_In140712418 256) 0) .cse1)))) (and (= |P1Thread1of1ForFork2_#t~ite23_In140712418| |P1Thread1of1ForFork2_#t~ite23_Out140712418|) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out140712418| ~y$r_buff1_thd2~0_In140712418)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In140712418, ~y$w_buff0_used~0=~y$w_buff0_used~0_In140712418, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In140712418, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In140712418|, ~weak$$choice2~0=~weak$$choice2~0_In140712418, ~y$w_buff1_used~0=~y$w_buff1_used~0_In140712418} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In140712418, ~y$w_buff0_used~0=~y$w_buff0_used~0_In140712418, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In140712418, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out140712418|, ~weak$$choice2~0=~weak$$choice2~0_In140712418, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out140712418|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In140712418} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 17:28:40,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:28:40,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-579189770 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-579189770 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-579189770|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-579189770 |P2Thread1of1ForFork3_#t~ite28_Out-579189770|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-579189770, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-579189770} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-579189770, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-579189770, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-579189770|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 17:28:40,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-2086259141 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2086259141 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-2086259141 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-2086259141 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-2086259141|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite29_Out-2086259141| ~y$w_buff1_used~0_In-2086259141)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2086259141, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086259141, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2086259141, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2086259141} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2086259141, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2086259141, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2086259141, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-2086259141|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2086259141} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 17:28:40,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse1 (= ~y$r_buff0_thd3~0_In-1139466565 ~y$r_buff0_thd3~0_Out-1139466565)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1139466565 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1139466565 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= 0 ~y$r_buff0_thd3~0_Out-1139466565) (not .cse2) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1139466565, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1139466565} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-1139466565|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1139466565, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1139466565} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 17:28:40,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-717497085 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-717497085 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-717497085 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-717497085 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-717497085| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-717497085| ~y$r_buff1_thd3~0_In-717497085)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-717497085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-717497085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-717497085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-717497085} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-717497085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-717497085, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-717497085, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-717497085|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-717497085} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 17:28:40,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:28:40,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:28:40,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite42_Out1922973936| |ULTIMATE.start_main_#t~ite43_Out1922973936|)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In1922973936 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1922973936 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite42_Out1922973936| ~y$w_buff1~0_In1922973936)) (and .cse0 (= |ULTIMATE.start_main_#t~ite42_Out1922973936| ~y~0_In1922973936) (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1922973936, ~y~0=~y~0_In1922973936, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1922973936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1922973936} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1922973936, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1922973936|, ~y~0=~y~0_In1922973936, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1922973936|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1922973936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1922973936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 17:28:40,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1725292097 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1725292097 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out-1725292097|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1725292097| ~y$w_buff0_used~0_In-1725292097) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1725292097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1725292097} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1725292097, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1725292097, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1725292097|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 17:28:40,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In289384234 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In289384234 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In289384234 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In289384234 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out289384234| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite45_Out289384234| ~y$w_buff1_used~0_In289384234)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In289384234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289384234, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In289384234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289384234} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In289384234, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289384234, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In289384234, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out289384234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In289384234} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 17:28:40,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1809861575 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1809861575 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-1809861575| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite46_Out-1809861575| ~y$r_buff0_thd0~0_In-1809861575)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809861575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1809861575} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1809861575, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1809861575, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1809861575|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 17:28:40,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1419614936 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1419614936 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1419614936 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1419614936 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite47_Out1419614936| ~y$r_buff1_thd0~0_In1419614936)) (and (= |ULTIMATE.start_main_#t~ite47_Out1419614936| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1419614936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1419614936, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1419614936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1419614936} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1419614936, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1419614936, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1419614936|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1419614936, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1419614936} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 17:28:40,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:28:40,479 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a4c47f25-a87f-464c-b36e-cabaa2158512/bin/uautomizer/witness.graphml [2019-12-07 17:28:40,479 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:28:40,480 INFO L168 Benchmark]: Toolchain (without parser) took 237676.80 ms. Allocated memory was 1.0 GB in the beginning and 8.6 GB in the end (delta: 7.6 GB). Free memory was 943.0 MB in the beginning and 6.6 GB in the end (delta: -5.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-12-07 17:28:40,480 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:28:40,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 462.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:40,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.69 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: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:40,481 INFO L168 Benchmark]: Boogie Preprocessor took 25.54 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 17:28:40,481 INFO L168 Benchmark]: RCFGBuilder took 401.90 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.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:40,482 INFO L168 Benchmark]: TraceAbstraction took 236678.10 ms. Allocated memory was 1.2 GB in the beginning and 8.6 GB in the end (delta: 7.4 GB). Free memory was 1.0 GB in the beginning and 6.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-12-07 17:28:40,482 INFO L168 Benchmark]: Witness Printer took 66.87 ms. Allocated memory is still 8.6 GB. Free memory was 6.7 GB in the beginning and 6.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:28:40,483 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 462.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -166.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.69 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: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.54 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 401.90 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.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 236678.10 ms. Allocated memory was 1.2 GB in the beginning and 8.6 GB in the end (delta: 7.4 GB). Free memory was 1.0 GB in the beginning and 6.7 GB in the end (delta: -5.6 GB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. * Witness Printer took 66.87 ms. Allocated memory is still 8.6 GB. Free memory was 6.7 GB in the beginning and 6.6 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t719, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t720, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 236.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 40.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3950 SDtfs, 4401 SDslu, 6808 SDs, 0 SdLazy, 3656 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344058occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 154.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 494540 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 4.6s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 748 NumberOfCodeBlocks, 748 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 155222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...