./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/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 1ff25ff6f7779916b21d6f014e95708011019eb9 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:38:57,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:38:57,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:38:57,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:38:57,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:38:57,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:38:57,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:38:57,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:38:57,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:38:57,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:38:57,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:38:57,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:38:57,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:38:57,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:38:57,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:38:57,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:38:57,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:38:57,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:38:57,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:38:57,175 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:38:57,176 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:38:57,177 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:38:57,178 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:38:57,178 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:38:57,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:38:57,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:38:57,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:38:57,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:38:57,181 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:38:57,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:38:57,182 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:38:57,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:38:57,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:38:57,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:38:57,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:38:57,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:38:57,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:38:57,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:38:57,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:38:57,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:38:57,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:38:57,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:38:57,195 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:38:57,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:38:57,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:38:57,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:38:57,196 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:38:57,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:38:57,196 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:38:57,197 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:38:57,197 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:38:57,197 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:38:57,197 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:38:57,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:38:57,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:38:57,197 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:38:57,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:38:57,198 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:38:57,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:38:57,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:38:57,198 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:38:57,198 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:38:57,198 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:38:57,198 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:38:57,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:38:57,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:38:57,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:38:57,199 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:38:57,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:38:57,199 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:38:57,199 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:38:57,199 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_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/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 -> 1ff25ff6f7779916b21d6f014e95708011019eb9 [2019-12-07 13:38:57,297 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:38:57,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:38:57,307 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:38:57,308 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:38:57,308 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:38:57,309 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i [2019-12-07 13:38:57,350 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/data/08fef32d2/cd9423a1a6ec40eca39c549955607c5d/FLAGf0dbc9c64 [2019-12-07 13:38:57,787 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:38:57,788 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/sv-benchmarks/c/pthread-wmm/mix022_rmo.oepc.i [2019-12-07 13:38:57,797 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/data/08fef32d2/cd9423a1a6ec40eca39c549955607c5d/FLAGf0dbc9c64 [2019-12-07 13:38:58,143 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/data/08fef32d2/cd9423a1a6ec40eca39c549955607c5d [2019-12-07 13:38:58,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:38:58,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:38:58,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:38:58,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:38:58,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:38:58,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77919ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58, skipping insertion in model container [2019-12-07 13:38:58,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:38:58,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:38:58,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:38:58,458 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:38:58,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:38:58,560 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:38:58,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58 WrapperNode [2019-12-07 13:38:58,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:38:58,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:38:58,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:38:58,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:38:58,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:38:58,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:38:58,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:38:58,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:38:58,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... [2019-12-07 13:38:58,635 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:38:58,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:38:58,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:38:58,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:38:58,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/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 13:38:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:38:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:38:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:38:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:38:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:38:58,675 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:38:58,675 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:38:58,676 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:38:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:38:58,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:38:58,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:38:58,677 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 13:38:59,012 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:38:59,012 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:38:59,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:38:59 BoogieIcfgContainer [2019-12-07 13:38:59,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:38:59,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:38:59,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:38:59,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:38:59,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:38:58" (1/3) ... [2019-12-07 13:38:59,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d45e143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:38:59, skipping insertion in model container [2019-12-07 13:38:59,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:38:58" (2/3) ... [2019-12-07 13:38:59,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d45e143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:38:59, skipping insertion in model container [2019-12-07 13:38:59,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:38:59" (3/3) ... [2019-12-07 13:38:59,018 INFO L109 eAbstractionObserver]: Analyzing ICFG mix022_rmo.oepc.i [2019-12-07 13:38:59,024 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:38:59,024 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:38:59,029 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:38:59,030 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:38:59,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,055 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,055 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,056 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,056 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,062 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,063 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,063 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,064 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,065 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,066 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,067 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:38:59,097 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 13:38:59,111 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:38:59,111 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:38:59,111 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:38:59,111 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:38:59,111 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:38:59,112 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:38:59,112 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:38:59,112 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:38:59,122 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-07 13:38:59,123 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 13:38:59,179 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 13:38:59,179 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:38:59,188 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:38:59,202 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-07 13:38:59,230 INFO L134 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-07 13:38:59,231 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:38:59,234 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 562 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-07 13:38:59,245 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-07 13:38:59,246 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:39:02,027 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-07 13:39:02,110 INFO L206 etLargeBlockEncoding]: Checked pairs total: 47763 [2019-12-07 13:39:02,110 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-07 13:39:02,112 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 87 transitions [2019-12-07 13:39:02,417 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-07 13:39:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-07 13:39:02,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:39:02,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:02,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:39:02,423 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:02,427 INFO L82 PathProgramCache]: Analyzing trace with hash 789332, now seen corresponding path program 1 times [2019-12-07 13:39:02,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:02,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201421326] [2019-12-07 13:39:02,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:02,566 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 13:39:02,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201421326] [2019-12-07 13:39:02,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:02,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:39:02,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759205258] [2019-12-07 13:39:02,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:39:02,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:02,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:39:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:39:02,588 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-07 13:39:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:02,761 INFO L93 Difference]: Finished difference Result 8468 states and 27386 transitions. [2019-12-07 13:39:02,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:39:02,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:39:02,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:02,820 INFO L225 Difference]: With dead ends: 8468 [2019-12-07 13:39:02,820 INFO L226 Difference]: Without dead ends: 7976 [2019-12-07 13:39:02,821 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 13:39:02,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7976 states. [2019-12-07 13:39:03,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7976 to 7976. [2019-12-07 13:39:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7976 states. [2019-12-07 13:39:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7976 states to 7976 states and 25749 transitions. [2019-12-07 13:39:03,092 INFO L78 Accepts]: Start accepts. Automaton has 7976 states and 25749 transitions. Word has length 3 [2019-12-07 13:39:03,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:03,092 INFO L462 AbstractCegarLoop]: Abstraction has 7976 states and 25749 transitions. [2019-12-07 13:39:03,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:39:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7976 states and 25749 transitions. [2019-12-07 13:39:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:39:03,095 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:03,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:03,095 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -374477309, now seen corresponding path program 1 times [2019-12-07 13:39:03,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:03,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595435600] [2019-12-07 13:39:03,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:03,162 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 13:39:03,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595435600] [2019-12-07 13:39:03,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:03,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:39:03,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230991935] [2019-12-07 13:39:03,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:39:03,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:03,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:39:03,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:39:03,164 INFO L87 Difference]: Start difference. First operand 7976 states and 25749 transitions. Second operand 4 states. [2019-12-07 13:39:03,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:03,209 INFO L93 Difference]: Finished difference Result 1834 states and 4623 transitions. [2019-12-07 13:39:03,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:39:03,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:39:03,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:03,215 INFO L225 Difference]: With dead ends: 1834 [2019-12-07 13:39:03,216 INFO L226 Difference]: Without dead ends: 1342 [2019-12-07 13:39:03,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:39:03,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2019-12-07 13:39:03,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1342. [2019-12-07 13:39:03,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1342 states. [2019-12-07 13:39:03,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1342 states to 1342 states and 3045 transitions. [2019-12-07 13:39:03,240 INFO L78 Accepts]: Start accepts. Automaton has 1342 states and 3045 transitions. Word has length 11 [2019-12-07 13:39:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:03,240 INFO L462 AbstractCegarLoop]: Abstraction has 1342 states and 3045 transitions. [2019-12-07 13:39:03,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:39:03,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1342 states and 3045 transitions. [2019-12-07 13:39:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:39:03,241 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:03,241 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:03,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:03,241 INFO L82 PathProgramCache]: Analyzing trace with hash 56348668, now seen corresponding path program 1 times [2019-12-07 13:39:03,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:03,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342345099] [2019-12-07 13:39:03,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:03,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:03,308 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 13:39:03,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342345099] [2019-12-07 13:39:03,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:03,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:39:03,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46264365] [2019-12-07 13:39:03,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:39:03,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:03,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:39:03,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:39:03,310 INFO L87 Difference]: Start difference. First operand 1342 states and 3045 transitions. Second operand 4 states. [2019-12-07 13:39:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:03,439 INFO L93 Difference]: Finished difference Result 1673 states and 3729 transitions. [2019-12-07 13:39:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:39:03,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:39:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:03,447 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 13:39:03,447 INFO L226 Difference]: Without dead ends: 1673 [2019-12-07 13:39:03,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:39:03,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-12-07 13:39:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1609. [2019-12-07 13:39:03,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-07 13:39:03,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3605 transitions. [2019-12-07 13:39:03,478 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3605 transitions. Word has length 14 [2019-12-07 13:39:03,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:03,479 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3605 transitions. [2019-12-07 13:39:03,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:39:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3605 transitions. [2019-12-07 13:39:03,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:39:03,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:03,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:03,482 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:03,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:03,482 INFO L82 PathProgramCache]: Analyzing trace with hash -139254967, now seen corresponding path program 1 times [2019-12-07 13:39:03,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:03,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854766204] [2019-12-07 13:39:03,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:03,578 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 13:39:03,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854766204] [2019-12-07 13:39:03,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:03,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:39:03,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901291938] [2019-12-07 13:39:03,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:39:03,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:03,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:39:03,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:39:03,580 INFO L87 Difference]: Start difference. First operand 1609 states and 3605 transitions. Second operand 6 states. [2019-12-07 13:39:04,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:04,003 INFO L93 Difference]: Finished difference Result 4481 states and 9905 transitions. [2019-12-07 13:39:04,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:39:04,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 13:39:04,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:04,028 INFO L225 Difference]: With dead ends: 4481 [2019-12-07 13:39:04,029 INFO L226 Difference]: Without dead ends: 4446 [2019-12-07 13:39:04,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:39:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4446 states. [2019-12-07 13:39:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4446 to 2169. [2019-12-07 13:39:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2169 states. [2019-12-07 13:39:04,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 4909 transitions. [2019-12-07 13:39:04,074 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 4909 transitions. Word has length 25 [2019-12-07 13:39:04,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:04,075 INFO L462 AbstractCegarLoop]: Abstraction has 2169 states and 4909 transitions. [2019-12-07 13:39:04,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:39:04,075 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 4909 transitions. [2019-12-07 13:39:04,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:39:04,076 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:04,077 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:04,077 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:04,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:04,077 INFO L82 PathProgramCache]: Analyzing trace with hash -662536504, now seen corresponding path program 1 times [2019-12-07 13:39:04,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:04,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939303040] [2019-12-07 13:39:04,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:04,149 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 13:39:04,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939303040] [2019-12-07 13:39:04,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:04,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:39:04,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115400690] [2019-12-07 13:39:04,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:39:04,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:04,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:39:04,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:39:04,151 INFO L87 Difference]: Start difference. First operand 2169 states and 4909 transitions. Second operand 5 states. [2019-12-07 13:39:04,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:04,432 INFO L93 Difference]: Finished difference Result 3139 states and 6955 transitions. [2019-12-07 13:39:04,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:39:04,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 13:39:04,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:04,458 INFO L225 Difference]: With dead ends: 3139 [2019-12-07 13:39:04,458 INFO L226 Difference]: Without dead ends: 3139 [2019-12-07 13:39:04,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:39:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2019-12-07 13:39:04,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2639. [2019-12-07 13:39:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-12-07 13:39:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 5924 transitions. [2019-12-07 13:39:04,501 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 5924 transitions. Word has length 26 [2019-12-07 13:39:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:04,501 INFO L462 AbstractCegarLoop]: Abstraction has 2639 states and 5924 transitions. [2019-12-07 13:39:04,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:39:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 5924 transitions. [2019-12-07 13:39:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 13:39:04,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:04,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:04,503 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:04,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2133801578, now seen corresponding path program 1 times [2019-12-07 13:39:04,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:04,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706984521] [2019-12-07 13:39:04,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:04,573 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 13:39:04,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706984521] [2019-12-07 13:39:04,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:04,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:39:04,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162774946] [2019-12-07 13:39:04,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:39:04,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:04,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:39:04,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:39:04,574 INFO L87 Difference]: Start difference. First operand 2639 states and 5924 transitions. Second operand 6 states. [2019-12-07 13:39:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:04,637 INFO L93 Difference]: Finished difference Result 3831 states and 8386 transitions. [2019-12-07 13:39:04,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:39:04,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-07 13:39:04,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:04,644 INFO L225 Difference]: With dead ends: 3831 [2019-12-07 13:39:04,644 INFO L226 Difference]: Without dead ends: 3831 [2019-12-07 13:39:04,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:39:04,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2019-12-07 13:39:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 2759. [2019-12-07 13:39:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2759 states. [2019-12-07 13:39:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2759 states to 2759 states and 6106 transitions. [2019-12-07 13:39:04,685 INFO L78 Accepts]: Start accepts. Automaton has 2759 states and 6106 transitions. Word has length 26 [2019-12-07 13:39:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:04,686 INFO L462 AbstractCegarLoop]: Abstraction has 2759 states and 6106 transitions. [2019-12-07 13:39:04,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:39:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2759 states and 6106 transitions. [2019-12-07 13:39:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:39:04,689 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:04,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, 1, 1, 1] [2019-12-07 13:39:04,689 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:04,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:04,690 INFO L82 PathProgramCache]: Analyzing trace with hash -312964189, now seen corresponding path program 1 times [2019-12-07 13:39:04,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:04,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259861958] [2019-12-07 13:39:04,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:04,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:04,741 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 13:39:04,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259861958] [2019-12-07 13:39:04,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:04,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:39:04,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541139252] [2019-12-07 13:39:04,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:39:04,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:04,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:39:04,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:39:04,743 INFO L87 Difference]: Start difference. First operand 2759 states and 6106 transitions. Second operand 5 states. [2019-12-07 13:39:04,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:04,778 INFO L93 Difference]: Finished difference Result 1727 states and 3661 transitions. [2019-12-07 13:39:04,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:39:04,779 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 13:39:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:04,782 INFO L225 Difference]: With dead ends: 1727 [2019-12-07 13:39:04,782 INFO L226 Difference]: Without dead ends: 1579 [2019-12-07 13:39:04,782 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 13:39:04,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2019-12-07 13:39:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1476. [2019-12-07 13:39:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1476 states. [2019-12-07 13:39:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1476 states to 1476 states and 3158 transitions. [2019-12-07 13:39:04,808 INFO L78 Accepts]: Start accepts. Automaton has 1476 states and 3158 transitions. Word has length 27 [2019-12-07 13:39:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:04,808 INFO L462 AbstractCegarLoop]: Abstraction has 1476 states and 3158 transitions. [2019-12-07 13:39:04,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:39:04,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1476 states and 3158 transitions. [2019-12-07 13:39:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:39:04,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:04,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:04,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:04,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1981838884, now seen corresponding path program 1 times [2019-12-07 13:39:04,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:04,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272094477] [2019-12-07 13:39:04,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:04,890 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 13:39:04,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272094477] [2019-12-07 13:39:04,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:04,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:39:04,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264493039] [2019-12-07 13:39:04,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:39:04,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:04,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:39:04,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:39:04,891 INFO L87 Difference]: Start difference. First operand 1476 states and 3158 transitions. Second operand 6 states. [2019-12-07 13:39:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:05,180 INFO L93 Difference]: Finished difference Result 2753 states and 5639 transitions. [2019-12-07 13:39:05,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 13:39:05,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 13:39:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:05,184 INFO L225 Difference]: With dead ends: 2753 [2019-12-07 13:39:05,184 INFO L226 Difference]: Without dead ends: 2724 [2019-12-07 13:39:05,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:39:05,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2724 states. [2019-12-07 13:39:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2724 to 1453. [2019-12-07 13:39:05,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1453 states. [2019-12-07 13:39:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 3126 transitions. [2019-12-07 13:39:05,210 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 3126 transitions. Word has length 27 [2019-12-07 13:39:05,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:05,210 INFO L462 AbstractCegarLoop]: Abstraction has 1453 states and 3126 transitions. [2019-12-07 13:39:05,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:39:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 3126 transitions. [2019-12-07 13:39:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:39:05,213 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:05,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:05,213 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:05,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:05,214 INFO L82 PathProgramCache]: Analyzing trace with hash 62245946, now seen corresponding path program 1 times [2019-12-07 13:39:05,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:05,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438252864] [2019-12-07 13:39:05,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:05,315 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 13:39:05,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438252864] [2019-12-07 13:39:05,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:05,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:39:05,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519077198] [2019-12-07 13:39:05,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:39:05,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:05,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:39:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:39:05,316 INFO L87 Difference]: Start difference. First operand 1453 states and 3126 transitions. Second operand 7 states. [2019-12-07 13:39:06,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:06,031 INFO L93 Difference]: Finished difference Result 2808 states and 5794 transitions. [2019-12-07 13:39:06,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:39:06,031 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-07 13:39:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:06,035 INFO L225 Difference]: With dead ends: 2808 [2019-12-07 13:39:06,035 INFO L226 Difference]: Without dead ends: 2808 [2019-12-07 13:39:06,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:39:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-12-07 13:39:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 1495. [2019-12-07 13:39:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2019-12-07 13:39:06,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 3220 transitions. [2019-12-07 13:39:06,060 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 3220 transitions. Word has length 51 [2019-12-07 13:39:06,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:06,060 INFO L462 AbstractCegarLoop]: Abstraction has 1495 states and 3220 transitions. [2019-12-07 13:39:06,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:39:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 3220 transitions. [2019-12-07 13:39:06,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:39:06,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:06,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:06,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:06,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1305614862, now seen corresponding path program 2 times [2019-12-07 13:39:06,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:06,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818154155] [2019-12-07 13:39:06,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:06,128 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 13:39:06,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818154155] [2019-12-07 13:39:06,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:06,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:39:06,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330043342] [2019-12-07 13:39:06,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:39:06,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:06,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:39:06,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:39:06,130 INFO L87 Difference]: Start difference. First operand 1495 states and 3220 transitions. Second operand 5 states. [2019-12-07 13:39:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:06,269 INFO L93 Difference]: Finished difference Result 1633 states and 3470 transitions. [2019-12-07 13:39:06,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:39:06,269 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-07 13:39:06,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:06,272 INFO L225 Difference]: With dead ends: 1633 [2019-12-07 13:39:06,272 INFO L226 Difference]: Without dead ends: 1633 [2019-12-07 13:39:06,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:39:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2019-12-07 13:39:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1503. [2019-12-07 13:39:06,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-07 13:39:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 3236 transitions. [2019-12-07 13:39:06,298 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 3236 transitions. Word has length 51 [2019-12-07 13:39:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:06,299 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 3236 transitions. [2019-12-07 13:39:06,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:39:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 3236 transitions. [2019-12-07 13:39:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 13:39:06,301 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:06,301 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:06,302 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:06,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:06,302 INFO L82 PathProgramCache]: Analyzing trace with hash 851846938, now seen corresponding path program 3 times [2019-12-07 13:39:06,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:06,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593190320] [2019-12-07 13:39:06,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:06,363 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 13:39:06,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593190320] [2019-12-07 13:39:06,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:06,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:39:06,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045264963] [2019-12-07 13:39:06,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:39:06,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:06,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:39:06,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:39:06,364 INFO L87 Difference]: Start difference. First operand 1503 states and 3236 transitions. Second operand 3 states. [2019-12-07 13:39:06,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:06,376 INFO L93 Difference]: Finished difference Result 1502 states and 3234 transitions. [2019-12-07 13:39:06,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:39:06,376 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-07 13:39:06,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:06,378 INFO L225 Difference]: With dead ends: 1502 [2019-12-07 13:39:06,379 INFO L226 Difference]: Without dead ends: 1502 [2019-12-07 13:39:06,379 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 13:39:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-12-07 13:39:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1257. [2019-12-07 13:39:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1257 states. [2019-12-07 13:39:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 2757 transitions. [2019-12-07 13:39:06,395 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 2757 transitions. Word has length 51 [2019-12-07 13:39:06,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:06,395 INFO L462 AbstractCegarLoop]: Abstraction has 1257 states and 2757 transitions. [2019-12-07 13:39:06,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:39:06,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 2757 transitions. [2019-12-07 13:39:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:39:06,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:06,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:06,397 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:06,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash -126849823, now seen corresponding path program 1 times [2019-12-07 13:39:06,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:06,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514299693] [2019-12-07 13:39:06,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:06,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:39:06,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514299693] [2019-12-07 13:39:06,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:06,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:39:06,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260419750] [2019-12-07 13:39:06,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:39:06,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:06,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:39:06,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:39:06,455 INFO L87 Difference]: Start difference. First operand 1257 states and 2757 transitions. Second operand 4 states. [2019-12-07 13:39:06,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:06,469 INFO L93 Difference]: Finished difference Result 2227 states and 4881 transitions. [2019-12-07 13:39:06,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:39:06,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-07 13:39:06,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:06,471 INFO L225 Difference]: With dead ends: 2227 [2019-12-07 13:39:06,471 INFO L226 Difference]: Without dead ends: 1039 [2019-12-07 13:39:06,471 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 13:39:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2019-12-07 13:39:06,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 1039. [2019-12-07 13:39:06,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-07 13:39:06,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2254 transitions. [2019-12-07 13:39:06,481 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2254 transitions. Word has length 52 [2019-12-07 13:39:06,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:06,481 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2254 transitions. [2019-12-07 13:39:06,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:39:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2254 transitions. [2019-12-07 13:39:06,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:39:06,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:06,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:06,483 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:06,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:06,483 INFO L82 PathProgramCache]: Analyzing trace with hash 2075063759, now seen corresponding path program 2 times [2019-12-07 13:39:06,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:06,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619852735] [2019-12-07 13:39:06,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:06,539 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 13:39:06,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619852735] [2019-12-07 13:39:06,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:06,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:39:06,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554610302] [2019-12-07 13:39:06,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:39:06,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:06,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:39:06,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:39:06,540 INFO L87 Difference]: Start difference. First operand 1039 states and 2254 transitions. Second operand 7 states. [2019-12-07 13:39:06,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:06,659 INFO L93 Difference]: Finished difference Result 1785 states and 3788 transitions. [2019-12-07 13:39:06,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:39:06,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-07 13:39:06,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:06,662 INFO L225 Difference]: With dead ends: 1785 [2019-12-07 13:39:06,662 INFO L226 Difference]: Without dead ends: 1200 [2019-12-07 13:39:06,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:39:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2019-12-07 13:39:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1044. [2019-12-07 13:39:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-12-07 13:39:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 2239 transitions. [2019-12-07 13:39:06,673 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 2239 transitions. Word has length 52 [2019-12-07 13:39:06,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:06,673 INFO L462 AbstractCegarLoop]: Abstraction has 1044 states and 2239 transitions. [2019-12-07 13:39:06,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:39:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 2239 transitions. [2019-12-07 13:39:06,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 13:39:06,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:06,675 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:39:06,675 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:06,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:06,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2078058895, now seen corresponding path program 3 times [2019-12-07 13:39:06,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:06,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531229710] [2019-12-07 13:39:06,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:39:06,745 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 13:39:06,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531229710] [2019-12-07 13:39:06,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:39:06,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:39:06,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694325878] [2019-12-07 13:39:06,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:39:06,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:39:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:39:06,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:39:06,747 INFO L87 Difference]: Start difference. First operand 1044 states and 2239 transitions. Second operand 5 states. [2019-12-07 13:39:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:39:06,797 INFO L93 Difference]: Finished difference Result 1184 states and 2515 transitions. [2019-12-07 13:39:06,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:39:06,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-07 13:39:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:39:06,799 INFO L225 Difference]: With dead ends: 1184 [2019-12-07 13:39:06,799 INFO L226 Difference]: Without dead ends: 1184 [2019-12-07 13:39:06,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 13:39:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2019-12-07 13:39:06,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1000. [2019-12-07 13:39:06,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-12-07 13:39:06,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 2133 transitions. [2019-12-07 13:39:06,824 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 2133 transitions. Word has length 52 [2019-12-07 13:39:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:39:06,824 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 2133 transitions. [2019-12-07 13:39:06,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:39:06,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 2133 transitions. [2019-12-07 13:39:06,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 13:39:06,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:39:06,825 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] [2019-12-07 13:39:06,825 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:39:06,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:39:06,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1710729972, now seen corresponding path program 1 times [2019-12-07 13:39:06,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:39:06,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448772785] [2019-12-07 13:39:06,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:39:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:39:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:39:06,895 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:39:06,895 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:39:06,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29| 1) |v_#valid_52|) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= v_~y$mem_tmp~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29|) 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29|) |v_ULTIMATE.start_main_~#t593~0.offset_20| 0)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t593~0.base_29|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t593~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= |v_ULTIMATE.start_main_~#t593~0.offset_20| 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t593~0.base=|v_ULTIMATE.start_main_~#t593~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t593~0.offset=|v_ULTIMATE.start_main_~#t593~0.offset_20|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t593~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t594~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t593~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:39:06,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12|) |v_ULTIMATE.start_main_~#t594~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t594~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t594~0.base_12|)) (= |v_ULTIMATE.start_main_~#t594~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t594~0.base_12| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.base, ULTIMATE.start_main_~#t594~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 13:39:06,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~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_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:39:06,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2002569216 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2002569216 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2002569216|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2002569216| ~y$w_buff0_used~0_In2002569216) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2002569216, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2002569216} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2002569216|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2002569216, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2002569216} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:39:06,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In904719222 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out904719222| ~y$w_buff0~0_In904719222) (= |P1Thread1of1ForFork1_#t~ite14_In904719222| |P1Thread1of1ForFork1_#t~ite14_Out904719222|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In904719222 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In904719222 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In904719222 256))) (= (mod ~y$w_buff0_used~0_In904719222 256) 0))) (= |P1Thread1of1ForFork1_#t~ite15_Out904719222| |P1Thread1of1ForFork1_#t~ite14_Out904719222|) (= |P1Thread1of1ForFork1_#t~ite14_Out904719222| ~y$w_buff0~0_In904719222)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904719222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904719222, ~y$w_buff0~0=~y$w_buff0~0_In904719222, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904719222, ~weak$$choice2~0=~weak$$choice2~0_In904719222, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In904719222|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904719222} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904719222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904719222, ~y$w_buff0~0=~y$w_buff0~0_In904719222, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904719222, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out904719222|, ~weak$$choice2~0=~weak$$choice2~0_In904719222, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out904719222|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904719222} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:39:06,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-455736955 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-455736955| |P1Thread1of1ForFork1_#t~ite17_Out-455736955|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-455736955| ~y$w_buff1~0_In-455736955)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-455736955 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-455736955 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-455736955 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-455736955 256))))) (= |P1Thread1of1ForFork1_#t~ite17_Out-455736955| ~y$w_buff1~0_In-455736955) (= |P1Thread1of1ForFork1_#t~ite17_Out-455736955| |P1Thread1of1ForFork1_#t~ite18_Out-455736955|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455736955, ~y$w_buff1~0=~y$w_buff1~0_In-455736955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455736955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455736955, ~weak$$choice2~0=~weak$$choice2~0_In-455736955, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-455736955|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455736955, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-455736955|, ~y$w_buff1~0=~y$w_buff1~0_In-455736955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455736955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455736955, ~weak$$choice2~0=~weak$$choice2~0_In-455736955, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-455736955|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 13:39:06,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In761436831 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In761436831 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In761436831 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In761436831 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out761436831| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out761436831| ~y$w_buff1_used~0_In761436831) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In761436831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In761436831, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In761436831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In761436831} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out761436831|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In761436831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In761436831, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In761436831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In761436831} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:39:06,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1792602950 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1792602950 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_In-1792602950 ~y$r_buff0_thd1~0_Out-1792602950))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1792602950) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792602950, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1792602950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792602950, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1792602950|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1792602950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:39:06,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In562131356 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In562131356 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In562131356 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In562131356 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out562131356| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out562131356| ~y$r_buff1_thd1~0_In562131356) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In562131356, ~y$w_buff0_used~0=~y$w_buff0_used~0_In562131356, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In562131356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In562131356} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In562131356, ~y$w_buff0_used~0=~y$w_buff0_used~0_In562131356, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out562131356|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In562131356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In562131356} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:39:06,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1299902122 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1299902122| |P1Thread1of1ForFork1_#t~ite20_Out1299902122|) (= ~y$w_buff0_used~0_In1299902122 |P1Thread1of1ForFork1_#t~ite20_Out1299902122|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1299902122 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1299902122 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In1299902122 256)) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In1299902122 256)) .cse0))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out1299902122| ~y$w_buff0_used~0_In1299902122) (= |P1Thread1of1ForFork1_#t~ite20_In1299902122| |P1Thread1of1ForFork1_#t~ite20_Out1299902122|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1299902122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1299902122, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1299902122|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1299902122, ~weak$$choice2~0=~weak$$choice2~0_In1299902122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299902122} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1299902122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1299902122, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1299902122|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1299902122, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1299902122|, ~weak$$choice2~0=~weak$$choice2~0_In1299902122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299902122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:39:06,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:39:06,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In614287159 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out614287159| ~y$r_buff1_thd2~0_In614287159) (= |P1Thread1of1ForFork1_#t~ite29_In614287159| |P1Thread1of1ForFork1_#t~ite29_Out614287159|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In614287159 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In614287159 256)) (and (= 0 (mod ~y$w_buff1_used~0_In614287159 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In614287159 256))))) (= |P1Thread1of1ForFork1_#t~ite30_Out614287159| |P1Thread1of1ForFork1_#t~ite29_Out614287159|) .cse0 (= ~y$r_buff1_thd2~0_In614287159 |P1Thread1of1ForFork1_#t~ite29_Out614287159|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In614287159, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In614287159|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In614287159, ~weak$$choice2~0=~weak$$choice2~0_In614287159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In614287159} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In614287159, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out614287159|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out614287159|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In614287159, ~weak$$choice2~0=~weak$$choice2~0_In614287159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In614287159} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:39:06,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:39:06,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:39:06,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1755935292 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1755935292 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1755935292| ~y$w_buff1~0_In-1755935292) (not .cse0) (not .cse1)) (and (= ~y~0_In-1755935292 |P1Thread1of1ForFork1_#t~ite32_Out-1755935292|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1755935292, ~y$w_buff1~0=~y$w_buff1~0_In-1755935292, ~y~0=~y~0_In-1755935292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755935292} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1755935292, ~y$w_buff1~0=~y$w_buff1~0_In-1755935292, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1755935292|, ~y~0=~y~0_In-1755935292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755935292} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:39:06,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 13:39:06,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-893952704 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-893952704 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-893952704| ~y$w_buff0_used~0_In-893952704)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-893952704|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-893952704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-893952704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-893952704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-893952704, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-893952704|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:39:06,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In874384443 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In874384443 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In874384443 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In874384443 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out874384443| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out874384443| ~y$w_buff1_used~0_In874384443) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In874384443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In874384443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In874384443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In874384443} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In874384443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In874384443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In874384443, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out874384443|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In874384443} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:39:06,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In620744796 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In620744796 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out620744796| ~y$r_buff0_thd2~0_In620744796) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out620744796| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In620744796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In620744796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In620744796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In620744796, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out620744796|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:39:06,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1068361869 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1068361869 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1068361869 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1068361869 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1068361869 |P1Thread1of1ForFork1_#t~ite37_Out-1068361869|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1068361869|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068361869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068361869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068361869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068361869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068361869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068361869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068361869, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1068361869|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068361869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:39:06,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:39:06,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:39:06,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-628578386 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-628578386 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-628578386| ~y~0_In-628578386)) (and (= |ULTIMATE.start_main_#t~ite40_Out-628578386| ~y$w_buff1~0_In-628578386) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-628578386, ~y~0=~y~0_In-628578386, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-628578386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-628578386} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-628578386|, ~y$w_buff1~0=~y$w_buff1~0_In-628578386, ~y~0=~y~0_In-628578386, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-628578386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-628578386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:39:06,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 13:39:06,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1595199414 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1595199414 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1595199414 |ULTIMATE.start_main_#t~ite42_Out-1595199414|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1595199414|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595199414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595199414} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595199414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595199414, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1595199414|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:39:06,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In466552729 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In466552729 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In466552729 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In466552729 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out466552729| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In466552729 |ULTIMATE.start_main_#t~ite43_Out466552729|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In466552729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In466552729, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In466552729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466552729} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In466552729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In466552729, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out466552729|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In466552729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466552729} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:39:06,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1530258646 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1530258646 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1530258646 |ULTIMATE.start_main_#t~ite44_Out-1530258646|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1530258646|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530258646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1530258646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530258646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1530258646, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1530258646|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:39:06,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In2048092730 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2048092730 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2048092730 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In2048092730 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2048092730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out2048092730| ~y$r_buff1_thd0~0_In2048092730) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2048092730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2048092730, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2048092730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048092730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2048092730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2048092730, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2048092730, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2048092730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048092730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:39:06,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:39:06,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:39:06 BasicIcfg [2019-12-07 13:39:06,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:39:06,940 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:39:06,940 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:39:06,940 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:39:06,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:38:59" (3/4) ... [2019-12-07 13:39:06,942 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:39:06,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~x~0_148) (= 0 v_~y$flush_delayed~0_33) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29| 1) |v_#valid_52|) (= v_~y$w_buff1~0_317 0) (= v_~y$r_buff1_thd0~0_179 0) (= 0 v_~__unbuffered_cnt~0_62) (= v_~y$mem_tmp~0_26 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t593~0.base_29|) 0) (= v_~y~0_149 0) (= 0 v_~y$r_buff1_thd2~0_326) (= v_~y$read_delayed~0_6 0) (= v_~y$w_buff1_used~0_504 0) (= v_~y$r_buff0_thd1~0_219 0) (= v_~y$r_buff1_thd1~0_159 0) (= 0 v_~weak$$choice0~0_21) (= 0 v_~y$read_delayed_var~0.base_7) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t593~0.base_29|) |v_ULTIMATE.start_main_~#t593~0.offset_20| 0)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t593~0.base_29|) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t593~0.base_29| 4)) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~y$r_buff0_thd2~0_362) (= v_~__unbuffered_p1_EBX~0_46 0) (= v_~y$w_buff0_used~0_796 0) (= v_~main$tmp_guard0~0_32 0) (= v_~y$r_buff0_thd0~0_136 0) (= v_~weak$$choice2~0_121 0) (= 0 v_~y$w_buff0~0_547) (= |v_ULTIMATE.start_main_~#t593~0.offset_20| 0) (= 0 |v_#NULL.base_5|) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_14|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_796, #NULL.offset=|v_#NULL.offset_5|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_29|, ULTIMATE.start_main_~#t593~0.base=|v_ULTIMATE.start_main_~#t593~0.base_29|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_35|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_73|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_31|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_159, ~y$mem_tmp~0=v_~y$mem_tmp~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$w_buff0~0=v_~y$w_buff0~0_547, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ULTIMATE.start_main_~#t593~0.offset=|v_ULTIMATE.start_main_~#t593~0.offset_20|, #length=|v_#length_15|, ~y~0=v_~y~0_149, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_46, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_326, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$w_buff1~0=v_~y$w_buff1~0_317, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_136, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_362, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_121, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_179, ~x~0=v_~x~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_504} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t593~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t594~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t593~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:39:06,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L797-1-->L799: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t594~0.base_12|) |v_ULTIMATE.start_main_~#t594~0.offset_10| 1)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t594~0.base_12|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t594~0.base_12|)) (= |v_ULTIMATE.start_main_~#t594~0.offset_10| 0) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t594~0.base_12| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t594~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t594~0.base=|v_ULTIMATE.start_main_~#t594~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t594~0.offset=|v_ULTIMATE.start_main_~#t594~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t594~0.base, ULTIMATE.start_main_~#t594~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 13:39:06,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L4-->L738: Formula: (and (= v_~y$r_buff0_thd1~0_41 v_~y$r_buff1_thd1~0_23) (= v_~y$r_buff0_thd2~0_107 v_~y$r_buff1_thd2~0_62) (= v_~y$r_buff0_thd0~0_52 v_~y$r_buff1_thd0~0_32) (= v_~x~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64 0)) (= v_~y$r_buff0_thd1~0_40 1)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_62, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_52, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_40, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_107, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_64, ~x~0=v_~x~0_18, ~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_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:39:06,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2002569216 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2002569216 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2002569216|)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out2002569216| ~y$w_buff0_used~0_In2002569216) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2002569216, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2002569216} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2002569216|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2002569216, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2002569216} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:39:06,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L763-->L763-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In904719222 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out904719222| ~y$w_buff0~0_In904719222) (= |P1Thread1of1ForFork1_#t~ite14_In904719222| |P1Thread1of1ForFork1_#t~ite14_Out904719222|)) (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In904719222 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In904719222 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In904719222 256))) (= (mod ~y$w_buff0_used~0_In904719222 256) 0))) (= |P1Thread1of1ForFork1_#t~ite15_Out904719222| |P1Thread1of1ForFork1_#t~ite14_Out904719222|) (= |P1Thread1of1ForFork1_#t~ite14_Out904719222| ~y$w_buff0~0_In904719222)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904719222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904719222, ~y$w_buff0~0=~y$w_buff0~0_In904719222, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904719222, ~weak$$choice2~0=~weak$$choice2~0_In904719222, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In904719222|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904719222} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In904719222, ~y$w_buff0_used~0=~y$w_buff0_used~0_In904719222, ~y$w_buff0~0=~y$w_buff0~0_In904719222, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In904719222, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out904719222|, ~weak$$choice2~0=~weak$$choice2~0_In904719222, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out904719222|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In904719222} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:39:06,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-455736955 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In-455736955| |P1Thread1of1ForFork1_#t~ite17_Out-455736955|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out-455736955| ~y$w_buff1~0_In-455736955)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-455736955 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-455736955 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-455736955 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-455736955 256))))) (= |P1Thread1of1ForFork1_#t~ite17_Out-455736955| ~y$w_buff1~0_In-455736955) (= |P1Thread1of1ForFork1_#t~ite17_Out-455736955| |P1Thread1of1ForFork1_#t~ite18_Out-455736955|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455736955, ~y$w_buff1~0=~y$w_buff1~0_In-455736955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455736955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455736955, ~weak$$choice2~0=~weak$$choice2~0_In-455736955, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In-455736955|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-455736955, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out-455736955|, ~y$w_buff1~0=~y$w_buff1~0_In-455736955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-455736955, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-455736955, ~weak$$choice2~0=~weak$$choice2~0_In-455736955, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out-455736955|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455736955} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 13:39:06,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In761436831 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In761436831 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In761436831 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In761436831 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out761436831| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out761436831| ~y$w_buff1_used~0_In761436831) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In761436831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In761436831, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In761436831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In761436831} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out761436831|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In761436831, ~y$w_buff0_used~0=~y$w_buff0_used~0_In761436831, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In761436831, ~y$w_buff1_used~0=~y$w_buff1_used~0_In761436831} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:39:06,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1792602950 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-1792602950 256) 0)) (.cse1 (= ~y$r_buff0_thd1~0_In-1792602950 ~y$r_buff0_thd1~0_Out-1792602950))) (or (and .cse0 .cse1) (and (= 0 ~y$r_buff0_thd1~0_Out-1792602950) (not .cse2) (not .cse0)) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792602950, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1792602950} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1792602950, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1792602950|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1792602950} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:39:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L742-->L742-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In562131356 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In562131356 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In562131356 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In562131356 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out562131356| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out562131356| ~y$r_buff1_thd1~0_In562131356) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In562131356, ~y$w_buff0_used~0=~y$w_buff0_used~0_In562131356, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In562131356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In562131356} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In562131356, ~y$w_buff0_used~0=~y$w_buff0_used~0_In562131356, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out562131356|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In562131356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In562131356} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:39:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1299902122 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out1299902122| |P1Thread1of1ForFork1_#t~ite20_Out1299902122|) (= ~y$w_buff0_used~0_In1299902122 |P1Thread1of1ForFork1_#t~ite20_Out1299902122|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1299902122 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In1299902122 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In1299902122 256)) .cse0) (and (= 0 (mod ~y$w_buff1_used~0_In1299902122 256)) .cse0))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite21_Out1299902122| ~y$w_buff0_used~0_In1299902122) (= |P1Thread1of1ForFork1_#t~ite20_In1299902122| |P1Thread1of1ForFork1_#t~ite20_Out1299902122|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1299902122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1299902122, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1299902122|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1299902122, ~weak$$choice2~0=~weak$$choice2~0_In1299902122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299902122} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1299902122, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1299902122, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1299902122|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1299902122, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1299902122|, ~weak$$choice2~0=~weak$$choice2~0_In1299902122, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1299902122} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 13:39:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd2~0_136 v_~y$r_buff0_thd2~0_135)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_136, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_135, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_28, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_12|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-07 13:39:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In614287159 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out614287159| ~y$r_buff1_thd2~0_In614287159) (= |P1Thread1of1ForFork1_#t~ite29_In614287159| |P1Thread1of1ForFork1_#t~ite29_Out614287159|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In614287159 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In614287159 256)) (and (= 0 (mod ~y$w_buff1_used~0_In614287159 256)) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In614287159 256))))) (= |P1Thread1of1ForFork1_#t~ite30_Out614287159| |P1Thread1of1ForFork1_#t~ite29_Out614287159|) .cse0 (= ~y$r_buff1_thd2~0_In614287159 |P1Thread1of1ForFork1_#t~ite29_Out614287159|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In614287159, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In614287159|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In614287159, ~weak$$choice2~0=~weak$$choice2~0_In614287159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In614287159} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In614287159, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out614287159|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out614287159|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In614287159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In614287159, ~weak$$choice2~0=~weak$$choice2~0_In614287159, ~y$w_buff1_used~0=~y$w_buff1_used~0_In614287159} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-07 13:39:06,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= v_~y$r_buff1_thd1~0_129 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_129, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:39:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L770-->L774: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6) (= v_~y~0_21 v_~y$mem_tmp~0_5)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_21} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:39:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L774-2-->L774-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1755935292 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1755935292 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite32_Out-1755935292| ~y$w_buff1~0_In-1755935292) (not .cse0) (not .cse1)) (and (= ~y~0_In-1755935292 |P1Thread1of1ForFork1_#t~ite32_Out-1755935292|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1755935292, ~y$w_buff1~0=~y$w_buff1~0_In-1755935292, ~y~0=~y~0_In-1755935292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755935292} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1755935292, ~y$w_buff1~0=~y$w_buff1~0_In-1755935292, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1755935292|, ~y~0=~y~0_In-1755935292, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1755935292} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-07 13:39:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L774-4-->L775: Formula: (= v_~y~0_29 |v_P1Thread1of1ForFork1_#t~ite32_6|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_6|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_5|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_5|, ~y~0=v_~y~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-07 13:39:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-893952704 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-893952704 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-893952704| ~y$w_buff0_used~0_In-893952704)) (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-893952704|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-893952704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-893952704} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-893952704, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-893952704, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-893952704|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-07 13:39:06,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In874384443 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In874384443 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In874384443 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In874384443 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out874384443| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite35_Out874384443| ~y$w_buff1_used~0_In874384443) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In874384443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In874384443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In874384443, ~y$w_buff1_used~0=~y$w_buff1_used~0_In874384443} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In874384443, ~y$w_buff0_used~0=~y$w_buff0_used~0_In874384443, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In874384443, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out874384443|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In874384443} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-07 13:39:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In620744796 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In620744796 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out620744796| ~y$r_buff0_thd2~0_In620744796) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out620744796| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In620744796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In620744796} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In620744796, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In620744796, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out620744796|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-07 13:39:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1068361869 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1068361869 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1068361869 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1068361869 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1068361869 |P1Thread1of1ForFork1_#t~ite37_Out-1068361869|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1068361869|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068361869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068361869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068361869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068361869} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1068361869, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1068361869, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1068361869, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1068361869|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1068361869} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:39:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L778-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_270 |v_P1Thread1of1ForFork1_#t~ite37_40|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_40|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_270, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_39|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 13:39:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_300 256) 0) (= (mod v_~y$r_buff0_thd0~0_64 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_300, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:39:06,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-628578386 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-628578386 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out-628578386| ~y~0_In-628578386)) (and (= |ULTIMATE.start_main_#t~ite40_Out-628578386| ~y$w_buff1~0_In-628578386) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-628578386, ~y~0=~y~0_In-628578386, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-628578386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-628578386} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-628578386|, ~y$w_buff1~0=~y$w_buff1~0_In-628578386, ~y~0=~y~0_In-628578386, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-628578386, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-628578386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-07 13:39:06,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L805-4-->L806: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite40_11|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-07 13:39:06,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L806-->L806-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1595199414 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1595199414 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1595199414 |ULTIMATE.start_main_#t~ite42_Out-1595199414|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1595199414|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595199414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595199414} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1595199414, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1595199414, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1595199414|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 13:39:06,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L807-->L807-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In466552729 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In466552729 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In466552729 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In466552729 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out466552729| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In466552729 |ULTIMATE.start_main_#t~ite43_Out466552729|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In466552729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In466552729, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In466552729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466552729} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In466552729, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In466552729, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out466552729|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In466552729, ~y$w_buff1_used~0=~y$w_buff1_used~0_In466552729} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-07 13:39:06,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1530258646 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1530258646 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-1530258646 |ULTIMATE.start_main_#t~ite44_Out-1530258646|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1530258646|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530258646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1530258646} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1530258646, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1530258646, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1530258646|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 13:39:06,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L809-->L809-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In2048092730 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In2048092730 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2048092730 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In2048092730 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2048092730| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite45_Out2048092730| ~y$r_buff1_thd0~0_In2048092730) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2048092730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2048092730, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2048092730, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048092730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2048092730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2048092730, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2048092730, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2048092730|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2048092730} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 13:39:06,950 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y$r_buff1_thd0~0_140 |v_ULTIMATE.start_main_#t~ite45_40|) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= (ite (= (ite (not (and (= 2 v_~x~0_117) (= 2 v_~__unbuffered_p1_EAX~0_28) (= v_~__unbuffered_p1_EBX~0_24 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~x~0=v_~x~0_117, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x~0=v_~x~0_117, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_140, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:39:06,993 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e5bbe7cb-7e1f-4460-b859-9cb3d2a55af9/bin/uautomizer/witness.graphml [2019-12-07 13:39:06,993 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:39:06,994 INFO L168 Benchmark]: Toolchain (without parser) took 8843.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 358.6 MB). Free memory was 934.0 MB in the beginning and 1.3 GB in the end (delta: -327.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:06,994 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:39:06,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:06,995 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:06,995 INFO L168 Benchmark]: Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:39:06,995 INFO L168 Benchmark]: RCFGBuilder took 377.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:06,996 INFO L168 Benchmark]: TraceAbstraction took 7926.21 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -281.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:39:06,996 INFO L168 Benchmark]: Witness Printer took 52.91 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-12-07 13:39:06,997 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -125.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 377.72 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7926.21 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 265.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -281.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 52.91 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.9s, 147 ProgramPointsBefore, 77 ProgramPointsAfterwards, 181 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 27 ChoiceCompositions, 4555 VarBasedMoverChecksPositive, 216 VarBasedMoverChecksNegative, 60 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 47763 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L799] FCALL, FORK 0 pthread_create(&t594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 __unbuffered_p1_EAX = x [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L762] 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) [L763] 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)) [L764] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L765] 2 y$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)) [L766] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L766] 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)) [L768] 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)) [L769] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L776] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L777] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] 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 [L808] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 7.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1740 SDtfs, 2349 SDslu, 3387 SDs, 0 SdLazy, 2457 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 7315 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 454 ConstructedInterpolants, 0 QuantifiedInterpolants, 100894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...