./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/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 ebde15fdb52026375d3a16b6ef78579eac71259b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:59:17,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:59:17,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:59:17,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:59:17,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:59:17,284 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:59:17,285 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:59:17,287 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:59:17,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:59:17,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:59:17,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:59:17,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:59:17,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:59:17,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:59:17,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:59:17,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:59:17,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:59:17,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:59:17,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:59:17,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:59:17,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:59:17,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:59:17,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:59:17,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:59:17,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:59:17,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:59:17,306 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:59:17,307 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:59:17,307 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:59:17,308 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:59:17,308 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:59:17,308 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:59:17,309 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:59:17,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:59:17,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:59:17,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:59:17,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:59:17,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:59:17,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:59:17,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:59:17,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:59:17,313 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:59:17,324 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:59:17,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:59:17,325 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:59:17,325 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:59:17,325 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:59:17,325 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:59:17,325 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:59:17,325 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:59:17,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:59:17,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:59:17,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:59:17,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:59:17,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:59:17,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:59:17,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:59:17,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:59:17,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:59:17,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:59:17,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:59:17,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:59:17,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:59:17,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:59:17,328 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_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/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 -> ebde15fdb52026375d3a16b6ef78579eac71259b [2019-12-07 11:59:17,434 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:59:17,444 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:59:17,447 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:59:17,448 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:59:17,449 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:59:17,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix027_pso.opt.i [2019-12-07 11:59:17,492 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/data/b1e541aa2/d8aa0aaac5b0494bbbf0c8b7cbc2f640/FLAG92c5fcf23 [2019-12-07 11:59:17,929 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:59:17,929 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/sv-benchmarks/c/pthread-wmm/mix027_pso.opt.i [2019-12-07 11:59:17,940 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/data/b1e541aa2/d8aa0aaac5b0494bbbf0c8b7cbc2f640/FLAG92c5fcf23 [2019-12-07 11:59:18,289 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/data/b1e541aa2/d8aa0aaac5b0494bbbf0c8b7cbc2f640 [2019-12-07 11:59:18,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:59:18,292 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:59:18,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:59:18,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:59:18,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:59:18,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7030ab51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18, skipping insertion in model container [2019-12-07 11:59:18,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:59:18,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:59:18,588 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:59:18,595 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:59:18,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:59:18,683 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:59:18,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18 WrapperNode [2019-12-07 11:59:18,684 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:59:18,684 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:59:18,684 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:59:18,684 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:59:18,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:59:18,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:59:18,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:59:18,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:59:18,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... [2019-12-07 11:59:18,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:59:18,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:59:18,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:59:18,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:59:18,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:59:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:59:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:59:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:59:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:59:18,787 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:59:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:59:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:59:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:59:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:59:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:59:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 11:59:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 11:59:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:59:18,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:59:18,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:59:18,789 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 11:59:19,141 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:59:19,141 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:59:19,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:59:19 BoogieIcfgContainer [2019-12-07 11:59:19,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:59:19,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:59:19,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:59:19,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:59:19,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:59:18" (1/3) ... [2019-12-07 11:59:19,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319cc40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:59:19, skipping insertion in model container [2019-12-07 11:59:19,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:59:18" (2/3) ... [2019-12-07 11:59:19,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@319cc40e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:59:19, skipping insertion in model container [2019-12-07 11:59:19,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:59:19" (3/3) ... [2019-12-07 11:59:19,147 INFO L109 eAbstractionObserver]: Analyzing ICFG mix027_pso.opt.i [2019-12-07 11:59:19,153 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:59:19,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:59:19,158 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:59:19,159 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:59:19,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,193 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,196 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,197 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,198 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,199 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,200 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,201 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,202 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:59:19,215 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 11:59:19,227 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:59:19,227 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:59:19,228 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:59:19,228 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:59:19,228 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:59:19,228 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:59:19,228 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:59:19,228 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:59:19,241 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 208 transitions [2019-12-07 11:59:19,242 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 11:59:19,302 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 11:59:19,302 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:59:19,313 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 11:59:19,328 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 208 transitions [2019-12-07 11:59:19,356 INFO L134 PetriNetUnfolder]: 41/204 cut-off events. [2019-12-07 11:59:19,356 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:59:19,362 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 204 events. 41/204 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 718 event pairs. 12/173 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-07 11:59:19,377 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-07 11:59:19,378 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:59:22,439 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 11:59:22,544 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74757 [2019-12-07 11:59:22,544 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 11:59:22,546 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-07 11:59:56,876 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 171250 states. [2019-12-07 11:59:56,877 INFO L276 IsEmpty]: Start isEmpty. Operand 171250 states. [2019-12-07 11:59:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 11:59:56,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:59:56,882 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:59:56,882 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:59:56,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:59:56,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1969539409, now seen corresponding path program 1 times [2019-12-07 11:59:56,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:59:56,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162761331] [2019-12-07 11:59:56,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:59:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:59:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:59:57,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162761331] [2019-12-07 11:59:57,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:59:57,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:59:57,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534141931] [2019-12-07 11:59:57,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:59:57,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:59:57,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:59:57,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:59:57,052 INFO L87 Difference]: Start difference. First operand 171250 states. Second operand 3 states. [2019-12-07 11:59:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:59:58,134 INFO L93 Difference]: Finished difference Result 169554 states and 814774 transitions. [2019-12-07 11:59:58,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:59:58,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 11:59:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:00:00,696 INFO L225 Difference]: With dead ends: 169554 [2019-12-07 12:00:00,696 INFO L226 Difference]: Without dead ends: 159076 [2019-12-07 12:00:00,697 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:00:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159076 states. [2019-12-07 12:00:09,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159076 to 159076. [2019-12-07 12:00:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159076 states. [2019-12-07 12:00:10,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159076 states to 159076 states and 763437 transitions. [2019-12-07 12:00:10,180 INFO L78 Accepts]: Start accepts. Automaton has 159076 states and 763437 transitions. Word has length 7 [2019-12-07 12:00:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:00:10,181 INFO L462 AbstractCegarLoop]: Abstraction has 159076 states and 763437 transitions. [2019-12-07 12:00:10,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:00:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 159076 states and 763437 transitions. [2019-12-07 12:00:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:00:10,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:00:10,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:00:10,191 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:00:10,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:00:10,192 INFO L82 PathProgramCache]: Analyzing trace with hash 230524214, now seen corresponding path program 1 times [2019-12-07 12:00:10,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:00:10,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912485578] [2019-12-07 12:00:10,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:00:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:00:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:00:10,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912485578] [2019-12-07 12:00:10,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:00:10,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:00:10,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207872275] [2019-12-07 12:00:10,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:00:10,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:00:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:00:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:00:10,260 INFO L87 Difference]: Start difference. First operand 159076 states and 763437 transitions. Second operand 4 states. [2019-12-07 12:00:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:00:11,850 INFO L93 Difference]: Finished difference Result 251868 states and 1162713 transitions. [2019-12-07 12:00:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:00:11,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:00:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:00:15,347 INFO L225 Difference]: With dead ends: 251868 [2019-12-07 12:00:15,347 INFO L226 Difference]: Without dead ends: 251658 [2019-12-07 12:00:15,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:00:22,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251658 states. [2019-12-07 12:00:26,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251658 to 235278. [2019-12-07 12:00:26,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235278 states. [2019-12-07 12:00:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235278 states to 235278 states and 1094580 transitions. [2019-12-07 12:00:27,280 INFO L78 Accepts]: Start accepts. Automaton has 235278 states and 1094580 transitions. Word has length 15 [2019-12-07 12:00:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:00:27,280 INFO L462 AbstractCegarLoop]: Abstraction has 235278 states and 1094580 transitions. [2019-12-07 12:00:27,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:00:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 235278 states and 1094580 transitions. [2019-12-07 12:00:27,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:00:27,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:00:27,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:00:27,284 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:00:27,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:00:27,284 INFO L82 PathProgramCache]: Analyzing trace with hash -519494263, now seen corresponding path program 1 times [2019-12-07 12:00:27,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:00:27,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160536106] [2019-12-07 12:00:27,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:00:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:00:27,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:00:27,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160536106] [2019-12-07 12:00:27,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:00:27,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:00:27,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28389513] [2019-12-07 12:00:27,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:00:27,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:00:27,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:00:27,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:00:27,348 INFO L87 Difference]: Start difference. First operand 235278 states and 1094580 transitions. Second operand 4 states. [2019-12-07 12:00:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:00:29,903 INFO L93 Difference]: Finished difference Result 333248 states and 1520275 transitions. [2019-12-07 12:00:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:00:29,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:00:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:00:30,909 INFO L225 Difference]: With dead ends: 333248 [2019-12-07 12:00:30,910 INFO L226 Difference]: Without dead ends: 333008 [2019-12-07 12:00:30,910 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:00:42,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333008 states. [2019-12-07 12:00:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333008 to 282040. [2019-12-07 12:00:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282040 states. [2019-12-07 12:00:48,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282040 states to 282040 states and 1305129 transitions. [2019-12-07 12:00:48,587 INFO L78 Accepts]: Start accepts. Automaton has 282040 states and 1305129 transitions. Word has length 15 [2019-12-07 12:00:48,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:00:48,588 INFO L462 AbstractCegarLoop]: Abstraction has 282040 states and 1305129 transitions. [2019-12-07 12:00:48,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:00:48,588 INFO L276 IsEmpty]: Start isEmpty. Operand 282040 states and 1305129 transitions. [2019-12-07 12:00:48,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 12:00:48,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:00:48,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:00:48,593 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:00:48,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:00:48,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1627950887, now seen corresponding path program 1 times [2019-12-07 12:00:48,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:00:48,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554176961] [2019-12-07 12:00:48,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:00:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:00:48,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:00:48,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554176961] [2019-12-07 12:00:48,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:00:48,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:00:48,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096458229] [2019-12-07 12:00:48,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:00:48,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:00:48,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:00:48,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:00:48,640 INFO L87 Difference]: Start difference. First operand 282040 states and 1305129 transitions. Second operand 5 states. [2019-12-07 12:00:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:00:51,466 INFO L93 Difference]: Finished difference Result 380594 states and 1735388 transitions. [2019-12-07 12:00:51,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:00:51,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 12:00:51,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:00:52,554 INFO L225 Difference]: With dead ends: 380594 [2019-12-07 12:00:52,554 INFO L226 Difference]: Without dead ends: 380290 [2019-12-07 12:00:52,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:01:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380290 states. [2019-12-07 12:01:10,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380290 to 310408. [2019-12-07 12:01:10,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310408 states. [2019-12-07 12:01:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310408 states to 310408 states and 1434469 transitions. [2019-12-07 12:01:11,952 INFO L78 Accepts]: Start accepts. Automaton has 310408 states and 1434469 transitions. Word has length 16 [2019-12-07 12:01:11,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:01:11,952 INFO L462 AbstractCegarLoop]: Abstraction has 310408 states and 1434469 transitions. [2019-12-07 12:01:11,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:01:11,952 INFO L276 IsEmpty]: Start isEmpty. Operand 310408 states and 1434469 transitions. [2019-12-07 12:01:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:01:11,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:01:11,976 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:01:11,976 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:01:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:01:11,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1371682190, now seen corresponding path program 1 times [2019-12-07 12:01:11,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:01:11,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547012922] [2019-12-07 12:01:11,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:01:11,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:01:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:01:12,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547012922] [2019-12-07 12:01:12,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:01:12,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:01:12,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131076841] [2019-12-07 12:01:12,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:01:12,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:01:12,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:01:12,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:01:12,022 INFO L87 Difference]: Start difference. First operand 310408 states and 1434469 transitions. Second operand 3 states. [2019-12-07 12:01:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:01:14,416 INFO L93 Difference]: Finished difference Result 310408 states and 1422401 transitions. [2019-12-07 12:01:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:01:14,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:01:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:01:15,275 INFO L225 Difference]: With dead ends: 310408 [2019-12-07 12:01:15,275 INFO L226 Difference]: Without dead ends: 310408 [2019-12-07 12:01:15,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:01:27,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310408 states. [2019-12-07 12:01:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310408 to 306272. [2019-12-07 12:01:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306272 states. [2019-12-07 12:01:33,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306272 states to 306272 states and 1404561 transitions. [2019-12-07 12:01:33,782 INFO L78 Accepts]: Start accepts. Automaton has 306272 states and 1404561 transitions. Word has length 20 [2019-12-07 12:01:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:01:33,782 INFO L462 AbstractCegarLoop]: Abstraction has 306272 states and 1404561 transitions. [2019-12-07 12:01:33,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:01:33,783 INFO L276 IsEmpty]: Start isEmpty. Operand 306272 states and 1404561 transitions. [2019-12-07 12:01:33,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:01:33,801 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:01:33,801 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:01:33,801 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:01:33,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:01:33,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1376762550, now seen corresponding path program 1 times [2019-12-07 12:01:33,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:01:33,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298218140] [2019-12-07 12:01:33,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:01:33,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:01:33,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:01:33,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298218140] [2019-12-07 12:01:33,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:01:33,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:01:33,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882179540] [2019-12-07 12:01:33,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:01:33,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:01:33,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:01:33,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:01:33,854 INFO L87 Difference]: Start difference. First operand 306272 states and 1404561 transitions. Second operand 3 states. [2019-12-07 12:01:37,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:01:37,474 INFO L93 Difference]: Finished difference Result 579955 states and 2627245 transitions. [2019-12-07 12:01:37,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:01:37,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:01:37,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:01:43,990 INFO L225 Difference]: With dead ends: 579955 [2019-12-07 12:01:43,990 INFO L226 Difference]: Without dead ends: 561967 [2019-12-07 12:01:43,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:01:54,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561967 states. [2019-12-07 12:02:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561967 to 538686. [2019-12-07 12:02:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538686 states. [2019-12-07 12:02:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538686 states to 538686 states and 2452746 transitions. [2019-12-07 12:02:06,198 INFO L78 Accepts]: Start accepts. Automaton has 538686 states and 2452746 transitions. Word has length 20 [2019-12-07 12:02:06,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:06,198 INFO L462 AbstractCegarLoop]: Abstraction has 538686 states and 2452746 transitions. [2019-12-07 12:02:06,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 538686 states and 2452746 transitions. [2019-12-07 12:02:06,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:02:06,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:06,248 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:06,248 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:06,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:06,248 INFO L82 PathProgramCache]: Analyzing trace with hash 246984461, now seen corresponding path program 1 times [2019-12-07 12:02:06,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:06,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148125637] [2019-12-07 12:02:06,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:02:06,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148125637] [2019-12-07 12:02:06,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:06,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:02:06,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793809393] [2019-12-07 12:02:06,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:02:06,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:06,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:02:06,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:06,286 INFO L87 Difference]: Start difference. First operand 538686 states and 2452746 transitions. Second operand 3 states. [2019-12-07 12:02:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:15,217 INFO L93 Difference]: Finished difference Result 538342 states and 2451230 transitions. [2019-12-07 12:02:15,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:02:15,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:02:15,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:16,789 INFO L225 Difference]: With dead ends: 538342 [2019-12-07 12:02:16,789 INFO L226 Difference]: Without dead ends: 538342 [2019-12-07 12:02:16,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:02:27,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538342 states. [2019-12-07 12:02:35,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538342 to 536968. [2019-12-07 12:02:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 536968 states. [2019-12-07 12:02:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536968 states to 536968 states and 2445733 transitions. [2019-12-07 12:02:38,049 INFO L78 Accepts]: Start accepts. Automaton has 536968 states and 2445733 transitions. Word has length 21 [2019-12-07 12:02:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:02:38,049 INFO L462 AbstractCegarLoop]: Abstraction has 536968 states and 2445733 transitions. [2019-12-07 12:02:38,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:02:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 536968 states and 2445733 transitions. [2019-12-07 12:02:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:02:38,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:02:38,098 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:02:38,099 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:02:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:02:38,099 INFO L82 PathProgramCache]: Analyzing trace with hash 846030250, now seen corresponding path program 1 times [2019-12-07 12:02:38,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:02:38,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935865302] [2019-12-07 12:02:38,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:02:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:02:38,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:02:38,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935865302] [2019-12-07 12:02:38,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:02:38,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:02:38,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980108203] [2019-12-07 12:02:38,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:02:38,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:02:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:02:38,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:02:38,169 INFO L87 Difference]: Start difference. First operand 536968 states and 2445733 transitions. Second operand 6 states. [2019-12-07 12:02:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:02:49,774 INFO L93 Difference]: Finished difference Result 798128 states and 3554880 transitions. [2019-12-07 12:02:49,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:02:49,775 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-12-07 12:02:49,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:02:52,190 INFO L225 Difference]: With dead ends: 798128 [2019-12-07 12:02:52,191 INFO L226 Difference]: Without dead ends: 797218 [2019-12-07 12:02:52,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:03:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797218 states. [2019-12-07 12:03:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797218 to 550468. [2019-12-07 12:03:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550468 states. [2019-12-07 12:03:20,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550468 states to 550468 states and 2506246 transitions. [2019-12-07 12:03:20,379 INFO L78 Accepts]: Start accepts. Automaton has 550468 states and 2506246 transitions. Word has length 21 [2019-12-07 12:03:20,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:03:20,379 INFO L462 AbstractCegarLoop]: Abstraction has 550468 states and 2506246 transitions. [2019-12-07 12:03:20,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:03:20,379 INFO L276 IsEmpty]: Start isEmpty. Operand 550468 states and 2506246 transitions. [2019-12-07 12:03:20,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:03:20,421 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:03:20,421 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:03:20,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:03:20,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:03:20,421 INFO L82 PathProgramCache]: Analyzing trace with hash 264528449, now seen corresponding path program 1 times [2019-12-07 12:03:20,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:03:20,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230388513] [2019-12-07 12:03:20,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:03:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:03:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:03:20,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230388513] [2019-12-07 12:03:20,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:03:20,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:03:20,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537883231] [2019-12-07 12:03:20,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:03:20,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:03:20,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:03:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:03:20,449 INFO L87 Difference]: Start difference. First operand 550468 states and 2506246 transitions. Second operand 3 states. [2019-12-07 12:03:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:03:26,562 INFO L93 Difference]: Finished difference Result 336067 states and 1378682 transitions. [2019-12-07 12:03:26,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:03:26,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 12:03:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:03:27,417 INFO L225 Difference]: With dead ends: 336067 [2019-12-07 12:03:27,417 INFO L226 Difference]: Without dead ends: 336067 [2019-12-07 12:03:27,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:03:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336067 states. [2019-12-07 12:03:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336067 to 336067. [2019-12-07 12:03:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336067 states. [2019-12-07 12:03:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336067 states to 336067 states and 1378682 transitions. [2019-12-07 12:03:39,379 INFO L78 Accepts]: Start accepts. Automaton has 336067 states and 1378682 transitions. Word has length 21 [2019-12-07 12:03:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:03:39,379 INFO L462 AbstractCegarLoop]: Abstraction has 336067 states and 1378682 transitions. [2019-12-07 12:03:39,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:03:39,379 INFO L276 IsEmpty]: Start isEmpty. Operand 336067 states and 1378682 transitions. [2019-12-07 12:03:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 12:03:39,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:03:39,405 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:03:39,405 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:03:39,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:03:39,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1596932964, now seen corresponding path program 1 times [2019-12-07 12:03:39,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:03:39,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346183843] [2019-12-07 12:03:39,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:03:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:03:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:03:39,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346183843] [2019-12-07 12:03:39,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:03:39,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:03:39,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793556485] [2019-12-07 12:03:39,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:03:39,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:03:39,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:03:39,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:03:39,460 INFO L87 Difference]: Start difference. First operand 336067 states and 1378682 transitions. Second operand 4 states. [2019-12-07 12:03:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:03:43,210 INFO L93 Difference]: Finished difference Result 572804 states and 2336907 transitions. [2019-12-07 12:03:43,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:03:43,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 12:03:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:03:44,067 INFO L225 Difference]: With dead ends: 572804 [2019-12-07 12:03:44,067 INFO L226 Difference]: Without dead ends: 346255 [2019-12-07 12:03:44,068 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 12:03:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346255 states. [2019-12-07 12:03:59,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346255 to 323043. [2019-12-07 12:03:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323043 states. [2019-12-07 12:04:01,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323043 states to 323043 states and 1278996 transitions. [2019-12-07 12:04:01,356 INFO L78 Accepts]: Start accepts. Automaton has 323043 states and 1278996 transitions. Word has length 22 [2019-12-07 12:04:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:01,357 INFO L462 AbstractCegarLoop]: Abstraction has 323043 states and 1278996 transitions. [2019-12-07 12:04:01,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:01,357 INFO L276 IsEmpty]: Start isEmpty. Operand 323043 states and 1278996 transitions. [2019-12-07 12:04:01,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:04:01,391 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:01,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:01,391 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:01,392 INFO L82 PathProgramCache]: Analyzing trace with hash -2043986937, now seen corresponding path program 1 times [2019-12-07 12:04:01,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:01,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739058869] [2019-12-07 12:04:01,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:01,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739058869] [2019-12-07 12:04:01,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:01,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:01,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535656707] [2019-12-07 12:04:01,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:01,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:01,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:01,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:01,443 INFO L87 Difference]: Start difference. First operand 323043 states and 1278996 transitions. Second operand 4 states. [2019-12-07 12:04:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:04,032 INFO L93 Difference]: Finished difference Result 435246 states and 1728046 transitions. [2019-12-07 12:04:04,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:04,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 12:04:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:05,092 INFO L225 Difference]: With dead ends: 435246 [2019-12-07 12:04:05,092 INFO L226 Difference]: Without dead ends: 424434 [2019-12-07 12:04:05,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424434 states. [2019-12-07 12:04:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424434 to 326507. [2019-12-07 12:04:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326507 states. [2019-12-07 12:04:18,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326507 states to 326507 states and 1293059 transitions. [2019-12-07 12:04:18,391 INFO L78 Accepts]: Start accepts. Automaton has 326507 states and 1293059 transitions. Word has length 23 [2019-12-07 12:04:18,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:18,391 INFO L462 AbstractCegarLoop]: Abstraction has 326507 states and 1293059 transitions. [2019-12-07 12:04:18,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:18,391 INFO L276 IsEmpty]: Start isEmpty. Operand 326507 states and 1293059 transitions. [2019-12-07 12:04:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:04:18,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:18,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:18,427 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash -276850441, now seen corresponding path program 2 times [2019-12-07 12:04:18,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:18,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697414485] [2019-12-07 12:04:18,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:18,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697414485] [2019-12-07 12:04:18,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:18,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:18,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733118119] [2019-12-07 12:04:18,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:18,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:18,458 INFO L87 Difference]: Start difference. First operand 326507 states and 1293059 transitions. Second operand 4 states. [2019-12-07 12:04:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:25,371 INFO L93 Difference]: Finished difference Result 563203 states and 2249898 transitions. [2019-12-07 12:04:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:25,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 12:04:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:26,160 INFO L225 Difference]: With dead ends: 563203 [2019-12-07 12:04:26,160 INFO L226 Difference]: Without dead ends: 341326 [2019-12-07 12:04:26,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341326 states. [2019-12-07 12:04:37,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341326 to 309685. [2019-12-07 12:04:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309685 states. [2019-12-07 12:04:38,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309685 states to 309685 states and 1209889 transitions. [2019-12-07 12:04:38,104 INFO L78 Accepts]: Start accepts. Automaton has 309685 states and 1209889 transitions. Word has length 23 [2019-12-07 12:04:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:38,104 INFO L462 AbstractCegarLoop]: Abstraction has 309685 states and 1209889 transitions. [2019-12-07 12:04:38,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:38,104 INFO L276 IsEmpty]: Start isEmpty. Operand 309685 states and 1209889 transitions. [2019-12-07 12:04:38,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 12:04:38,136 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:38,136 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:38,136 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:38,137 INFO L82 PathProgramCache]: Analyzing trace with hash 149935729, now seen corresponding path program 3 times [2019-12-07 12:04:38,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:38,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579291796] [2019-12-07 12:04:38,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:38,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579291796] [2019-12-07 12:04:38,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:38,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:38,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424902126] [2019-12-07 12:04:38,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:38,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:38,167 INFO L87 Difference]: Start difference. First operand 309685 states and 1209889 transitions. Second operand 4 states. [2019-12-07 12:04:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:38,408 INFO L93 Difference]: Finished difference Result 70487 states and 227234 transitions. [2019-12-07 12:04:38,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:38,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 12:04:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:38,515 INFO L225 Difference]: With dead ends: 70487 [2019-12-07 12:04:38,515 INFO L226 Difference]: Without dead ends: 70487 [2019-12-07 12:04:38,515 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 12:04:38,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70487 states. [2019-12-07 12:04:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70487 to 69547. [2019-12-07 12:04:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69547 states. [2019-12-07 12:04:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69547 states to 69547 states and 224058 transitions. [2019-12-07 12:04:40,038 INFO L78 Accepts]: Start accepts. Automaton has 69547 states and 224058 transitions. Word has length 23 [2019-12-07 12:04:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:40,039 INFO L462 AbstractCegarLoop]: Abstraction has 69547 states and 224058 transitions. [2019-12-07 12:04:40,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 69547 states and 224058 transitions. [2019-12-07 12:04:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:04:40,050 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:40,050 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:40,050 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:40,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:40,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1520730132, now seen corresponding path program 1 times [2019-12-07 12:04:40,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:40,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3578867] [2019-12-07 12:04:40,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:40,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:40,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3578867] [2019-12-07 12:04:40,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:40,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:04:40,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626239938] [2019-12-07 12:04:40,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:04:40,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:04:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:40,095 INFO L87 Difference]: Start difference. First operand 69547 states and 224058 transitions. Second operand 6 states. [2019-12-07 12:04:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:40,726 INFO L93 Difference]: Finished difference Result 96483 states and 304331 transitions. [2019-12-07 12:04:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:04:40,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 12:04:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:40,865 INFO L225 Difference]: With dead ends: 96483 [2019-12-07 12:04:40,865 INFO L226 Difference]: Without dead ends: 96273 [2019-12-07 12:04:40,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:04:41,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96273 states. [2019-12-07 12:04:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96273 to 72768. [2019-12-07 12:04:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72768 states. [2019-12-07 12:04:42,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72768 states to 72768 states and 233409 transitions. [2019-12-07 12:04:42,497 INFO L78 Accepts]: Start accepts. Automaton has 72768 states and 233409 transitions. Word has length 24 [2019-12-07 12:04:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:42,498 INFO L462 AbstractCegarLoop]: Abstraction has 72768 states and 233409 transitions. [2019-12-07 12:04:42,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:04:42,498 INFO L276 IsEmpty]: Start isEmpty. Operand 72768 states and 233409 transitions. [2019-12-07 12:04:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:04:42,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:42,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:42,511 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:42,511 INFO L82 PathProgramCache]: Analyzing trace with hash -212678054, now seen corresponding path program 2 times [2019-12-07 12:04:42,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:42,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416119982] [2019-12-07 12:04:42,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:42,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416119982] [2019-12-07 12:04:42,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:42,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:04:42,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008589886] [2019-12-07 12:04:42,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:04:42,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:42,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:04:42,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:42,548 INFO L87 Difference]: Start difference. First operand 72768 states and 233409 transitions. Second operand 6 states. [2019-12-07 12:04:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:43,257 INFO L93 Difference]: Finished difference Result 105994 states and 331760 transitions. [2019-12-07 12:04:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 12:04:43,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 12:04:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:43,425 INFO L225 Difference]: With dead ends: 105994 [2019-12-07 12:04:43,425 INFO L226 Difference]: Without dead ends: 105784 [2019-12-07 12:04:43,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:04:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105784 states. [2019-12-07 12:04:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105784 to 74219. [2019-12-07 12:04:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74219 states. [2019-12-07 12:04:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74219 states to 74219 states and 236745 transitions. [2019-12-07 12:04:44,986 INFO L78 Accepts]: Start accepts. Automaton has 74219 states and 236745 transitions. Word has length 24 [2019-12-07 12:04:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:44,986 INFO L462 AbstractCegarLoop]: Abstraction has 74219 states and 236745 transitions. [2019-12-07 12:04:44,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:04:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 74219 states and 236745 transitions. [2019-12-07 12:04:45,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 12:04:45,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:45,008 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:45,008 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash -560534453, now seen corresponding path program 1 times [2019-12-07 12:04:45,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:45,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269177798] [2019-12-07 12:04:45,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:45,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269177798] [2019-12-07 12:04:45,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:45,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:45,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365218502] [2019-12-07 12:04:45,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:45,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:45,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:45,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:45,046 INFO L87 Difference]: Start difference. First operand 74219 states and 236745 transitions. Second operand 5 states. [2019-12-07 12:04:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:45,531 INFO L93 Difference]: Finished difference Result 97790 states and 307353 transitions. [2019-12-07 12:04:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:04:45,531 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 12:04:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:45,670 INFO L225 Difference]: With dead ends: 97790 [2019-12-07 12:04:45,671 INFO L226 Difference]: Without dead ends: 97389 [2019-12-07 12:04:45,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:46,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97389 states. [2019-12-07 12:04:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97389 to 86292. [2019-12-07 12:04:47,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86292 states. [2019-12-07 12:04:47,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86292 states to 86292 states and 273229 transitions. [2019-12-07 12:04:47,373 INFO L78 Accepts]: Start accepts. Automaton has 86292 states and 273229 transitions. Word has length 28 [2019-12-07 12:04:47,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:47,373 INFO L462 AbstractCegarLoop]: Abstraction has 86292 states and 273229 transitions. [2019-12-07 12:04:47,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 86292 states and 273229 transitions. [2019-12-07 12:04:47,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 12:04:47,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:47,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:47,409 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:47,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:47,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1179330183, now seen corresponding path program 1 times [2019-12-07 12:04:47,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:47,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731043713] [2019-12-07 12:04:47,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:47,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 12:04:47,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731043713] [2019-12-07 12:04:47,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:47,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:04:47,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076155250] [2019-12-07 12:04:47,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:04:47,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:47,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:04:47,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:47,455 INFO L87 Difference]: Start difference. First operand 86292 states and 273229 transitions. Second operand 6 states. [2019-12-07 12:04:48,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:48,094 INFO L93 Difference]: Finished difference Result 112701 states and 352315 transitions. [2019-12-07 12:04:48,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:04:48,095 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 12:04:48,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:48,270 INFO L225 Difference]: With dead ends: 112701 [2019-12-07 12:04:48,270 INFO L226 Difference]: Without dead ends: 111950 [2019-12-07 12:04:48,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:04:48,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111950 states. [2019-12-07 12:04:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111950 to 89226. [2019-12-07 12:04:49,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89226 states. [2019-12-07 12:04:50,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89226 states to 89226 states and 281889 transitions. [2019-12-07 12:04:50,107 INFO L78 Accepts]: Start accepts. Automaton has 89226 states and 281889 transitions. Word has length 31 [2019-12-07 12:04:50,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:50,107 INFO L462 AbstractCegarLoop]: Abstraction has 89226 states and 281889 transitions. [2019-12-07 12:04:50,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:04:50,107 INFO L276 IsEmpty]: Start isEmpty. Operand 89226 states and 281889 transitions. [2019-12-07 12:04:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 12:04:50,150 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:50,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:50,151 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:50,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:50,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1043452722, now seen corresponding path program 1 times [2019-12-07 12:04:50,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:50,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333632068] [2019-12-07 12:04:50,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:50,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333632068] [2019-12-07 12:04:50,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:50,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:50,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322545357] [2019-12-07 12:04:50,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:04:50,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:50,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:04:50,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:04:50,208 INFO L87 Difference]: Start difference. First operand 89226 states and 281889 transitions. Second operand 4 states. [2019-12-07 12:04:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:50,562 INFO L93 Difference]: Finished difference Result 111710 states and 354956 transitions. [2019-12-07 12:04:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:04:50,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 12:04:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:50,613 INFO L225 Difference]: With dead ends: 111710 [2019-12-07 12:04:50,613 INFO L226 Difference]: Without dead ends: 34664 [2019-12-07 12:04:50,613 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 12:04:50,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34664 states. [2019-12-07 12:04:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34664 to 32390. [2019-12-07 12:04:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32390 states. [2019-12-07 12:04:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32390 states to 32390 states and 102761 transitions. [2019-12-07 12:04:51,198 INFO L78 Accepts]: Start accepts. Automaton has 32390 states and 102761 transitions. Word has length 33 [2019-12-07 12:04:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:51,198 INFO L462 AbstractCegarLoop]: Abstraction has 32390 states and 102761 transitions. [2019-12-07 12:04:51,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:04:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 32390 states and 102761 transitions. [2019-12-07 12:04:51,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 12:04:51,215 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:51,215 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:51,215 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:51,215 INFO L82 PathProgramCache]: Analyzing trace with hash -127004127, now seen corresponding path program 1 times [2019-12-07 12:04:51,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:51,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735467825] [2019-12-07 12:04:51,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:51,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735467825] [2019-12-07 12:04:51,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:51,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:04:51,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963055237] [2019-12-07 12:04:51,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:51,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:51,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:51,248 INFO L87 Difference]: Start difference. First operand 32390 states and 102761 transitions. Second operand 5 states. [2019-12-07 12:04:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:51,310 INFO L93 Difference]: Finished difference Result 17077 states and 52630 transitions. [2019-12-07 12:04:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:04:51,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 12:04:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:51,330 INFO L225 Difference]: With dead ends: 17077 [2019-12-07 12:04:51,330 INFO L226 Difference]: Without dead ends: 16121 [2019-12-07 12:04:51,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:51,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16121 states. [2019-12-07 12:04:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16121 to 15607. [2019-12-07 12:04:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15607 states. [2019-12-07 12:04:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15607 states to 15607 states and 48619 transitions. [2019-12-07 12:04:51,585 INFO L78 Accepts]: Start accepts. Automaton has 15607 states and 48619 transitions. Word has length 34 [2019-12-07 12:04:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:51,585 INFO L462 AbstractCegarLoop]: Abstraction has 15607 states and 48619 transitions. [2019-12-07 12:04:51,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 15607 states and 48619 transitions. [2019-12-07 12:04:51,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:04:51,599 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:51,599 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:51,599 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:51,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash 730447546, now seen corresponding path program 1 times [2019-12-07 12:04:51,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:51,600 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148836552] [2019-12-07 12:04:51,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:51,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:51,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148836552] [2019-12-07 12:04:51,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:51,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:04:51,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187860163] [2019-12-07 12:04:51,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:04:51,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:04:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:51,657 INFO L87 Difference]: Start difference. First operand 15607 states and 48619 transitions. Second operand 7 states. [2019-12-07 12:04:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:51,987 INFO L93 Difference]: Finished difference Result 19333 states and 58585 transitions. [2019-12-07 12:04:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:04:51,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 12:04:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:52,009 INFO L225 Difference]: With dead ends: 19333 [2019-12-07 12:04:52,009 INFO L226 Difference]: Without dead ends: 18905 [2019-12-07 12:04:52,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-07 12:04:52,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18905 states. [2019-12-07 12:04:52,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18905 to 15626. [2019-12-07 12:04:52,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15626 states. [2019-12-07 12:04:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15626 states to 15626 states and 48587 transitions. [2019-12-07 12:04:52,287 INFO L78 Accepts]: Start accepts. Automaton has 15626 states and 48587 transitions. Word has length 43 [2019-12-07 12:04:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:52,287 INFO L462 AbstractCegarLoop]: Abstraction has 15626 states and 48587 transitions. [2019-12-07 12:04:52,288 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:04:52,288 INFO L276 IsEmpty]: Start isEmpty. Operand 15626 states and 48587 transitions. [2019-12-07 12:04:52,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 12:04:52,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:52,302 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:52,302 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:52,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:52,302 INFO L82 PathProgramCache]: Analyzing trace with hash 2106102698, now seen corresponding path program 2 times [2019-12-07 12:04:52,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:52,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753328851] [2019-12-07 12:04:52,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:52,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:52,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753328851] [2019-12-07 12:04:52,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:52,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:04:52,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850786441] [2019-12-07 12:04:52,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:04:52,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:52,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:04:52,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:52,353 INFO L87 Difference]: Start difference. First operand 15626 states and 48587 transitions. Second operand 7 states. [2019-12-07 12:04:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:52,776 INFO L93 Difference]: Finished difference Result 18196 states and 55386 transitions. [2019-12-07 12:04:52,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:04:52,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 12:04:52,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:52,795 INFO L225 Difference]: With dead ends: 18196 [2019-12-07 12:04:52,795 INFO L226 Difference]: Without dead ends: 17389 [2019-12-07 12:04:52,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-12-07 12:04:52,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17389 states. [2019-12-07 12:04:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17389 to 14541. [2019-12-07 12:04:53,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14541 states. [2019-12-07 12:04:53,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14541 states to 14541 states and 45835 transitions. [2019-12-07 12:04:53,047 INFO L78 Accepts]: Start accepts. Automaton has 14541 states and 45835 transitions. Word has length 43 [2019-12-07 12:04:53,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:53,047 INFO L462 AbstractCegarLoop]: Abstraction has 14541 states and 45835 transitions. [2019-12-07 12:04:53,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:04:53,047 INFO L276 IsEmpty]: Start isEmpty. Operand 14541 states and 45835 transitions. [2019-12-07 12:04:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:04:53,060 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:53,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:53,060 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1441960170, now seen corresponding path program 1 times [2019-12-07 12:04:53,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:53,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426187011] [2019-12-07 12:04:53,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:53,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426187011] [2019-12-07 12:04:53,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:53,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:04:53,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645466422] [2019-12-07 12:04:53,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:04:53,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:53,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:04:53,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:04:53,107 INFO L87 Difference]: Start difference. First operand 14541 states and 45835 transitions. Second operand 5 states. [2019-12-07 12:04:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:53,832 INFO L93 Difference]: Finished difference Result 23915 states and 73477 transitions. [2019-12-07 12:04:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 12:04:53,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-07 12:04:53,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:53,861 INFO L225 Difference]: With dead ends: 23915 [2019-12-07 12:04:53,861 INFO L226 Difference]: Without dead ends: 23915 [2019-12-07 12:04:53,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:04:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23915 states. [2019-12-07 12:04:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23915 to 20226. [2019-12-07 12:04:54,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20226 states. [2019-12-07 12:04:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20226 states to 20226 states and 63120 transitions. [2019-12-07 12:04:54,223 INFO L78 Accepts]: Start accepts. Automaton has 20226 states and 63120 transitions. Word has length 44 [2019-12-07 12:04:54,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:54,223 INFO L462 AbstractCegarLoop]: Abstraction has 20226 states and 63120 transitions. [2019-12-07 12:04:54,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:04:54,223 INFO L276 IsEmpty]: Start isEmpty. Operand 20226 states and 63120 transitions. [2019-12-07 12:04:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-07 12:04:54,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:54,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:54,242 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:54,242 INFO L82 PathProgramCache]: Analyzing trace with hash 707630878, now seen corresponding path program 2 times [2019-12-07 12:04:54,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:54,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930628306] [2019-12-07 12:04:54,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:54,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930628306] [2019-12-07 12:04:54,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:54,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:04:54,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125854453] [2019-12-07 12:04:54,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:54,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:54,269 INFO L87 Difference]: Start difference. First operand 20226 states and 63120 transitions. Second operand 3 states. [2019-12-07 12:04:54,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:54,312 INFO L93 Difference]: Finished difference Result 14541 states and 45022 transitions. [2019-12-07 12:04:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:54,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-12-07 12:04:54,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:54,331 INFO L225 Difference]: With dead ends: 14541 [2019-12-07 12:04:54,331 INFO L226 Difference]: Without dead ends: 14541 [2019-12-07 12:04:54,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:54,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14541 states. [2019-12-07 12:04:54,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14541 to 14321. [2019-12-07 12:04:54,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14321 states. [2019-12-07 12:04:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14321 states to 14321 states and 44382 transitions. [2019-12-07 12:04:54,569 INFO L78 Accepts]: Start accepts. Automaton has 14321 states and 44382 transitions. Word has length 44 [2019-12-07 12:04:54,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:54,569 INFO L462 AbstractCegarLoop]: Abstraction has 14321 states and 44382 transitions. [2019-12-07 12:04:54,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:54,570 INFO L276 IsEmpty]: Start isEmpty. Operand 14321 states and 44382 transitions. [2019-12-07 12:04:54,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 12:04:54,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:54,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:54,583 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:54,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:54,583 INFO L82 PathProgramCache]: Analyzing trace with hash -696296869, now seen corresponding path program 1 times [2019-12-07 12:04:54,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:54,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326500498] [2019-12-07 12:04:54,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:54,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326500498] [2019-12-07 12:04:54,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:54,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:04:54,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527847228] [2019-12-07 12:04:54,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:04:54,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:04:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:54,629 INFO L87 Difference]: Start difference. First operand 14321 states and 44382 transitions. Second operand 6 states. [2019-12-07 12:04:54,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:54,694 INFO L93 Difference]: Finished difference Result 13348 states and 42035 transitions. [2019-12-07 12:04:54,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:04:54,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-07 12:04:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:54,699 INFO L225 Difference]: With dead ends: 13348 [2019-12-07 12:04:54,700 INFO L226 Difference]: Without dead ends: 4680 [2019-12-07 12:04:54,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:04:54,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4680 states. [2019-12-07 12:04:54,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4680 to 4680. [2019-12-07 12:04:54,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4680 states. [2019-12-07 12:04:54,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4680 states to 4680 states and 15004 transitions. [2019-12-07 12:04:54,776 INFO L78 Accepts]: Start accepts. Automaton has 4680 states and 15004 transitions. Word has length 45 [2019-12-07 12:04:54,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:54,776 INFO L462 AbstractCegarLoop]: Abstraction has 4680 states and 15004 transitions. [2019-12-07 12:04:54,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:04:54,776 INFO L276 IsEmpty]: Start isEmpty. Operand 4680 states and 15004 transitions. [2019-12-07 12:04:54,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:04:54,779 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:54,779 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:54,780 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:54,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:54,780 INFO L82 PathProgramCache]: Analyzing trace with hash -487804996, now seen corresponding path program 1 times [2019-12-07 12:04:54,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:54,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209392032] [2019-12-07 12:04:54,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:04:54,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:04:54,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209392032] [2019-12-07 12:04:54,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:04:54,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:04:54,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295080586] [2019-12-07 12:04:54,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:04:54,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 12:04:54,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:04:54,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:54,805 INFO L87 Difference]: Start difference. First operand 4680 states and 15004 transitions. Second operand 3 states. [2019-12-07 12:04:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:04:54,845 INFO L93 Difference]: Finished difference Result 6432 states and 20080 transitions. [2019-12-07 12:04:54,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:04:54,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 12:04:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:04:54,852 INFO L225 Difference]: With dead ends: 6432 [2019-12-07 12:04:54,852 INFO L226 Difference]: Without dead ends: 6432 [2019-12-07 12:04:54,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:04:54,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6432 states. [2019-12-07 12:04:54,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6432 to 5688. [2019-12-07 12:04:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5688 states. [2019-12-07 12:04:54,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5688 states to 5688 states and 17944 transitions. [2019-12-07 12:04:54,944 INFO L78 Accepts]: Start accepts. Automaton has 5688 states and 17944 transitions. Word has length 59 [2019-12-07 12:04:54,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:04:54,944 INFO L462 AbstractCegarLoop]: Abstraction has 5688 states and 17944 transitions. [2019-12-07 12:04:54,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:04:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 5688 states and 17944 transitions. [2019-12-07 12:04:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 12:04:54,948 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:04:54,949 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:04:54,949 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:04:54,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:04:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1265178387, now seen corresponding path program 1 times [2019-12-07 12:04:54,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 12:04:54,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055978022] [2019-12-07 12:04:54,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:04:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:04:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:04:55,026 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 12:04:55,026 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:04:55,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t725~0.base_21|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t725~0.base_21| 4)) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21| 1)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= 0 |v_ULTIMATE.start_main_~#t725~0.offset_16|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= (select .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21|) 0) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21|) |v_ULTIMATE.start_main_~#t725~0.offset_16| 0)) |v_#memory_int_27|) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_17|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t725~0.offset=|v_ULTIMATE.start_main_~#t725~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_17|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t725~0.base=|v_ULTIMATE.start_main_~#t725~0.base_21|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t726~0.offset, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t727~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t725~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t728~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t728~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t725~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t727~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t726~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:04:55,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10|) |v_ULTIMATE.start_main_~#t726~0.offset_10| 1)) |v_#memory_int_21|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t726~0.base_10| 4) |v_#length_23|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t726~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t726~0.base_10| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t726~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t726~0.offset, ULTIMATE.start_main_~#t726~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:04:55,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t727~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t727~0.offset_10|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11|) |v_ULTIMATE.start_main_~#t727~0.offset_10| 2))) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t727~0.base_11| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t727~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t727~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t727~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:04:55,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:04:55,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t728~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t728~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t728~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11|) |v_ULTIMATE.start_main_~#t728~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t728~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t728~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t728~0.offset] because there is no mapped edge [2019-12-07 12:04:55,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out1424065344| |P3Thread1of1ForFork0_#t~ite32_Out1424065344|)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In1424065344 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1424065344 256) 0))) (or (and .cse0 (= ~y~0_In1424065344 |P3Thread1of1ForFork0_#t~ite32_Out1424065344|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= ~y$w_buff1~0_In1424065344 |P3Thread1of1ForFork0_#t~ite32_Out1424065344|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1424065344, ~y$w_buff1~0=~y$w_buff1~0_In1424065344, ~y~0=~y~0_In1424065344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1424065344, ~y$w_buff1~0=~y$w_buff1~0_In1424065344, ~y~0=~y~0_In1424065344, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1424065344|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1424065344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 12:04:55,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 12:04:55,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1751836296 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1751836296 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1751836296| ~y$w_buff0_used~0_In1751836296) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1751836296|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1751836296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1751836296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1751836296|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 12:04:55,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-211499326 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In-211499326 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-211499326 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-211499326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-211499326|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-211499326 |P3Thread1of1ForFork0_#t~ite35_Out-211499326|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-211499326, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-211499326, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-211499326, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-211499326, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-211499326|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 12:04:55,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In-572789 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-572789 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-572789|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In-572789 |P3Thread1of1ForFork0_#t~ite36_Out-572789|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-572789|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 12:04:55,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In6878931 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In6878931 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In6878931 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In6878931 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out6878931|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd4~0_In6878931 |P3Thread1of1ForFork0_#t~ite37_Out6878931|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out6878931|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 12:04:55,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:04:55,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1115873471 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out1115873471| ~y$w_buff1~0_In1115873471) (= |P1Thread1of1ForFork2_#t~ite11_In1115873471| |P1Thread1of1ForFork2_#t~ite11_Out1115873471|)) (and (= ~y$w_buff1~0_In1115873471 |P1Thread1of1ForFork2_#t~ite11_Out1115873471|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1115873471 256)))) (or (= (mod ~y$w_buff0_used~0_In1115873471 256) 0) (and (= (mod ~y$w_buff1_used~0_In1115873471 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1115873471 256))))) (= |P1Thread1of1ForFork2_#t~ite12_Out1115873471| |P1Thread1of1ForFork2_#t~ite11_Out1115873471|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1115873471, ~y$w_buff1~0=~y$w_buff1~0_In1115873471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1115873471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1115873471, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1115873471|, ~weak$$choice2~0=~weak$$choice2~0_In1115873471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115873471} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1115873471, ~y$w_buff1~0=~y$w_buff1~0_In1115873471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1115873471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1115873471, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1115873471|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1115873471|, ~weak$$choice2~0=~weak$$choice2~0_In1115873471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115873471} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 12:04:55,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1423016518 256)))) (or (and (= ~y$w_buff0_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite15_Out1423016518|) (= |P1Thread1of1ForFork2_#t~ite14_In1423016518| |P1Thread1of1ForFork2_#t~ite14_Out1423016518|) (not .cse0)) (and .cse0 (= ~y$w_buff0_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite14_Out1423016518|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1423016518 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1423016518 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1423016518 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1423016518 256) 0)))) (= |P1Thread1of1ForFork2_#t~ite14_Out1423016518| |P1Thread1of1ForFork2_#t~ite15_Out1423016518|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1423016518|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 12:04:55,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 12:04:55,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-696570084 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-696570084| ~y$r_buff1_thd2~0_In-696570084) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-696570084| |P1Thread1of1ForFork2_#t~ite23_Out-696570084|)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-696570084| |P1Thread1of1ForFork2_#t~ite23_Out-696570084|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-696570084 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-696570084 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-696570084 256))) (= (mod ~y$w_buff0_used~0_In-696570084 256) 0))) (= ~y$r_buff1_thd2~0_In-696570084 |P1Thread1of1ForFork2_#t~ite23_Out-696570084|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-696570084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-696570084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696570084, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-696570084|, ~weak$$choice2~0=~weak$$choice2~0_In-696570084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696570084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-696570084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-696570084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696570084, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-696570084|, ~weak$$choice2~0=~weak$$choice2~0_In-696570084, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-696570084|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696570084} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 12:04:55,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:04:55,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1421410405 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1421410405 256)))) (or (and (= ~y$w_buff0_used~0_In-1421410405 |P2Thread1of1ForFork3_#t~ite28_Out-1421410405|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1421410405|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1421410405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1421410405} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1421410405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1421410405, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1421410405|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 12:04:55,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-84859877 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-84859877 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-84859877 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-84859877 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-84859877| ~y$w_buff1_used~0_In-84859877) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-84859877|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-84859877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-84859877, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-84859877|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 12:04:55,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1229074567 256))) (.cse2 (= ~y$r_buff0_thd3~0_Out1229074567 ~y$r_buff0_thd3~0_In1229074567)) (.cse1 (= (mod ~y$w_buff0_used~0_In1229074567 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1229074567 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1229074567} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1229074567|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1229074567} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:04:55,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1545549951 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1545549951 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1545549951 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1545549951 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1545549951| ~y$r_buff1_thd3~0_In-1545549951) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1545549951| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1545549951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1545549951, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1545549951, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1545549951} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1545549951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1545549951, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1545549951, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1545549951|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1545549951} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 12:04:55,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 12:04:55,041 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:04:55,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1098839980 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1098839980 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite43_Out-1098839980| |ULTIMATE.start_main_#t~ite42_Out-1098839980|))) (or (and (or .cse0 .cse1) (= ~y~0_In-1098839980 |ULTIMATE.start_main_#t~ite42_Out-1098839980|) .cse2) (and (= |ULTIMATE.start_main_#t~ite42_Out-1098839980| ~y$w_buff1~0_In-1098839980) (not .cse1) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1098839980, ~y~0=~y~0_In-1098839980, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098839980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098839980} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1098839980, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1098839980|, ~y~0=~y~0_In-1098839980, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1098839980|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098839980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098839980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:04:55,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In376260199 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In376260199 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In376260199 |ULTIMATE.start_main_#t~ite44_Out376260199|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out376260199|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In376260199} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In376260199, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out376260199|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:04:55,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1758039681 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1758039681 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1758039681 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1758039681 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1758039681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1758039681 |ULTIMATE.start_main_#t~ite45_Out-1758039681|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758039681, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758039681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758039681, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758039681, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1758039681|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:04:55,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1606857859 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1606857859 256)))) (or (and (= ~y$r_buff0_thd0~0_In1606857859 |ULTIMATE.start_main_#t~ite46_Out1606857859|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1606857859|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1606857859|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 12:04:55,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1148785092 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1148785092 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1148785092 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1148785092 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out1148785092| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1148785092 |ULTIMATE.start_main_#t~ite47_Out1148785092|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1148785092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1148785092|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1148785092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 12:04:55,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:04:55,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:04:55 BasicIcfg [2019-12-07 12:04:55,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:04:55,112 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:04:55,112 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:04:55,112 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:04:55,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:59:19" (3/4) ... [2019-12-07 12:04:55,114 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:04:55,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] ULTIMATE.startENTRY-->L841: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$mem_tmp~0_52 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t725~0.base_21|) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff1_thd0~0_155 0) (= v_~y$r_buff0_thd0~0_159 0) (= v_~y$w_buff1_used~0_637 0) (= v_~y$read_delayed~0_8 0) (= v_~main$tmp_guard0~0_27 0) (= 0 v_~__unbuffered_p3_EBX~0_27) (= 0 v_~y$r_buff1_thd3~0_151) (= 0 v_~y$r_buff0_thd4~0_154) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_p3_EAX~0_27) (= 0 v_~y$r_buff0_thd2~0_336) (= 0 v_~y$r_buff1_thd4~0_190) (= v_~y~0_177 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$flush_delayed~0_106 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t725~0.base_21| 4)) (= v_~weak$$choice2~0_150 0) (= v_~y$w_buff1~0_392 0) (= 0 v_~y$r_buff1_thd2~0_255) (= |v_#valid_66| (store .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21| 1)) (= 0 v_~y$r_buff0_thd3~0_211) (= v_~a~0_32 0) (= 0 |v_ULTIMATE.start_main_~#t725~0.offset_16|) (= v_~__unbuffered_cnt~0_242 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_105 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~__unbuffered_p1_EAX~0_27) (= (select .cse0 |v_ULTIMATE.start_main_~#t725~0.base_21|) 0) (= v_~y$w_buff0_used~0_880 0) (= 0 v_~y$w_buff0~0_485) (= 0 v_~weak$$choice0~0_13) (= 0 v_~y$r_buff1_thd1~0_85) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t725~0.base_21|) |v_ULTIMATE.start_main_~#t725~0.offset_16| 0)) |v_#memory_int_27|) (= v_~y$r_buff0_thd1~0_54 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_70|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_92|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_17|, ~a~0=v_~a~0_32, ~y$mem_tmp~0=v_~y$mem_tmp~0_52, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_151, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_54, ~y$flush_delayed~0=v_~y$flush_delayed~0_106, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_27, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_190, ~y$w_buff1~0=v_~y$w_buff1~0_392, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_336, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_242, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_155, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t725~0.offset=|v_ULTIMATE.start_main_~#t725~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_22|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_880, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_46|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_17|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_52|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_52|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_85, ~y$w_buff0~0=v_~y$w_buff0~0_485, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_211, ULTIMATE.start_main_~#t725~0.base=|v_ULTIMATE.start_main_~#t725~0.base_21|, ~y~0=v_~y~0_177, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_22|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_27, #NULL.base=|v_#NULL.base_5|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_255, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_154, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_21|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_159, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ULTIMATE.start_main_~#t726~0.offset, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t727~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t725~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t728~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t728~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t725~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t727~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t726~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 12:04:55,115 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L841-1-->L843: Formula: (and (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t726~0.base_10|) |v_ULTIMATE.start_main_~#t726~0.offset_10| 1)) |v_#memory_int_21|) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10|) 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t726~0.base_10| 4) |v_#length_23|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t726~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t726~0.base_10| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t726~0.base_10| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t726~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t726~0.offset=|v_ULTIMATE.start_main_~#t726~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t726~0.base=|v_ULTIMATE.start_main_~#t726~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t726~0.offset, ULTIMATE.start_main_~#t726~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-07 12:04:55,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L843-1-->L845: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t727~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t727~0.offset_10|) (= |v_#memory_int_19| (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t727~0.base_11|) |v_ULTIMATE.start_main_~#t727~0.offset_10| 2))) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t727~0.base_11| 4)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t727~0.base_11|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t727~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t727~0.offset=|v_ULTIMATE.start_main_~#t727~0.offset_10|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t727~0.base=|v_ULTIMATE.start_main_~#t727~0.base_11|, #length=|v_#length_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t727~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t727~0.base, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-07 12:04:55,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L795: Formula: (and (= v_~y$r_buff0_thd1~0_10 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_44 1) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_54) (= v_~y$r_buff0_thd4~0_33 v_~y$r_buff1_thd4~0_33) (= v_~y$r_buff0_thd3~0_45 v_~y$r_buff1_thd3~0_21) (= v_~z~0_14 1) (= v_~y$r_buff0_thd0~0_33 v_~y$r_buff1_thd0~0_32) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40 0))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_45, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_54, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_33, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_33, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_44, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_33, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_10, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_40, ~z~0=v_~z~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_32} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 12:04:55,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L845-1-->L847: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11|)) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t728~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t728~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t728~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t728~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t728~0.base_11|) |v_ULTIMATE.start_main_~#t728~0.offset_10| 3)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t728~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t728~0.base=|v_ULTIMATE.start_main_~#t728~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_~#t728~0.offset=|v_ULTIMATE.start_main_~#t728~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t728~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t728~0.offset] because there is no mapped edge [2019-12-07 12:04:55,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out1424065344| |P3Thread1of1ForFork0_#t~ite32_Out1424065344|)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In1424065344 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In1424065344 256) 0))) (or (and .cse0 (= ~y~0_In1424065344 |P3Thread1of1ForFork0_#t~ite32_Out1424065344|) (or .cse1 .cse2)) (and .cse0 (not .cse2) (not .cse1) (= ~y$w_buff1~0_In1424065344 |P3Thread1of1ForFork0_#t~ite32_Out1424065344|)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1424065344, ~y$w_buff1~0=~y$w_buff1~0_In1424065344, ~y~0=~y~0_In1424065344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1424065344, ~y$w_buff1~0=~y$w_buff1~0_In1424065344, ~y~0=~y~0_In1424065344, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out1424065344|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out1424065344|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1424065344} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-07 12:04:55,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~a~0_20 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{~a~0=v_~a~0_20, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_28, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 12:04:55,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1751836296 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In1751836296 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite34_Out1751836296| ~y$w_buff0_used~0_In1751836296) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out1751836296|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1751836296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1751836296, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1751836296, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out1751836296|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-07 12:04:55,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-211499326 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In-211499326 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-211499326 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-211499326 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out-211499326|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-211499326 |P3Thread1of1ForFork0_#t~ite35_Out-211499326|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-211499326, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-211499326, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-211499326, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-211499326, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-211499326, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out-211499326|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-211499326} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-07 12:04:55,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In-572789 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-572789 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-572789|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In-572789 |P3Thread1of1ForFork0_#t~ite36_Out-572789|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-572789, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-572789, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-572789|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-07 12:04:55,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L822-->L822-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In6878931 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In6878931 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In6878931 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In6878931 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite37_Out6878931|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd4~0_In6878931 |P3Thread1of1ForFork0_#t~ite37_Out6878931|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In6878931, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In6878931, ~y$w_buff0_used~0=~y$w_buff0_used~0_In6878931, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out6878931|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In6878931} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-07 12:04:55,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L822-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#t~ite37_40| v_~y$r_buff1_thd4~0_62) (= |v_P3Thread1of1ForFork0_#res.base_3| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_87 1) v_~__unbuffered_cnt~0_86)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_62, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_3|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_39|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 12:04:55,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1115873471 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite12_Out1115873471| ~y$w_buff1~0_In1115873471) (= |P1Thread1of1ForFork2_#t~ite11_In1115873471| |P1Thread1of1ForFork2_#t~ite11_Out1115873471|)) (and (= ~y$w_buff1~0_In1115873471 |P1Thread1of1ForFork2_#t~ite11_Out1115873471|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1115873471 256)))) (or (= (mod ~y$w_buff0_used~0_In1115873471 256) 0) (and (= (mod ~y$w_buff1_used~0_In1115873471 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1115873471 256))))) (= |P1Thread1of1ForFork2_#t~ite12_Out1115873471| |P1Thread1of1ForFork2_#t~ite11_Out1115873471|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1115873471, ~y$w_buff1~0=~y$w_buff1~0_In1115873471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1115873471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1115873471, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In1115873471|, ~weak$$choice2~0=~weak$$choice2~0_In1115873471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115873471} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1115873471, ~y$w_buff1~0=~y$w_buff1~0_In1115873471, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1115873471, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1115873471, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1115873471|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1115873471|, ~weak$$choice2~0=~weak$$choice2~0_In1115873471, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1115873471} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 12:04:55,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L761-->L761-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1423016518 256)))) (or (and (= ~y$w_buff0_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite15_Out1423016518|) (= |P1Thread1of1ForFork2_#t~ite14_In1423016518| |P1Thread1of1ForFork2_#t~ite14_Out1423016518|) (not .cse0)) (and .cse0 (= ~y$w_buff0_used~0_In1423016518 |P1Thread1of1ForFork2_#t~ite14_Out1423016518|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1423016518 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1423016518 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1423016518 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In1423016518 256) 0)))) (= |P1Thread1of1ForFork2_#t~ite14_Out1423016518| |P1Thread1of1ForFork2_#t~ite15_Out1423016518|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1423016518, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1423016518, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1423016518, ~weak$$choice2~0=~weak$$choice2~0_In1423016518, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1423016518|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1423016518|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1423016518} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-07 12:04:55,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L764: Formula: (and (= v_~y$r_buff0_thd2~0_95 v_~y$r_buff0_thd2~0_94) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_95, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_94, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_7|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_6|, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-07 12:04:55,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-696570084 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-696570084| ~y$r_buff1_thd2~0_In-696570084) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-696570084| |P1Thread1of1ForFork2_#t~ite23_Out-696570084|)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out-696570084| |P1Thread1of1ForFork2_#t~ite23_Out-696570084|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-696570084 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-696570084 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-696570084 256))) (= (mod ~y$w_buff0_used~0_In-696570084 256) 0))) (= ~y$r_buff1_thd2~0_In-696570084 |P1Thread1of1ForFork2_#t~ite23_Out-696570084|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-696570084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-696570084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696570084, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-696570084|, ~weak$$choice2~0=~weak$$choice2~0_In-696570084, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696570084} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-696570084, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-696570084, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-696570084, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-696570084|, ~weak$$choice2~0=~weak$$choice2~0_In-696570084, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-696570084|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-696570084} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 12:04:55,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L766-->L774: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= v_~y~0_51 v_~y$mem_tmp~0_7) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~y~0=v_~y~0_51, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:04:55,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1421410405 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1421410405 256)))) (or (and (= ~y$w_buff0_used~0_In-1421410405 |P2Thread1of1ForFork3_#t~ite28_Out-1421410405|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork3_#t~ite28_Out-1421410405|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1421410405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1421410405} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1421410405, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1421410405, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1421410405|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 12:04:55,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd3~0_In-84859877 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-84859877 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-84859877 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-84859877 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-84859877| ~y$w_buff1_used~0_In-84859877) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite29_Out-84859877|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-84859877, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-84859877, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-84859877, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-84859877, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-84859877|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-84859877} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-07 12:04:55,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1229074567 256))) (.cse2 (= ~y$r_buff0_thd3~0_Out1229074567 ~y$r_buff0_thd3~0_In1229074567)) (.cse1 (= (mod ~y$w_buff0_used~0_In1229074567 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1229074567 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1229074567} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1229074567|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1229074567, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1229074567} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-07 12:04:55,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1545549951 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1545549951 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1545549951 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1545549951 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1545549951| ~y$r_buff1_thd3~0_In-1545549951) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork3_#t~ite31_Out-1545549951| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1545549951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1545549951, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1545549951, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1545549951} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1545549951, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1545549951, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1545549951, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1545549951|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1545549951} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-07 12:04:55,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L799-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_128 (+ v_~__unbuffered_cnt~0_129 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_60) (= 0 |v_P2Thread1of1ForFork3_#res.base_3|) (= |v_P2Thread1of1ForFork3_#res.offset_3| 0)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_129} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_60, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_3|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 12:04:55,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L847-1-->L853: Formula: (and (= (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_30) 1 0)) 0 1) v_~main$tmp_guard0~0_10) (not (= (mod v_~main$tmp_guard0~0_10 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:04:55,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L853-2-->L853-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1098839980 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1098839980 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite43_Out-1098839980| |ULTIMATE.start_main_#t~ite42_Out-1098839980|))) (or (and (or .cse0 .cse1) (= ~y~0_In-1098839980 |ULTIMATE.start_main_#t~ite42_Out-1098839980|) .cse2) (and (= |ULTIMATE.start_main_#t~ite42_Out-1098839980| ~y$w_buff1~0_In-1098839980) (not .cse1) (not .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1098839980, ~y~0=~y~0_In-1098839980, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098839980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098839980} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1098839980, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1098839980|, ~y~0=~y~0_In-1098839980, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1098839980|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1098839980, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1098839980} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 12:04:55,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In376260199 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In376260199 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In376260199 |ULTIMATE.start_main_#t~ite44_Out376260199|)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out376260199|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In376260199} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In376260199, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In376260199, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out376260199|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-07 12:04:55,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L855-->L855-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1758039681 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1758039681 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1758039681 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1758039681 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1758039681| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1758039681 |ULTIMATE.start_main_#t~ite45_Out-1758039681|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758039681, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758039681, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758039681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1758039681, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1758039681, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1758039681|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758039681} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-07 12:04:55,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L856-->L856-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1606857859 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1606857859 256)))) (or (and (= ~y$r_buff0_thd0~0_In1606857859 |ULTIMATE.start_main_#t~ite46_Out1606857859|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1606857859|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1606857859, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1606857859, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1606857859|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-07 12:04:55,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L857-->L857-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1148785092 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1148785092 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1148785092 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1148785092 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite47_Out1148785092| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1148785092 |ULTIMATE.start_main_#t~ite47_Out1148785092|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1148785092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1148785092, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1148785092, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1148785092|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1148785092, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1148785092} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 12:04:55,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L857-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_23 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_40|) (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p3_EAX~0_22) (= 0 v_~__unbuffered_p1_EAX~0_23) (= v_~x~0_41 2) (= v_~z~0_83 2) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_23)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_22, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_39|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~z~0=v_~z~0_83, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~x~0=v_~x~0_41, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:04:55,194 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_75b0bc0f-bd9c-4d03-9956-c8ac19d9baa0/bin/uautomizer/witness.graphml [2019-12-07 12:04:55,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:04:55,196 INFO L168 Benchmark]: Toolchain (without parser) took 336903.42 ms. Allocated memory was 1.0 GB in the beginning and 10.9 GB in the end (delta: 9.9 GB). Free memory was 932.6 MB in the beginning and 5.4 GB in the end (delta: -4.5 GB). Peak memory consumption was 5.4 GB. Max. memory is 11.5 GB. [2019-12-07 12:04:55,196 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:04:55,196 INFO L168 Benchmark]: CACSL2BoogieTranslator took 390.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -140.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 12:04:55,197 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:04:55,197 INFO L168 Benchmark]: Boogie Preprocessor took 24.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:04:55,197 INFO L168 Benchmark]: RCFGBuilder took 394.59 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 12:04:55,198 INFO L168 Benchmark]: TraceAbstraction took 335968.64 ms. Allocated memory was 1.1 GB in the beginning and 10.9 GB in the end (delta: 9.7 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. [2019-12-07 12:04:55,198 INFO L168 Benchmark]: Witness Printer took 82.62 ms. Allocated memory is still 10.9 GB. Free memory was 5.5 GB in the beginning and 5.4 GB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. [2019-12-07 12:04:55,200 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 390.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -140.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.28 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.99 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 394.59 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: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 335968.64 ms. Allocated memory was 1.1 GB in the beginning and 10.9 GB in the end (delta: 9.7 GB). Free memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.3 GB. Max. memory is 11.5 GB. * Witness Printer took 82.62 ms. Allocated memory is still 10.9 GB. Free memory was 5.5 GB in the beginning and 5.4 GB in the end (delta: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 180 ProgramPointsBefore, 90 ProgramPointsAfterwards, 208 TransitionsBefore, 97 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 26 ChoiceCompositions, 7595 VarBasedMoverChecksPositive, 274 VarBasedMoverChecksNegative, 123 SemBasedMoverChecksPositive, 221 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 0 MoverChecksTotal, 74757 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L841] FCALL, FORK 0 pthread_create(&t725, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L843] FCALL, FORK 0 pthread_create(&t726, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t727, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L847] FCALL, FORK 0 pthread_create(&t728, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] 4 z = 2 [L812] 4 __unbuffered_p3_EAX = z [L815] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L751] 2 x = 2 [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L820] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L821] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L853] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 335.8s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 82.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4172 SDtfs, 4234 SDslu, 7095 SDs, 0 SdLazy, 3939 SolverSat, 250 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550468occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 213.5s AutomataMinimizationTime, 25 MinimizatonAttempts, 668950 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 758 NumberOfCodeBlocks, 758 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 674 ConstructedInterpolants, 0 QuantifiedInterpolants, 104584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...