./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/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 e6415a83f8b72e031b48e9738d2e65e68a5d92e3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 13:35:54,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:35:54,607 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:35:54,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:35:54,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:35:54,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:35:54,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:35:54,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:35:54,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:35:54,620 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:35:54,621 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:35:54,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:35:54,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:35:54,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:35:54,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:35:54,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:35:54,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:35:54,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:35:54,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:35:54,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:35:54,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:35:54,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:35:54,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:35:54,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:35:54,633 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:35:54,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:35:54,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:35:54,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:35:54,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:35:54,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:35:54,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:35:54,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:35:54,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:35:54,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:35:54,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:35:54,637 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:35:54,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:35:54,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:35:54,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:35:54,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:35:54,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:35:54,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 13:35:54,648 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:35:54,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:35:54,649 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 13:35:54,649 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 13:35:54,650 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 13:35:54,650 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:35:54,650 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:35:54,650 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:35:54,650 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:35:54,650 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:35:54,650 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:35:54,650 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:35:54,651 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:35:54,651 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:35:54,651 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:35:54,651 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:35:54,651 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:35:54,651 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:35:54,651 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 13:35:54,651 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:35:54,652 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:35:54,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:35:54,652 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:35:54,652 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:35:54,652 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:35:54,652 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 13:35:54,652 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:35:54,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:35:54,653 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:35:54,653 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_3fa44148-20f0-4295-b1da-f01022112b3d/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 -> e6415a83f8b72e031b48e9738d2e65e68a5d92e3 [2019-12-07 13:35:54,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:35:54,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:35:54,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:35:54,793 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:35:54,793 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:35:54,794 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc.i [2019-12-07 13:35:54,838 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/data/6b2234243/7e3e16a1ff7a41e3b5363daee980f008/FLAGa5484d507 [2019-12-07 13:35:55,267 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:35:55,268 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/sv-benchmarks/c/pthread-wmm/safe026_power.oepc.i [2019-12-07 13:35:55,278 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/data/6b2234243/7e3e16a1ff7a41e3b5363daee980f008/FLAGa5484d507 [2019-12-07 13:35:55,613 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/data/6b2234243/7e3e16a1ff7a41e3b5363daee980f008 [2019-12-07 13:35:55,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:35:55,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:35:55,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:35:55,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:35:55,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:35:55,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:35:55" (1/1) ... [2019-12-07 13:35:55,623 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33714cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:55, skipping insertion in model container [2019-12-07 13:35:55,623 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:35:55" (1/1) ... [2019-12-07 13:35:55,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:35:55,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:35:55,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:35:55,949 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:35:55,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:35:56,037 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:35:56,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56 WrapperNode [2019-12-07 13:35:56,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:35:56,038 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:35:56,038 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:35:56,038 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:35:56,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:35:56,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:35:56,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:35:56,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:35:56,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,095 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,100 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... [2019-12-07 13:35:56,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:35:56,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:35:56,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:35:56,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:35:56,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:35:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:35:56,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:35:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:35:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:35:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:35:56,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:35:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:35:56,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:35:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:35:56,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:35:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:35:56,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:35:56,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:35:56,146 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 13:35:56,502 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:35:56,502 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:35:56,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:56 BoogieIcfgContainer [2019-12-07 13:35:56,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:35:56,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:35:56,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:35:56,507 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:35:56,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:35:55" (1/3) ... [2019-12-07 13:35:56,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35872597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:35:56, skipping insertion in model container [2019-12-07 13:35:56,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:35:56" (2/3) ... [2019-12-07 13:35:56,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35872597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:35:56, skipping insertion in model container [2019-12-07 13:35:56,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:56" (3/3) ... [2019-12-07 13:35:56,509 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc.i [2019-12-07 13:35:56,516 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:35:56,516 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:35:56,521 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:35:56,521 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:35:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,546 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,547 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,551 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,551 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,552 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,553 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,556 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,557 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,558 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,558 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,558 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,559 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,560 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,561 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,562 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,563 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,575 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,576 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:35:56,589 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:35:56,602 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:35:56,602 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:35:56,603 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:35:56,603 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:35:56,603 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:35:56,603 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:35:56,603 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:35:56,603 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:35:56,613 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-07 13:35:56,615 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 13:35:56,682 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 13:35:56,682 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:35:56,693 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:35:56,709 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 13:35:56,749 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 13:35:56,749 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:35:56,757 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 13:35:56,777 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 13:35:56,778 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:35:59,609 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 13:35:59,771 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 13:35:59,863 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-07 13:35:59,863 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 13:35:59,865 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-07 13:36:12,721 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-07 13:36:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-07 13:36:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 13:36:12,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:12,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 13:36:12,727 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:12,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:12,731 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-07 13:36:12,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:12,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946600266] [2019-12-07 13:36:12,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:12,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946600266] [2019-12-07 13:36:12,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:12,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:36:12,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891700948] [2019-12-07 13:36:12,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:12,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:12,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:12,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:12,879 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-07 13:36:13,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:13,539 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-07 13:36:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:13,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 13:36:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:13,940 INFO L225 Difference]: With dead ends: 108680 [2019-12-07 13:36:13,940 INFO L226 Difference]: Without dead ends: 102440 [2019-12-07 13:36:13,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-07 13:36:19,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-07 13:36:19,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-07 13:36:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-07 13:36:20,515 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-07 13:36:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:20,516 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-07 13:36:20,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-07 13:36:20,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 13:36:20,520 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:20,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:20,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:20,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:20,520 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-07 13:36:20,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:20,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125755121] [2019-12-07 13:36:20,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:20,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125755121] [2019-12-07 13:36:20,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:20,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:36:20,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290949254] [2019-12-07 13:36:20,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:20,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:20,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:20,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:20,592 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-07 13:36:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:21,503 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-07 13:36:21,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:21,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 13:36:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:21,907 INFO L225 Difference]: With dead ends: 163248 [2019-12-07 13:36:21,907 INFO L226 Difference]: Without dead ends: 163199 [2019-12-07 13:36:21,907 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:26,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-07 13:36:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-07 13:36:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-07 13:36:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-07 13:36:30,161 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-07 13:36:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:30,161 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-07 13:36:30,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-07 13:36:30,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:36:30,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:30,166 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:30,166 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:30,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:30,167 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-07 13:36:30,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:30,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002466722] [2019-12-07 13:36:30,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:30,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:30,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002466722] [2019-12-07 13:36:30,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:30,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:36:30,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389272676] [2019-12-07 13:36:30,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:30,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:30,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:30,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:30,233 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-07 13:36:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:31,555 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-07 13:36:31,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:31,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:36:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:32,113 INFO L225 Difference]: With dead ends: 208779 [2019-12-07 13:36:32,113 INFO L226 Difference]: Without dead ends: 208723 [2019-12-07 13:36:32,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-07 13:36:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-07 13:36:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-07 13:36:41,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-07 13:36:41,835 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-07 13:36:41,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:41,836 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-07 13:36:41,836 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:41,836 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-07 13:36:41,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 13:36:41,844 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:41,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:41,844 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:41,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:41,844 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-07 13:36:41,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:41,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605550796] [2019-12-07 13:36:41,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:41,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605550796] [2019-12-07 13:36:41,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:41,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:41,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732275952] [2019-12-07 13:36:41,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:36:41,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:41,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:36:41,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:41,898 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-07 13:36:43,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:43,149 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-07 13:36:43,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:36:43,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 13:36:43,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:44,193 INFO L225 Difference]: With dead ends: 234922 [2019-12-07 13:36:44,194 INFO L226 Difference]: Without dead ends: 234922 [2019-12-07 13:36:44,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:36:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-07 13:36:51,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-07 13:36:51,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-07 13:36:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-07 13:36:52,516 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-07 13:36:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:52,516 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-07 13:36:52,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:36:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-07 13:36:52,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 13:36:52,530 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:52,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:52,530 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:52,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:52,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-07 13:36:52,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:52,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202908045] [2019-12-07 13:36:52,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:52,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202908045] [2019-12-07 13:36:52,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:52,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:52,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956906855] [2019-12-07 13:36:52,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:36:52,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:52,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:36:52,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:36:52,589 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 4 states. [2019-12-07 13:36:53,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:53,104 INFO L93 Difference]: Finished difference Result 50544 states and 172360 transitions. [2019-12-07 13:36:53,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:36:53,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 13:36:53,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:53,165 INFO L225 Difference]: With dead ends: 50544 [2019-12-07 13:36:53,165 INFO L226 Difference]: Without dead ends: 38483 [2019-12-07 13:36:53,166 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38483 states. [2019-12-07 13:36:53,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38483 to 38347. [2019-12-07 13:36:53,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-07 13:36:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-07 13:36:53,775 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 18 [2019-12-07 13:36:53,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:53,775 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-07 13:36:53,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:36:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-07 13:36:53,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:36:53,780 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:53,780 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 13:36:53,780 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:53,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:53,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-07 13:36:53,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:53,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483023300] [2019-12-07 13:36:53,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:53,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483023300] [2019-12-07 13:36:53,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:53,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:53,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213568042] [2019-12-07 13:36:53,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:36:53,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:53,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:36:53,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:53,836 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-07 13:36:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:54,545 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-07 13:36:54,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:36:54,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 13:36:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:54,628 INFO L225 Difference]: With dead ends: 58112 [2019-12-07 13:36:54,629 INFO L226 Difference]: Without dead ends: 58056 [2019-12-07 13:36:54,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:36:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-07 13:36:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-07 13:36:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-07 13:36:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-07 13:36:55,385 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-07 13:36:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:55,385 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-07 13:36:55,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:36:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-07 13:36:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:36:55,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:55,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:55,394 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:55,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:55,394 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-07 13:36:55,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:55,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731842325] [2019-12-07 13:36:55,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:55,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731842325] [2019-12-07 13:36:55,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:55,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:36:55,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208876959] [2019-12-07 13:36:55,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:36:55,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:55,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:36:55,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:55,436 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 5 states. [2019-12-07 13:36:55,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:55,826 INFO L93 Difference]: Finished difference Result 54188 states and 170191 transitions. [2019-12-07 13:36:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 13:36:55,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:36:55,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:55,909 INFO L225 Difference]: With dead ends: 54188 [2019-12-07 13:36:55,909 INFO L226 Difference]: Without dead ends: 54175 [2019-12-07 13:36:55,910 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 13:36:56,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54175 states. [2019-12-07 13:36:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54175 to 45950. [2019-12-07 13:36:56,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45950 states. [2019-12-07 13:36:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45950 states to 45950 states and 146719 transitions. [2019-12-07 13:36:56,693 INFO L78 Accepts]: Start accepts. Automaton has 45950 states and 146719 transitions. Word has length 25 [2019-12-07 13:36:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:56,693 INFO L462 AbstractCegarLoop]: Abstraction has 45950 states and 146719 transitions. [2019-12-07 13:36:56,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:36:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 45950 states and 146719 transitions. [2019-12-07 13:36:56,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 13:36:56,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:56,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:36:56,705 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:56,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:56,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-07 13:36:56,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:56,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186501747] [2019-12-07 13:36:56,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:56,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:56,899 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2019-12-07 13:36:56,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:56,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186501747] [2019-12-07 13:36:56,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:56,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:56,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929324337] [2019-12-07 13:36:56,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:36:56,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:56,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:36:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:36:56,902 INFO L87 Difference]: Start difference. First operand 45950 states and 146719 transitions. Second operand 6 states. [2019-12-07 13:36:57,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:57,426 INFO L93 Difference]: Finished difference Result 65294 states and 203497 transitions. [2019-12-07 13:36:57,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 13:36:57,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 13:36:57,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:57,517 INFO L225 Difference]: With dead ends: 65294 [2019-12-07 13:36:57,517 INFO L226 Difference]: Without dead ends: 64946 [2019-12-07 13:36:57,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:36:57,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64946 states. [2019-12-07 13:36:58,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64946 to 50721. [2019-12-07 13:36:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50721 states. [2019-12-07 13:36:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50721 states to 50721 states and 161063 transitions. [2019-12-07 13:36:58,418 INFO L78 Accepts]: Start accepts. Automaton has 50721 states and 161063 transitions. Word has length 27 [2019-12-07 13:36:58,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:58,419 INFO L462 AbstractCegarLoop]: Abstraction has 50721 states and 161063 transitions. [2019-12-07 13:36:58,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:36:58,419 INFO L276 IsEmpty]: Start isEmpty. Operand 50721 states and 161063 transitions. [2019-12-07 13:36:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 13:36:58,432 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:58,432 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 13:36:58,433 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:58,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:58,433 INFO L82 PathProgramCache]: Analyzing trace with hash 312672747, now seen corresponding path program 1 times [2019-12-07 13:36:58,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:58,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494425112] [2019-12-07 13:36:58,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:58,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494425112] [2019-12-07 13:36:58,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:58,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:36:58,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714967473] [2019-12-07 13:36:58,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:36:58,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:58,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:36:58,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:58,463 INFO L87 Difference]: Start difference. First operand 50721 states and 161063 transitions. Second operand 3 states. [2019-12-07 13:36:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:58,594 INFO L93 Difference]: Finished difference Result 48753 states and 153505 transitions. [2019-12-07 13:36:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:36:58,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 13:36:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:58,659 INFO L225 Difference]: With dead ends: 48753 [2019-12-07 13:36:58,659 INFO L226 Difference]: Without dead ends: 48753 [2019-12-07 13:36:58,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:36:58,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48753 states. [2019-12-07 13:36:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48753 to 45797. [2019-12-07 13:36:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45797 states. [2019-12-07 13:36:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45797 states to 45797 states and 144643 transitions. [2019-12-07 13:36:59,362 INFO L78 Accepts]: Start accepts. Automaton has 45797 states and 144643 transitions. Word has length 28 [2019-12-07 13:36:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:59,362 INFO L462 AbstractCegarLoop]: Abstraction has 45797 states and 144643 transitions. [2019-12-07 13:36:59,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:36:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 45797 states and 144643 transitions. [2019-12-07 13:36:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 13:36:59,375 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:59,375 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] [2019-12-07 13:36:59,375 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:59,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:59,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1439082270, now seen corresponding path program 1 times [2019-12-07 13:36:59,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:59,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251444643] [2019-12-07 13:36:59,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:59,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:59,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251444643] [2019-12-07 13:36:59,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:59,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:36:59,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457674801] [2019-12-07 13:36:59,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:36:59,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:59,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:36:59,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:36:59,421 INFO L87 Difference]: Start difference. First operand 45797 states and 144643 transitions. Second operand 5 states. [2019-12-07 13:36:59,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:36:59,496 INFO L93 Difference]: Finished difference Result 20112 states and 60938 transitions. [2019-12-07 13:36:59,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:36:59,496 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 13:36:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:36:59,515 INFO L225 Difference]: With dead ends: 20112 [2019-12-07 13:36:59,515 INFO L226 Difference]: Without dead ends: 17577 [2019-12-07 13:36:59,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:36:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-07 13:36:59,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 16564. [2019-12-07 13:36:59,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16564 states. [2019-12-07 13:36:59,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 49915 transitions. [2019-12-07 13:36:59,737 INFO L78 Accepts]: Start accepts. Automaton has 16564 states and 49915 transitions. Word has length 29 [2019-12-07 13:36:59,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:36:59,738 INFO L462 AbstractCegarLoop]: Abstraction has 16564 states and 49915 transitions. [2019-12-07 13:36:59,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:36:59,738 INFO L276 IsEmpty]: Start isEmpty. Operand 16564 states and 49915 transitions. [2019-12-07 13:36:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 13:36:59,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:36:59,752 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 13:36:59,752 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:36:59,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:36:59,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-07 13:36:59,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:36:59,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721093062] [2019-12-07 13:36:59,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:36:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:36:59,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:36:59,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721093062] [2019-12-07 13:36:59,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:36:59,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:36:59,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438449219] [2019-12-07 13:36:59,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:36:59,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:36:59,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:36:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:36:59,824 INFO L87 Difference]: Start difference. First operand 16564 states and 49915 transitions. Second operand 7 states. [2019-12-07 13:37:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:00,546 INFO L93 Difference]: Finished difference Result 23459 states and 68690 transitions. [2019-12-07 13:37:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:37:00,546 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 13:37:00,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:00,568 INFO L225 Difference]: With dead ends: 23459 [2019-12-07 13:37:00,568 INFO L226 Difference]: Without dead ends: 22772 [2019-12-07 13:37:00,569 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:37:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22772 states. [2019-12-07 13:37:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22772 to 15927. [2019-12-07 13:37:00,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15927 states. [2019-12-07 13:37:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15927 states to 15927 states and 47844 transitions. [2019-12-07 13:37:00,904 INFO L78 Accepts]: Start accepts. Automaton has 15927 states and 47844 transitions. Word has length 33 [2019-12-07 13:37:00,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:00,905 INFO L462 AbstractCegarLoop]: Abstraction has 15927 states and 47844 transitions. [2019-12-07 13:37:00,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:37:00,905 INFO L276 IsEmpty]: Start isEmpty. Operand 15927 states and 47844 transitions. [2019-12-07 13:37:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 13:37:00,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:00,921 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:00,921 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash 731907862, now seen corresponding path program 1 times [2019-12-07 13:37:00,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:00,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256058843] [2019-12-07 13:37:00,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:00,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:00,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256058843] [2019-12-07 13:37:00,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:00,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:00,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314787889] [2019-12-07 13:37:00,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:00,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:00,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:00,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:00,970 INFO L87 Difference]: Start difference. First operand 15927 states and 47844 transitions. Second operand 3 states. [2019-12-07 13:37:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:01,014 INFO L93 Difference]: Finished difference Result 15927 states and 47304 transitions. [2019-12-07 13:37:01,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:01,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 13:37:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:01,032 INFO L225 Difference]: With dead ends: 15927 [2019-12-07 13:37:01,032 INFO L226 Difference]: Without dead ends: 15927 [2019-12-07 13:37:01,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15927 states. [2019-12-07 13:37:01,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15927 to 15677. [2019-12-07 13:37:01,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15677 states. [2019-12-07 13:37:01,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15677 states to 15677 states and 46606 transitions. [2019-12-07 13:37:01,237 INFO L78 Accepts]: Start accepts. Automaton has 15677 states and 46606 transitions. Word has length 40 [2019-12-07 13:37:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:01,238 INFO L462 AbstractCegarLoop]: Abstraction has 15677 states and 46606 transitions. [2019-12-07 13:37:01,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 15677 states and 46606 transitions. [2019-12-07 13:37:01,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 13:37:01,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:01,250 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] [2019-12-07 13:37:01,250 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:01,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:01,251 INFO L82 PathProgramCache]: Analyzing trace with hash 854921497, now seen corresponding path program 1 times [2019-12-07 13:37:01,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:01,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014641110] [2019-12-07 13:37:01,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:01,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014641110] [2019-12-07 13:37:01,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:01,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:37:01,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155631052] [2019-12-07 13:37:01,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:37:01,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:01,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:37:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:37:01,308 INFO L87 Difference]: Start difference. First operand 15677 states and 46606 transitions. Second operand 6 states. [2019-12-07 13:37:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:01,393 INFO L93 Difference]: Finished difference Result 14423 states and 43850 transitions. [2019-12-07 13:37:01,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:37:01,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 13:37:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:01,408 INFO L225 Difference]: With dead ends: 14423 [2019-12-07 13:37:01,409 INFO L226 Difference]: Without dead ends: 14289 [2019-12-07 13:37:01,409 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:37:01,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2019-12-07 13:37:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 13025. [2019-12-07 13:37:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13025 states. [2019-12-07 13:37:01,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13025 states to 13025 states and 39816 transitions. [2019-12-07 13:37:01,589 INFO L78 Accepts]: Start accepts. Automaton has 13025 states and 39816 transitions. Word has length 41 [2019-12-07 13:37:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:01,589 INFO L462 AbstractCegarLoop]: Abstraction has 13025 states and 39816 transitions. [2019-12-07 13:37:01,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:37:01,589 INFO L276 IsEmpty]: Start isEmpty. Operand 13025 states and 39816 transitions. [2019-12-07 13:37:01,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:37:01,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:01,601 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:01,601 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:01,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:01,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-07 13:37:01,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:01,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253471760] [2019-12-07 13:37:01,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:01,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:01,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253471760] [2019-12-07 13:37:01,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:01,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:37:01,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290357771] [2019-12-07 13:37:01,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:01,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:01,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:01,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:01,628 INFO L87 Difference]: Start difference. First operand 13025 states and 39816 transitions. Second operand 3 states. [2019-12-07 13:37:01,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:01,691 INFO L93 Difference]: Finished difference Result 18867 states and 57936 transitions. [2019-12-07 13:37:01,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:01,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:37:01,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:01,711 INFO L225 Difference]: With dead ends: 18867 [2019-12-07 13:37:01,711 INFO L226 Difference]: Without dead ends: 18867 [2019-12-07 13:37:01,711 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 13:37:01,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18867 states. [2019-12-07 13:37:01,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18867 to 14565. [2019-12-07 13:37:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14565 states. [2019-12-07 13:37:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14565 states to 14565 states and 45200 transitions. [2019-12-07 13:37:01,936 INFO L78 Accepts]: Start accepts. Automaton has 14565 states and 45200 transitions. Word has length 66 [2019-12-07 13:37:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:01,937 INFO L462 AbstractCegarLoop]: Abstraction has 14565 states and 45200 transitions. [2019-12-07 13:37:01,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 14565 states and 45200 transitions. [2019-12-07 13:37:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:37:01,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:01,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:01,950 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:01,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:01,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-07 13:37:01,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:01,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148177001] [2019-12-07 13:37:01,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:01,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148177001] [2019-12-07 13:37:01,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:01,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:37:01,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348643482] [2019-12-07 13:37:01,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:01,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:01,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:01,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:01,977 INFO L87 Difference]: Start difference. First operand 14565 states and 45200 transitions. Second operand 3 states. [2019-12-07 13:37:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:02,036 INFO L93 Difference]: Finished difference Result 18027 states and 54178 transitions. [2019-12-07 13:37:02,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:02,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:37:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:02,054 INFO L225 Difference]: With dead ends: 18027 [2019-12-07 13:37:02,054 INFO L226 Difference]: Without dead ends: 18027 [2019-12-07 13:37:02,054 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 13:37:02,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2019-12-07 13:37:02,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 13809. [2019-12-07 13:37:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-07 13:37:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 41675 transitions. [2019-12-07 13:37:02,261 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 41675 transitions. Word has length 66 [2019-12-07 13:37:02,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:02,262 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 41675 transitions. [2019-12-07 13:37:02,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 41675 transitions. [2019-12-07 13:37:02,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 13:37:02,274 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:02,274 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:02,274 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:02,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:02,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-07 13:37:02,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:02,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422612490] [2019-12-07 13:37:02,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:02,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:02,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422612490] [2019-12-07 13:37:02,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:02,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:37:02,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127346350] [2019-12-07 13:37:02,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:37:02,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:02,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:37:02,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:02,316 INFO L87 Difference]: Start difference. First operand 13809 states and 41675 transitions. Second operand 3 states. [2019-12-07 13:37:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:02,384 INFO L93 Difference]: Finished difference Result 16490 states and 49848 transitions. [2019-12-07 13:37:02,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:37:02,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 13:37:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:02,403 INFO L225 Difference]: With dead ends: 16490 [2019-12-07 13:37:02,403 INFO L226 Difference]: Without dead ends: 16490 [2019-12-07 13:37:02,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:37:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16490 states. [2019-12-07 13:37:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16490 to 12952. [2019-12-07 13:37:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12952 states. [2019-12-07 13:37:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 39462 transitions. [2019-12-07 13:37:02,595 INFO L78 Accepts]: Start accepts. Automaton has 12952 states and 39462 transitions. Word has length 66 [2019-12-07 13:37:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:02,595 INFO L462 AbstractCegarLoop]: Abstraction has 12952 states and 39462 transitions. [2019-12-07 13:37:02,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:37:02,595 INFO L276 IsEmpty]: Start isEmpty. Operand 12952 states and 39462 transitions. [2019-12-07 13:37:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:37:02,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:02,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:02,606 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:02,606 INFO L82 PathProgramCache]: Analyzing trace with hash -991043735, now seen corresponding path program 1 times [2019-12-07 13:37:02,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:02,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35521560] [2019-12-07 13:37:02,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:02,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35521560] [2019-12-07 13:37:02,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:02,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:37:02,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364629627] [2019-12-07 13:37:02,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:37:02,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:02,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:37:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:37:02,650 INFO L87 Difference]: Start difference. First operand 12952 states and 39462 transitions. Second operand 4 states. [2019-12-07 13:37:02,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:02,735 INFO L93 Difference]: Finished difference Result 12780 states and 38791 transitions. [2019-12-07 13:37:02,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:37:02,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 13:37:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:02,749 INFO L225 Difference]: With dead ends: 12780 [2019-12-07 13:37:02,749 INFO L226 Difference]: Without dead ends: 12780 [2019-12-07 13:37:02,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:37:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12780 states. [2019-12-07 13:37:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12780 to 11737. [2019-12-07 13:37:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11737 states. [2019-12-07 13:37:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11737 states to 11737 states and 35494 transitions. [2019-12-07 13:37:02,908 INFO L78 Accepts]: Start accepts. Automaton has 11737 states and 35494 transitions. Word has length 67 [2019-12-07 13:37:02,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:02,908 INFO L462 AbstractCegarLoop]: Abstraction has 11737 states and 35494 transitions. [2019-12-07 13:37:02,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:37:02,908 INFO L276 IsEmpty]: Start isEmpty. Operand 11737 states and 35494 transitions. [2019-12-07 13:37:02,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:37:02,917 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:02,917 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:02,917 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash -869199490, now seen corresponding path program 1 times [2019-12-07 13:37:02,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:02,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162650053] [2019-12-07 13:37:02,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:03,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162650053] [2019-12-07 13:37:03,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:03,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 13:37:03,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456976130] [2019-12-07 13:37:03,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 13:37:03,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:03,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 13:37:03,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-07 13:37:03,492 INFO L87 Difference]: Start difference. First operand 11737 states and 35494 transitions. Second operand 18 states. [2019-12-07 13:37:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:09,760 INFO L93 Difference]: Finished difference Result 67135 states and 198199 transitions. [2019-12-07 13:37:09,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-12-07 13:37:09,761 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-07 13:37:09,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:09,824 INFO L225 Difference]: With dead ends: 67135 [2019-12-07 13:37:09,824 INFO L226 Difference]: Without dead ends: 53337 [2019-12-07 13:37:09,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=519, Invalid=2903, Unknown=0, NotChecked=0, Total=3422 [2019-12-07 13:37:09,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53337 states. [2019-12-07 13:37:10,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53337 to 18503. [2019-12-07 13:37:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18503 states. [2019-12-07 13:37:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18503 states to 18503 states and 56041 transitions. [2019-12-07 13:37:10,307 INFO L78 Accepts]: Start accepts. Automaton has 18503 states and 56041 transitions. Word has length 67 [2019-12-07 13:37:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:10,307 INFO L462 AbstractCegarLoop]: Abstraction has 18503 states and 56041 transitions. [2019-12-07 13:37:10,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 13:37:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 18503 states and 56041 transitions. [2019-12-07 13:37:10,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:37:10,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:10,324 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:10,324 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:10,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:10,324 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 2 times [2019-12-07 13:37:10,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:10,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912306878] [2019-12-07 13:37:10,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:10,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912306878] [2019-12-07 13:37:10,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:10,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:37:10,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622719007] [2019-12-07 13:37:10,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:37:10,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:10,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:37:10,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:37:10,486 INFO L87 Difference]: Start difference. First operand 18503 states and 56041 transitions. Second operand 11 states. [2019-12-07 13:37:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:11,844 INFO L93 Difference]: Finished difference Result 68905 states and 207801 transitions. [2019-12-07 13:37:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-07 13:37:11,845 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 13:37:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:11,921 INFO L225 Difference]: With dead ends: 68905 [2019-12-07 13:37:11,921 INFO L226 Difference]: Without dead ends: 64302 [2019-12-07 13:37:11,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 642 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=414, Invalid=1748, Unknown=0, NotChecked=0, Total=2162 [2019-12-07 13:37:12,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64302 states. [2019-12-07 13:37:12,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64302 to 25338. [2019-12-07 13:37:12,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25338 states. [2019-12-07 13:37:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25338 states to 25338 states and 76899 transitions. [2019-12-07 13:37:12,521 INFO L78 Accepts]: Start accepts. Automaton has 25338 states and 76899 transitions. Word has length 67 [2019-12-07 13:37:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:12,521 INFO L462 AbstractCegarLoop]: Abstraction has 25338 states and 76899 transitions. [2019-12-07 13:37:12,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:37:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 25338 states and 76899 transitions. [2019-12-07 13:37:12,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:37:12,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:12,546 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:12,547 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:12,547 INFO L82 PathProgramCache]: Analyzing trace with hash 289864222, now seen corresponding path program 3 times [2019-12-07 13:37:12,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:12,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838544263] [2019-12-07 13:37:12,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:12,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:12,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838544263] [2019-12-07 13:37:12,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:12,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 13:37:12,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859455442] [2019-12-07 13:37:12,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 13:37:12,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 13:37:12,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 13:37:12,688 INFO L87 Difference]: Start difference. First operand 25338 states and 76899 transitions. Second operand 11 states. [2019-12-07 13:37:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:13,852 INFO L93 Difference]: Finished difference Result 47157 states and 140115 transitions. [2019-12-07 13:37:13,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 13:37:13,852 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 13:37:13,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:13,882 INFO L225 Difference]: With dead ends: 47157 [2019-12-07 13:37:13,883 INFO L226 Difference]: Without dead ends: 30008 [2019-12-07 13:37:13,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=1198, Unknown=0, NotChecked=0, Total=1482 [2019-12-07 13:37:13,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30008 states. [2019-12-07 13:37:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30008 to 17880. [2019-12-07 13:37:14,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17880 states. [2019-12-07 13:37:14,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17880 states to 17880 states and 53217 transitions. [2019-12-07 13:37:14,192 INFO L78 Accepts]: Start accepts. Automaton has 17880 states and 53217 transitions. Word has length 67 [2019-12-07 13:37:14,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:14,192 INFO L462 AbstractCegarLoop]: Abstraction has 17880 states and 53217 transitions. [2019-12-07 13:37:14,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 13:37:14,192 INFO L276 IsEmpty]: Start isEmpty. Operand 17880 states and 53217 transitions. [2019-12-07 13:37:14,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:37:14,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:14,207 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:14,207 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:14,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:14,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1169490426, now seen corresponding path program 4 times [2019-12-07 13:37:14,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:14,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100810971] [2019-12-07 13:37:14,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:14,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100810971] [2019-12-07 13:37:14,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:14,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 13:37:14,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897071199] [2019-12-07 13:37:14,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 13:37:14,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:14,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 13:37:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:37:14,276 INFO L87 Difference]: Start difference. First operand 17880 states and 53217 transitions. Second operand 7 states. [2019-12-07 13:37:14,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:14,520 INFO L93 Difference]: Finished difference Result 32672 states and 94674 transitions. [2019-12-07 13:37:14,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 13:37:14,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-07 13:37:14,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:14,549 INFO L225 Difference]: With dead ends: 32672 [2019-12-07 13:37:14,549 INFO L226 Difference]: Without dead ends: 28623 [2019-12-07 13:37:14,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:37:14,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28623 states. [2019-12-07 13:37:14,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28623 to 16518. [2019-12-07 13:37:14,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16518 states. [2019-12-07 13:37:14,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16518 states to 16518 states and 49365 transitions. [2019-12-07 13:37:14,843 INFO L78 Accepts]: Start accepts. Automaton has 16518 states and 49365 transitions. Word has length 67 [2019-12-07 13:37:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:14,843 INFO L462 AbstractCegarLoop]: Abstraction has 16518 states and 49365 transitions. [2019-12-07 13:37:14,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 13:37:14,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16518 states and 49365 transitions. [2019-12-07 13:37:14,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:37:14,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:14,857 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:14,857 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:14,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 5 times [2019-12-07 13:37:14,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:14,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244481008] [2019-12-07 13:37:14,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:37:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 13:37:14,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244481008] [2019-12-07 13:37:14,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:37:14,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:37:14,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756493947] [2019-12-07 13:37:14,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 13:37:14,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 13:37:14,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 13:37:14,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 13:37:14,978 INFO L87 Difference]: Start difference. First operand 16518 states and 49365 transitions. Second operand 12 states. [2019-12-07 13:37:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:37:15,525 INFO L93 Difference]: Finished difference Result 28649 states and 84655 transitions. [2019-12-07 13:37:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:37:15,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 13:37:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:37:15,554 INFO L225 Difference]: With dead ends: 28649 [2019-12-07 13:37:15,555 INFO L226 Difference]: Without dead ends: 28230 [2019-12-07 13:37:15,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:37:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28230 states. [2019-12-07 13:37:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28230 to 16250. [2019-12-07 13:37:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16250 states. [2019-12-07 13:37:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16250 states to 16250 states and 48595 transitions. [2019-12-07 13:37:15,842 INFO L78 Accepts]: Start accepts. Automaton has 16250 states and 48595 transitions. Word has length 67 [2019-12-07 13:37:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:37:15,843 INFO L462 AbstractCegarLoop]: Abstraction has 16250 states and 48595 transitions. [2019-12-07 13:37:15,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 13:37:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 16250 states and 48595 transitions. [2019-12-07 13:37:15,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 13:37:15,856 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:37:15,856 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:37:15,857 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:37:15,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:37:15,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 6 times [2019-12-07 13:37:15,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 13:37:15,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601184283] [2019-12-07 13:37:15,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:37:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:37:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:37:15,928 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 13:37:15,928 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:37:15,930 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2393~0.base_39|) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39|) |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2393~0.base_39| 4)) (= |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39| 1)) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39|)) (= 0 v_~y$r_buff1_thd2~0_197) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_27|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_20|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_~#t2393~0.base=|v_ULTIMATE.start_main_~#t2393~0.base_39|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_25|, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2393~0.offset=|v_ULTIMATE.start_main_~#t2393~0.offset_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_~#t2393~0.base, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2394~0.offset, ~y~0, ULTIMATE.start_main_~#t2394~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2393~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:15,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:15,931 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11|) |v_ULTIMATE.start_main_~#t2394~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2394~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2394~0.base_11|) (= |v_ULTIMATE.start_main_~#t2394~0.offset_10| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2394~0.base_11| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2394~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2394~0.offset] because there is no mapped edge [2019-12-07 13:37:15,932 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2395~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2395~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11|) |v_ULTIMATE.start_main_~#t2395~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t2395~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2395~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_11|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset] because there is no mapped edge [2019-12-07 13:37:15,934 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1099090714 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1099090714 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-1099090714 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1099090714 256)) (and (= (mod ~y$w_buff1_used~0_In-1099090714 256) 0) .cse1))) (= ~y$w_buff1~0_In-1099090714 |P2Thread1of1ForFork2_#t~ite23_Out-1099090714|) (= |P2Thread1of1ForFork2_#t~ite24_Out-1099090714| |P2Thread1of1ForFork2_#t~ite23_Out-1099090714|)) (and (= ~y$w_buff1~0_In-1099090714 |P2Thread1of1ForFork2_#t~ite24_Out-1099090714|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-1099090714| |P2Thread1of1ForFork2_#t~ite23_Out-1099090714|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1099090714|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1099090714, ~y$w_buff1~0=~y$w_buff1~0_In-1099090714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1099090714, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1099090714, ~weak$$choice2~0=~weak$$choice2~0_In-1099090714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1099090714} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1099090714|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1099090714|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1099090714, ~y$w_buff1~0=~y$w_buff1~0_In-1099090714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1099090714, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1099090714, ~weak$$choice2~0=~weak$$choice2~0_In-1099090714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1099090714} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 13:37:15,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1483238018 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1483238018| ~y$w_buff0_used~0_In-1483238018) (= |P2Thread1of1ForFork2_#t~ite26_In-1483238018| |P2Thread1of1ForFork2_#t~ite26_Out-1483238018|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1483238018 256) 0))) (or (and (= (mod ~y$r_buff1_thd3~0_In-1483238018 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1483238018 256))) (= 0 (mod ~y$w_buff0_used~0_In-1483238018 256)))) .cse0 (= |P2Thread1of1ForFork2_#t~ite27_Out-1483238018| |P2Thread1of1ForFork2_#t~ite26_Out-1483238018|) (= ~y$w_buff0_used~0_In-1483238018 |P2Thread1of1ForFork2_#t~ite26_Out-1483238018|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1483238018, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1483238018|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483238018, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1483238018, ~weak$$choice2~0=~weak$$choice2~0_In-1483238018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1483238018} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1483238018|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1483238018, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483238018, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1483238018, ~weak$$choice2~0=~weak$$choice2~0_In-1483238018, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1483238018|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1483238018} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 13:37:15,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-800641408 256)))) (or (and (= ~y$w_buff1_used~0_In-800641408 |P2Thread1of1ForFork2_#t~ite30_Out-800641408|) (= |P2Thread1of1ForFork2_#t~ite29_In-800641408| |P2Thread1of1ForFork2_#t~ite29_Out-800641408|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-800641408| ~y$w_buff1_used~0_In-800641408) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-800641408 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-800641408 256) 0)) (and (= (mod ~y$r_buff1_thd3~0_In-800641408 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-800641408 256)))) .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-800641408| |P2Thread1of1ForFork2_#t~ite30_Out-800641408|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-800641408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-800641408, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-800641408, ~weak$$choice2~0=~weak$$choice2~0_In-800641408, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-800641408|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-800641408} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-800641408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-800641408, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-800641408|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-800641408, ~weak$$choice2~0=~weak$$choice2~0_In-800641408, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-800641408|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-800641408} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:37:15,935 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 13:37:15,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:37:15,936 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-386674570 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-386674570 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-386674570| ~y$w_buff1~0_In-386674570)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-386674570| ~y~0_In-386674570)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-386674570, ~y$w_buff1~0=~y$w_buff1~0_In-386674570, ~y~0=~y~0_In-386674570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386674570} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-386674570, ~y$w_buff1~0=~y$w_buff1~0_In-386674570, ~y~0=~y~0_In-386674570, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-386674570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386674570} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 13:37:15,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1788656555 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1788656555 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1788656555| ~y$w_buff0_used~0_In-1788656555) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1788656555| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1788656555, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1788656555} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1788656555|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1788656555, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1788656555} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:37:15,937 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1073788207 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1073788207 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1073788207 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1073788207 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1073788207|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1073788207| ~y$w_buff1_used~0_In-1073788207) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1073788207, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073788207, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1073788207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073788207} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1073788207|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1073788207, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073788207, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1073788207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073788207} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:37:15,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2103905858 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2103905858 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out2103905858| |P1Thread1of1ForFork1_#t~ite9_Out2103905858|))) (or (and (= ~y~0_In2103905858 |P1Thread1of1ForFork1_#t~ite9_Out2103905858|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= ~y$w_buff1~0_In2103905858 |P1Thread1of1ForFork1_#t~ite9_Out2103905858|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2103905858, ~y$w_buff1~0=~y$w_buff1~0_In2103905858, ~y~0=~y~0_In2103905858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2103905858} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2103905858, ~y$w_buff1~0=~y$w_buff1~0_In2103905858, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2103905858|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out2103905858|, ~y~0=~y~0_In2103905858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2103905858} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 13:37:15,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 13:37:15,938 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2139469099 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2139469099 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-2139469099|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2139469099 |P2Thread1of1ForFork2_#t~ite40_Out-2139469099|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139469099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2139469099} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139469099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2139469099, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2139469099|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 13:37:15,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1924767648 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1924767648 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1924767648 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1924767648 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out-1924767648| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out-1924767648| ~y$w_buff1_used~0_In-1924767648) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1924767648, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924767648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1924767648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924767648} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1924767648, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924767648, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1924767648|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1924767648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924767648} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 13:37:15,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In395720013 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In395720013 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In395720013 |P2Thread1of1ForFork2_#t~ite42_Out395720013|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out395720013|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In395720013, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In395720013} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In395720013, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out395720013|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In395720013} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 13:37:15,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1249997041 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1249997041 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1249997041 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1249997041 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1249997041|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1249997041 |P2Thread1of1ForFork2_#t~ite43_Out1249997041|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1249997041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1249997041, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1249997041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1249997041} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1249997041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1249997041, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1249997041, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1249997041|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1249997041} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 13:37:15,939 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1897717887 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1897717887 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1897717887 ~y$r_buff0_thd1~0_In1897717887))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out1897717887 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1897717887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1897717887} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1897717887, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1897717887|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1897717887} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:37:15,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1311977799 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1311977799 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1311977799 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1311977799 256)))) (or (and (= ~y$r_buff1_thd1~0_In1311977799 |P0Thread1of1ForFork0_#t~ite8_Out1311977799|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1311977799|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1311977799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1311977799, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1311977799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1311977799} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1311977799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1311977799, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1311977799|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1311977799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1311977799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:37:15,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:37:15,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:37:15,940 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In556666010 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In556666010 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In556666010 |P1Thread1of1ForFork1_#t~ite11_Out556666010|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out556666010|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In556666010, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In556666010} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In556666010, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In556666010, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out556666010|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:37:15,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In578246845 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In578246845 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In578246845 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In578246845 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out578246845|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In578246845 |P1Thread1of1ForFork1_#t~ite12_Out578246845|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In578246845, ~y$w_buff0_used~0=~y$w_buff0_used~0_In578246845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In578246845, ~y$w_buff1_used~0=~y$w_buff1_used~0_In578246845} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In578246845, ~y$w_buff0_used~0=~y$w_buff0_used~0_In578246845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In578246845, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out578246845|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In578246845} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:37:15,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1370664507 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1370664507 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1370664507|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1370664507 |P1Thread1of1ForFork1_#t~ite13_Out1370664507|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1370664507, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1370664507} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1370664507, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1370664507, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1370664507|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 13:37:15,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1722359450 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1722359450 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1722359450 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1722359450 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In1722359450 |P1Thread1of1ForFork1_#t~ite14_Out1722359450|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1722359450|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1722359450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1722359450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1722359450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1722359450} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1722359450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1722359450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1722359450, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1722359450|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1722359450} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:37:15,941 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:37:15,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:37:15,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1562598377 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1562598377 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1562598377| ~y~0_In-1562598377)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1562598377| ~y$w_buff1~0_In-1562598377)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1562598377, ~y~0=~y~0_In-1562598377, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1562598377, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562598377} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1562598377, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1562598377|, ~y~0=~y~0_In-1562598377, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1562598377, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562598377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 13:37:15,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 13:37:15,942 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-180900923 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-180900923 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-180900923| ~y$w_buff0_used~0_In-180900923)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-180900923| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-180900923, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180900923} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-180900923, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180900923, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-180900923|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:37:15,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-669044869 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-669044869 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-669044869 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-669044869 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-669044869|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-669044869 |ULTIMATE.start_main_#t~ite50_Out-669044869|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-669044869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-669044869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-669044869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669044869} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-669044869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-669044869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-669044869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-669044869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669044869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:37:15,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1289565834 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1289565834 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1289565834|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1289565834 |ULTIMATE.start_main_#t~ite51_Out1289565834|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1289565834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1289565834} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1289565834|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1289565834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1289565834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:37:15,943 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2119444540 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2119444540 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-2119444540 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2119444540 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-2119444540| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-2119444540| ~y$r_buff1_thd0~0_In-2119444540)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119444540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119444540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119444540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119444540} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2119444540|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119444540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119444540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119444540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119444540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:37:15,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:37:15,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:37:15 BasicIcfg [2019-12-07 13:37:15,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:37:15,995 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:37:15,995 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:37:15,995 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:37:15,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:35:56" (3/4) ... [2019-12-07 13:37:15,997 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:37:15,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2393~0.base_39|) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2393~0.base_39|) |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0)) |v_#memory_int_23|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2393~0.base_39| 4)) (= |v_ULTIMATE.start_main_~#t2393~0.offset_26| 0) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39| 1)) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2393~0.base_39|)) (= 0 v_~y$r_buff1_thd2~0_197) (= v_~y~0_189 0) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_27|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_20|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_~#t2393~0.base=|v_ULTIMATE.start_main_~#t2393~0.base_39|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_25|, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_37|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ULTIMATE.start_main_~#t2393~0.offset=|v_ULTIMATE.start_main_~#t2393~0.offset_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_~#t2393~0.base, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2394~0.offset, ~y~0, ULTIMATE.start_main_~#t2394~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ULTIMATE.start_main_~#t2393~0.offset, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:15,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:37:15,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2394~0.base_11|) |v_ULTIMATE.start_main_~#t2394~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2394~0.base_11|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2394~0.base_11|) (= |v_ULTIMATE.start_main_~#t2394~0.offset_10| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2394~0.base_11| 4) |v_#length_17|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2394~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2394~0.base=|v_ULTIMATE.start_main_~#t2394~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2394~0.offset=|v_ULTIMATE.start_main_~#t2394~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2394~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2394~0.offset] because there is no mapped edge [2019-12-07 13:37:15,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11| 1) |v_#valid_31|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2395~0.base_11|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2395~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2395~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2395~0.base_11|) |v_ULTIMATE.start_main_~#t2395~0.offset_10| 2)) |v_#memory_int_13|) (= |v_ULTIMATE.start_main_~#t2395~0.offset_10| 0) (not (= |v_ULTIMATE.start_main_~#t2395~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2395~0.base=|v_ULTIMATE.start_main_~#t2395~0.base_11|, ULTIMATE.start_main_~#t2395~0.offset=|v_ULTIMATE.start_main_~#t2395~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2395~0.base, ULTIMATE.start_main_~#t2395~0.offset] because there is no mapped edge [2019-12-07 13:37:16,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1099090714 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1099090714 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-1099090714 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-1099090714 256)) (and (= (mod ~y$w_buff1_used~0_In-1099090714 256) 0) .cse1))) (= ~y$w_buff1~0_In-1099090714 |P2Thread1of1ForFork2_#t~ite23_Out-1099090714|) (= |P2Thread1of1ForFork2_#t~ite24_Out-1099090714| |P2Thread1of1ForFork2_#t~ite23_Out-1099090714|)) (and (= ~y$w_buff1~0_In-1099090714 |P2Thread1of1ForFork2_#t~ite24_Out-1099090714|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In-1099090714| |P2Thread1of1ForFork2_#t~ite23_Out-1099090714|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In-1099090714|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1099090714, ~y$w_buff1~0=~y$w_buff1~0_In-1099090714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1099090714, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1099090714, ~weak$$choice2~0=~weak$$choice2~0_In-1099090714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1099090714} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out-1099090714|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out-1099090714|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1099090714, ~y$w_buff1~0=~y$w_buff1~0_In-1099090714, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1099090714, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1099090714, ~weak$$choice2~0=~weak$$choice2~0_In-1099090714, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1099090714} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 13:37:16,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1483238018 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1483238018| ~y$w_buff0_used~0_In-1483238018) (= |P2Thread1of1ForFork2_#t~ite26_In-1483238018| |P2Thread1of1ForFork2_#t~ite26_Out-1483238018|) (not .cse0)) (and (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1483238018 256) 0))) (or (and (= (mod ~y$r_buff1_thd3~0_In-1483238018 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1483238018 256))) (= 0 (mod ~y$w_buff0_used~0_In-1483238018 256)))) .cse0 (= |P2Thread1of1ForFork2_#t~ite27_Out-1483238018| |P2Thread1of1ForFork2_#t~ite26_Out-1483238018|) (= ~y$w_buff0_used~0_In-1483238018 |P2Thread1of1ForFork2_#t~ite26_Out-1483238018|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1483238018, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1483238018|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483238018, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1483238018, ~weak$$choice2~0=~weak$$choice2~0_In-1483238018, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1483238018} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1483238018|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1483238018, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1483238018, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1483238018, ~weak$$choice2~0=~weak$$choice2~0_In-1483238018, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1483238018|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1483238018} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 13:37:16,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-800641408 256)))) (or (and (= ~y$w_buff1_used~0_In-800641408 |P2Thread1of1ForFork2_#t~ite30_Out-800641408|) (= |P2Thread1of1ForFork2_#t~ite29_In-800641408| |P2Thread1of1ForFork2_#t~ite29_Out-800641408|) (not .cse0)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out-800641408| ~y$w_buff1_used~0_In-800641408) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-800641408 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-800641408 256) 0)) (and (= (mod ~y$r_buff1_thd3~0_In-800641408 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-800641408 256)))) .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-800641408| |P2Thread1of1ForFork2_#t~ite30_Out-800641408|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-800641408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-800641408, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-800641408, ~weak$$choice2~0=~weak$$choice2~0_In-800641408, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-800641408|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-800641408} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-800641408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-800641408, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-800641408|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-800641408, ~weak$$choice2~0=~weak$$choice2~0_In-800641408, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-800641408|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-800641408} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 13:37:16,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 13:37:16,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 13:37:16,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-386674570 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-386674570 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-386674570| ~y$w_buff1~0_In-386674570)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite38_Out-386674570| ~y~0_In-386674570)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-386674570, ~y$w_buff1~0=~y$w_buff1~0_In-386674570, ~y~0=~y~0_In-386674570, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386674570} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-386674570, ~y$w_buff1~0=~y$w_buff1~0_In-386674570, ~y~0=~y~0_In-386674570, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-386674570|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386674570} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 13:37:16,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1788656555 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1788656555 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1788656555| ~y$w_buff0_used~0_In-1788656555) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1788656555| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1788656555, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1788656555} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1788656555|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1788656555, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1788656555} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 13:37:16,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1073788207 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1073788207 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1073788207 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1073788207 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1073788207|)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out-1073788207| ~y$w_buff1_used~0_In-1073788207) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1073788207, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073788207, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1073788207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073788207} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1073788207|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1073788207, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1073788207, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1073788207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1073788207} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 13:37:16,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In2103905858 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2103905858 256))) (.cse0 (= |P1Thread1of1ForFork1_#t~ite10_Out2103905858| |P1Thread1of1ForFork1_#t~ite9_Out2103905858|))) (or (and (= ~y~0_In2103905858 |P1Thread1of1ForFork1_#t~ite9_Out2103905858|) .cse0 (or .cse1 .cse2)) (and (not .cse1) (not .cse2) (= ~y$w_buff1~0_In2103905858 |P1Thread1of1ForFork1_#t~ite9_Out2103905858|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2103905858, ~y$w_buff1~0=~y$w_buff1~0_In2103905858, ~y~0=~y~0_In2103905858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2103905858} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2103905858, ~y$w_buff1~0=~y$w_buff1~0_In2103905858, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out2103905858|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out2103905858|, ~y~0=~y~0_In2103905858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2103905858} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 13:37:16,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 13:37:16,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2139469099 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-2139469099 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out-2139469099|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2139469099 |P2Thread1of1ForFork2_#t~ite40_Out-2139469099|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139469099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2139469099} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2139469099, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2139469099, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out-2139469099|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 13:37:16,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1924767648 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1924767648 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-1924767648 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-1924767648 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out-1924767648| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite41_Out-1924767648| ~y$w_buff1_used~0_In-1924767648) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1924767648, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924767648, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1924767648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924767648} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1924767648, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1924767648, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out-1924767648|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1924767648, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1924767648} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 13:37:16,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In395720013 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In395720013 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In395720013 |P2Thread1of1ForFork2_#t~ite42_Out395720013|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite42_Out395720013|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In395720013, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In395720013} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In395720013, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out395720013|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In395720013} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 13:37:16,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1249997041 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1249997041 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1249997041 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1249997041 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out1249997041|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1249997041 |P2Thread1of1ForFork2_#t~ite43_Out1249997041|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1249997041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1249997041, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1249997041, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1249997041} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1249997041, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1249997041, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1249997041, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out1249997041|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1249997041} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 13:37:16,005 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1897717887 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1897717887 256) 0)) (.cse2 (= ~y$r_buff0_thd1~0_Out1897717887 ~y$r_buff0_thd1~0_In1897717887))) (or (and (not .cse0) (= ~y$r_buff0_thd1~0_Out1897717887 0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1897717887, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1897717887} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1897717887, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1897717887|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1897717887} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 13:37:16,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In1311977799 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1311977799 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1311977799 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1311977799 256)))) (or (and (= ~y$r_buff1_thd1~0_In1311977799 |P0Thread1of1ForFork0_#t~ite8_Out1311977799|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1311977799|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1311977799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1311977799, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1311977799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1311977799} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1311977799, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1311977799, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1311977799|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1311977799, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1311977799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 13:37:16,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 13:37:16,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:37:16,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In556666010 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In556666010 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In556666010 |P1Thread1of1ForFork1_#t~ite11_Out556666010|)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite11_Out556666010|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In556666010, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In556666010} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In556666010, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In556666010, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out556666010|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 13:37:16,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In578246845 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In578246845 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In578246845 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In578246845 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out578246845|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In578246845 |P1Thread1of1ForFork1_#t~ite12_Out578246845|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In578246845, ~y$w_buff0_used~0=~y$w_buff0_used~0_In578246845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In578246845, ~y$w_buff1_used~0=~y$w_buff1_used~0_In578246845} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In578246845, ~y$w_buff0_used~0=~y$w_buff0_used~0_In578246845, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In578246845, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out578246845|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In578246845} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 13:37:16,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1370664507 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1370664507 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite13_Out1370664507|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1370664507 |P1Thread1of1ForFork1_#t~ite13_Out1370664507|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1370664507, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1370664507} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1370664507, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1370664507, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1370664507|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 13:37:16,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1722359450 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1722359450 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1722359450 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1722359450 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In1722359450 |P1Thread1of1ForFork1_#t~ite14_Out1722359450|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1722359450|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1722359450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1722359450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1722359450, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1722359450} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1722359450, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1722359450, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1722359450, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1722359450|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1722359450} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 13:37:16,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:37:16,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:37:16,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1562598377 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1562598377 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-1562598377| ~y~0_In-1562598377)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1562598377| ~y$w_buff1~0_In-1562598377)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1562598377, ~y~0=~y~0_In-1562598377, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1562598377, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562598377} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1562598377, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1562598377|, ~y~0=~y~0_In-1562598377, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1562598377, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1562598377} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 13:37:16,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 13:37:16,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-180900923 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-180900923 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out-180900923| ~y$w_buff0_used~0_In-180900923)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out-180900923| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-180900923, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180900923} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-180900923, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180900923, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-180900923|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 13:37:16,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-669044869 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-669044869 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-669044869 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-669044869 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-669044869|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-669044869 |ULTIMATE.start_main_#t~ite50_Out-669044869|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-669044869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-669044869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-669044869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669044869} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-669044869|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-669044869, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-669044869, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-669044869, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-669044869} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 13:37:16,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1289565834 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1289565834 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1289565834|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1289565834 |ULTIMATE.start_main_#t~ite51_Out1289565834|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1289565834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1289565834} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1289565834|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1289565834, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1289565834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 13:37:16,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-2119444540 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-2119444540 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-2119444540 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2119444540 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-2119444540| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite52_Out-2119444540| ~y$r_buff1_thd0~0_In-2119444540)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119444540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119444540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119444540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119444540} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2119444540|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2119444540, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2119444540, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2119444540, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2119444540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 13:37:16,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:37:16,060 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3fa44148-20f0-4295-b1da-f01022112b3d/bin/uautomizer/witness.graphml [2019-12-07 13:37:16,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:37:16,061 INFO L168 Benchmark]: Toolchain (without parser) took 80444.01 ms. Allocated memory was 1.0 GB in the beginning and 6.7 GB in the end (delta: 5.7 GB). Free memory was 937.0 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-12-07 13:37:16,062 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:37:16,062 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:16,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.57 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: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:16,062 INFO L168 Benchmark]: Boogie Preprocessor took 25.90 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:16,063 INFO L168 Benchmark]: RCFGBuilder took 399.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.5 MB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:16,063 INFO L168 Benchmark]: TraceAbstraction took 79490.12 ms. Allocated memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: 5.6 GB). Free memory was 996.4 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-12-07 13:37:16,063 INFO L168 Benchmark]: Witness Printer took 65.84 ms. Allocated memory is still 6.7 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:37:16,065 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 957.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.50 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 937.0 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.57 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: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.90 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: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 399.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 997.5 MB in the end (delta: 58.7 MB). Peak memory consumption was 58.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 79490.12 ms. Allocated memory was 1.1 GB in the beginning and 6.7 GB in the end (delta: 5.6 GB). Free memory was 996.4 MB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 65.84 ms. Allocated memory is still 6.7 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L817] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L819] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? 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=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L792] 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 [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 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 [L828] 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 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 79.3s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5422 SDtfs, 7385 SDslu, 19794 SDs, 0 SdLazy, 12323 SolverSat, 383 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 296 GetRequests, 30 SyntacticMatches, 14 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195490occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.3s AutomataMinimizationTime, 22 MinimizatonAttempts, 263854 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 973 NumberOfCodeBlocks, 973 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 884 ConstructedInterpolants, 0 QuantifiedInterpolants, 233259 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...