./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/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 ac603921af76d92806df05afa997edb66225f2f2 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:07:28,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:07:28,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:07:28,800 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:07:28,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:07:28,801 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:07:28,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:07:28,804 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:07:28,806 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:07:28,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:07:28,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:07:28,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:07:28,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:07:28,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:07:28,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:07:28,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:07:28,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:07:28,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:07:28,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:07:28,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:07:28,816 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:07:28,817 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:07:28,818 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:07:28,818 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:07:28,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:07:28,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:07:28,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:07:28,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:07:28,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:07:28,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:07:28,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:07:28,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:07:28,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:07:28,823 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:07:28,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:07:28,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:07:28,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:07:28,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:07:28,825 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:07:28,826 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:07:28,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:07:28,827 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 10:07:28,840 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:07:28,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:07:28,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 10:07:28,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 10:07:28,841 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 10:07:28,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:07:28,842 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:07:28,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:07:28,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:07:28,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:07:28,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:07:28,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:07:28,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:07:28,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:07:28,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:07:28,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:07:28,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:07:28,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:07:28,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 10:07:28,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:07:28,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:07:28,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:07:28,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:07:28,845 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:07:28,846 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:07:28,846 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_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/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 -> ac603921af76d92806df05afa997edb66225f2f2 [2019-12-07 10:07:28,949 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:07:28,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:07:28,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:07:28,961 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:07:28,961 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:07:28,961 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2019-12-07 10:07:28,998 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/data/40a814181/6bbfc18042294eb5b380d547ca9cabd3/FLAG7fcfaa141 [2019-12-07 10:07:29,374 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:07:29,374 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2019-12-07 10:07:29,385 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/data/40a814181/6bbfc18042294eb5b380d547ca9cabd3/FLAG7fcfaa141 [2019-12-07 10:07:29,394 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/data/40a814181/6bbfc18042294eb5b380d547ca9cabd3 [2019-12-07 10:07:29,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:07:29,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:07:29,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:07:29,400 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:07:29,400 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,402 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29, skipping insertion in model container [2019-12-07 10:07:29,402 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,407 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:07:29,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:07:29,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:29,712 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:07:29,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:07:29,810 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:07:29,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29 WrapperNode [2019-12-07 10:07:29,811 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:07:29,811 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:29,811 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:07:29,811 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:07:29,817 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:07:29,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:07:29,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:07:29,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:07:29,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,873 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... [2019-12-07 10:07:29,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:07:29,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:07:29,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:07:29,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:07:29,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/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 10:07:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 10:07:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:07:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:07:29,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:07:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:07:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:07:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:07:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:07:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:07:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 10:07:29,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 10:07:29,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 10:07:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:07:29,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:07:29,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:07:29,941 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 10:07:30,371 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:07:30,371 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:07:30,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30 BoogieIcfgContainer [2019-12-07 10:07:30,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:07:30,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:07:30,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:07:30,375 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:07:30,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:07:29" (1/3) ... [2019-12-07 10:07:30,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f93c385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:07:29" (2/3) ... [2019-12-07 10:07:30,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f93c385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:07:30, skipping insertion in model container [2019-12-07 10:07:30,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/3) ... [2019-12-07 10:07:30,376 INFO L109 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2019-12-07 10:07:30,382 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:07:30,383 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:07:30,387 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:07:30,388 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:07:30,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,418 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,418 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,419 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,419 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,420 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,421 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,422 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,423 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,424 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,426 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,427 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,427 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,428 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,429 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,430 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,431 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,432 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,433 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,434 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,435 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,436 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,437 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,438 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,439 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,440 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,441 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,442 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,443 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,444 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,445 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,446 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,447 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,448 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,449 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~mem66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:07:30,464 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 10:07:30,477 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:07:30,477 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:07:30,477 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:07:30,477 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:07:30,477 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:07:30,477 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:07:30,478 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:07:30,478 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:07:30,489 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 235 places, 293 transitions [2019-12-07 10:07:30,491 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions [2019-12-07 10:07:30,563 INFO L134 PetriNetUnfolder]: 68/290 cut-off events. [2019-12-07 10:07:30,564 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:30,580 INFO L76 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1266 event pairs. 9/229 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 10:07:30,614 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 235 places, 293 transitions [2019-12-07 10:07:30,661 INFO L134 PetriNetUnfolder]: 68/290 cut-off events. [2019-12-07 10:07:30,661 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:07:30,672 INFO L76 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 290 events. 68/290 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1266 event pairs. 9/229 useless extension candidates. Maximal degree in co-relation 242. Up to 2 conditions per place. [2019-12-07 10:07:30,702 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31682 [2019-12-07 10:07:30,702 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:07:34,707 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-12-07 10:07:34,827 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-12-07 10:07:35,163 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 132 [2019-12-07 10:07:35,308 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-12-07 10:07:35,341 INFO L206 etLargeBlockEncoding]: Checked pairs total: 167703 [2019-12-07 10:07:35,341 INFO L214 etLargeBlockEncoding]: Total number of compositions: 175 [2019-12-07 10:07:35,344 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 118 places, 145 transitions [2019-12-07 10:08:14,146 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 215972 states. [2019-12-07 10:08:14,147 INFO L276 IsEmpty]: Start isEmpty. Operand 215972 states. [2019-12-07 10:08:14,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 10:08:14,151 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:14,152 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 10:08:14,152 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 10:08:14,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1275411, now seen corresponding path program 1 times [2019-12-07 10:08:14,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:14,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576606681] [2019-12-07 10:08:14,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:14,302 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 10:08:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576606681] [2019-12-07 10:08:14,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:14,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:08:14,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290567426] [2019-12-07 10:08:14,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:08:14,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:14,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:08:14,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:08:14,317 INFO L87 Difference]: Start difference. First operand 215972 states. Second operand 3 states. [2019-12-07 10:08:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:17,516 INFO L93 Difference]: Finished difference Result 214184 states and 960653 transitions. [2019-12-07 10:08:17,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:08:17,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 10:08:17,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:18,360 INFO L225 Difference]: With dead ends: 214184 [2019-12-07 10:08:18,360 INFO L226 Difference]: Without dead ends: 203875 [2019-12-07 10:08:18,361 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 10:08:25,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203875 states. [2019-12-07 10:08:28,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203875 to 203875. [2019-12-07 10:08:28,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203875 states. [2019-12-07 10:08:29,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203875 states to 203875 states and 914061 transitions. [2019-12-07 10:08:29,687 INFO L78 Accepts]: Start accepts. Automaton has 203875 states and 914061 transitions. Word has length 3 [2019-12-07 10:08:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:29,687 INFO L462 AbstractCegarLoop]: Abstraction has 203875 states and 914061 transitions. [2019-12-07 10:08:29,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:08:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 203875 states and 914061 transitions. [2019-12-07 10:08:29,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:08:29,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:29,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:29,695 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 10:08:29,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:29,695 INFO L82 PathProgramCache]: Analyzing trace with hash -290709070, now seen corresponding path program 1 times [2019-12-07 10:08:29,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:29,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767103164] [2019-12-07 10:08:29,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:29,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:29,761 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 10:08:29,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767103164] [2019-12-07 10:08:29,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:29,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:29,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249233772] [2019-12-07 10:08:29,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:29,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:29,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:29,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:29,764 INFO L87 Difference]: Start difference. First operand 203875 states and 914061 transitions. Second operand 4 states. [2019-12-07 10:08:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:31,491 INFO L93 Difference]: Finished difference Result 324533 states and 1382292 transitions. [2019-12-07 10:08:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:31,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:08:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:32,417 INFO L225 Difference]: With dead ends: 324533 [2019-12-07 10:08:32,417 INFO L226 Difference]: Without dead ends: 324484 [2019-12-07 10:08:32,417 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 10:08:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324484 states. [2019-12-07 10:08:48,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324484 to 303600. [2019-12-07 10:08:48,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303600 states. [2019-12-07 10:08:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303600 states to 303600 states and 1306247 transitions. [2019-12-07 10:08:50,283 INFO L78 Accepts]: Start accepts. Automaton has 303600 states and 1306247 transitions. Word has length 13 [2019-12-07 10:08:50,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:08:50,284 INFO L462 AbstractCegarLoop]: Abstraction has 303600 states and 1306247 transitions. [2019-12-07 10:08:50,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:08:50,284 INFO L276 IsEmpty]: Start isEmpty. Operand 303600 states and 1306247 transitions. [2019-12-07 10:08:50,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 10:08:50,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:08:50,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:08:50,287 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 10:08:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:08:50,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1628230467, now seen corresponding path program 1 times [2019-12-07 10:08:50,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:08:50,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762449505] [2019-12-07 10:08:50,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:08:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:08:50,339 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 10:08:50,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762449505] [2019-12-07 10:08:50,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:08:50,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:08:50,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984494997] [2019-12-07 10:08:50,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:08:50,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:08:50,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:08:50,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:08:50,340 INFO L87 Difference]: Start difference. First operand 303600 states and 1306247 transitions. Second operand 4 states. [2019-12-07 10:08:56,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:08:56,499 INFO L93 Difference]: Finished difference Result 445085 states and 1863204 transitions. [2019-12-07 10:08:56,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:08:56,499 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 10:08:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:08:57,725 INFO L225 Difference]: With dead ends: 445085 [2019-12-07 10:08:57,725 INFO L226 Difference]: Without dead ends: 445029 [2019-12-07 10:08:57,725 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 10:09:08,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445029 states. [2019-12-07 10:09:13,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445029 to 367993. [2019-12-07 10:09:13,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367993 states. [2019-12-07 10:09:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367993 states to 367993 states and 1568753 transitions. [2019-12-07 10:09:14,972 INFO L78 Accepts]: Start accepts. Automaton has 367993 states and 1568753 transitions. Word has length 13 [2019-12-07 10:09:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:14,972 INFO L462 AbstractCegarLoop]: Abstraction has 367993 states and 1568753 transitions. [2019-12-07 10:09:14,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:09:14,972 INFO L276 IsEmpty]: Start isEmpty. Operand 367993 states and 1568753 transitions. [2019-12-07 10:09:14,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:09:14,977 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:14,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:14,978 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 10:09:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash 493639973, now seen corresponding path program 1 times [2019-12-07 10:09:14,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:14,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467063011] [2019-12-07 10:09:14,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:15,057 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 10:09:15,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467063011] [2019-12-07 10:09:15,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:15,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:09:15,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879473632] [2019-12-07 10:09:15,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:09:15,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:15,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:09:15,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:09:15,059 INFO L87 Difference]: Start difference. First operand 367993 states and 1568753 transitions. Second operand 5 states. [2019-12-07 10:09:23,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:23,087 INFO L93 Difference]: Finished difference Result 555354 states and 2329822 transitions. [2019-12-07 10:09:23,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:09:23,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:09:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:24,572 INFO L225 Difference]: With dead ends: 555354 [2019-12-07 10:09:24,572 INFO L226 Difference]: Without dead ends: 555354 [2019-12-07 10:09:24,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:09:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555354 states. [2019-12-07 10:09:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555354 to 384171. [2019-12-07 10:09:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384171 states. [2019-12-07 10:09:43,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384171 states to 384171 states and 1634979 transitions. [2019-12-07 10:09:43,255 INFO L78 Accepts]: Start accepts. Automaton has 384171 states and 1634979 transitions. Word has length 14 [2019-12-07 10:09:43,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:09:43,255 INFO L462 AbstractCegarLoop]: Abstraction has 384171 states and 1634979 transitions. [2019-12-07 10:09:43,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:09:43,255 INFO L276 IsEmpty]: Start isEmpty. Operand 384171 states and 1634979 transitions. [2019-12-07 10:09:43,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:09:43,259 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:09:43,259 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:09:43,259 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 10:09:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:09:43,260 INFO L82 PathProgramCache]: Analyzing trace with hash 493446192, now seen corresponding path program 1 times [2019-12-07 10:09:43,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:09:43,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561088162] [2019-12-07 10:09:43,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:09:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:09:43,287 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 10:09:43,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561088162] [2019-12-07 10:09:43,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:09:43,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:09:43,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105129295] [2019-12-07 10:09:43,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:09:43,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:09:43,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:09:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:09:43,289 INFO L87 Difference]: Start difference. First operand 384171 states and 1634979 transitions. Second operand 3 states. [2019-12-07 10:09:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:09:46,063 INFO L93 Difference]: Finished difference Result 487357 states and 2067055 transitions. [2019-12-07 10:09:46,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:09:46,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 10:09:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:09:52,210 INFO L225 Difference]: With dead ends: 487357 [2019-12-07 10:09:52,210 INFO L226 Difference]: Without dead ends: 487357 [2019-12-07 10:09:52,210 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 10:10:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487357 states. [2019-12-07 10:10:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487357 to 416410. [2019-12-07 10:10:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416410 states. [2019-12-07 10:10:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416410 states to 416410 states and 1777918 transitions. [2019-12-07 10:10:10,486 INFO L78 Accepts]: Start accepts. Automaton has 416410 states and 1777918 transitions. Word has length 14 [2019-12-07 10:10:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:10,486 INFO L462 AbstractCegarLoop]: Abstraction has 416410 states and 1777918 transitions. [2019-12-07 10:10:10,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:10:10,486 INFO L276 IsEmpty]: Start isEmpty. Operand 416410 states and 1777918 transitions. [2019-12-07 10:10:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:10:10,492 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:10,492 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:10:10,492 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 10:10:10,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:10,492 INFO L82 PathProgramCache]: Analyzing trace with hash 301502779, now seen corresponding path program 1 times [2019-12-07 10:10:10,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:10,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698027574] [2019-12-07 10:10:10,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:10,547 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 10:10:10,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698027574] [2019-12-07 10:10:10,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:10,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:10:10,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911407730] [2019-12-07 10:10:10,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:10:10,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:10,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:10:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:10:10,549 INFO L87 Difference]: Start difference. First operand 416410 states and 1777918 transitions. Second operand 5 states. [2019-12-07 10:10:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:13,822 INFO L93 Difference]: Finished difference Result 556842 states and 2341204 transitions. [2019-12-07 10:10:13,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:10:13,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-07 10:10:13,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:20,482 INFO L225 Difference]: With dead ends: 556842 [2019-12-07 10:10:20,483 INFO L226 Difference]: Without dead ends: 556842 [2019-12-07 10:10:20,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:10:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556842 states. [2019-12-07 10:10:38,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556842 to 435050. [2019-12-07 10:10:38,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435050 states. [2019-12-07 10:10:40,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435050 states to 435050 states and 1857227 transitions. [2019-12-07 10:10:40,871 INFO L78 Accepts]: Start accepts. Automaton has 435050 states and 1857227 transitions. Word has length 14 [2019-12-07 10:10:40,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:10:40,871 INFO L462 AbstractCegarLoop]: Abstraction has 435050 states and 1857227 transitions. [2019-12-07 10:10:40,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:10:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 435050 states and 1857227 transitions. [2019-12-07 10:10:40,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 10:10:40,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:10:40,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:10:40,898 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 10:10:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:10:40,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1090844104, now seen corresponding path program 1 times [2019-12-07 10:10:40,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:10:40,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816130271] [2019-12-07 10:10:40,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:10:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:10:40,937 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 10:10:40,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816130271] [2019-12-07 10:10:40,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:10:40,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:10:40,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761783800] [2019-12-07 10:10:40,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:10:40,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:10:40,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:10:40,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:10:40,939 INFO L87 Difference]: Start difference. First operand 435050 states and 1857227 transitions. Second operand 5 states. [2019-12-07 10:10:48,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:10:48,968 INFO L93 Difference]: Finished difference Result 626269 states and 2616026 transitions. [2019-12-07 10:10:48,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:10:48,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 10:10:48,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:10:50,949 INFO L225 Difference]: With dead ends: 626269 [2019-12-07 10:10:50,950 INFO L226 Difference]: Without dead ends: 626178 [2019-12-07 10:10:50,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:11:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626178 states. [2019-12-07 10:11:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626178 to 460898. [2019-12-07 10:11:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460898 states. [2019-12-07 10:11:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460898 states to 460898 states and 1962556 transitions. [2019-12-07 10:11:12,970 INFO L78 Accepts]: Start accepts. Automaton has 460898 states and 1962556 transitions. Word has length 19 [2019-12-07 10:11:12,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:12,970 INFO L462 AbstractCegarLoop]: Abstraction has 460898 states and 1962556 transitions. [2019-12-07 10:11:12,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:11:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 460898 states and 1962556 transitions. [2019-12-07 10:11:13,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:11:13,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:13,003 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:11:13,003 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 10:11:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:13,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1357177300, now seen corresponding path program 1 times [2019-12-07 10:11:13,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:13,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197648986] [2019-12-07 10:11:13,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:13,033 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 10:11:13,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197648986] [2019-12-07 10:11:13,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:13,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:11:13,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529724306] [2019-12-07 10:11:13,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:11:13,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:13,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:11:13,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:11:13,035 INFO L87 Difference]: Start difference. First operand 460898 states and 1962556 transitions. Second operand 3 states. [2019-12-07 10:11:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:15,931 INFO L93 Difference]: Finished difference Result 460898 states and 1949774 transitions. [2019-12-07 10:11:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:11:15,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 10:11:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:17,272 INFO L225 Difference]: With dead ends: 460898 [2019-12-07 10:11:17,272 INFO L226 Difference]: Without dead ends: 460898 [2019-12-07 10:11:17,273 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 10:11:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460898 states. [2019-12-07 10:11:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460898 to 457826. [2019-12-07 10:11:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457826 states. [2019-12-07 10:11:40,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457826 states to 457826 states and 1938418 transitions. [2019-12-07 10:11:40,711 INFO L78 Accepts]: Start accepts. Automaton has 457826 states and 1938418 transitions. Word has length 20 [2019-12-07 10:11:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:11:40,712 INFO L462 AbstractCegarLoop]: Abstraction has 457826 states and 1938418 transitions. [2019-12-07 10:11:40,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:11:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 457826 states and 1938418 transitions. [2019-12-07 10:11:40,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 10:11:40,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:11:40,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:11:40,746 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 10:11:40,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:11:40,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1638452381, now seen corresponding path program 1 times [2019-12-07 10:11:40,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:11:40,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456114826] [2019-12-07 10:11:40,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:11:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:11:40,779 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 10:11:40,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456114826] [2019-12-07 10:11:40,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:11:40,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:11:40,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849214688] [2019-12-07 10:11:40,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:11:40,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:11:40,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:11:40,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:11:40,781 INFO L87 Difference]: Start difference. First operand 457826 states and 1938418 transitions. Second operand 4 states. [2019-12-07 10:11:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:11:43,509 INFO L93 Difference]: Finished difference Result 479671 states and 2008546 transitions. [2019-12-07 10:11:43,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:11:43,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 10:11:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:11:44,799 INFO L225 Difference]: With dead ends: 479671 [2019-12-07 10:11:44,799 INFO L226 Difference]: Without dead ends: 455109 [2019-12-07 10:11:44,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 10:11:59,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455109 states. [2019-12-07 10:12:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455109 to 455109. [2019-12-07 10:12:06,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455109 states. [2019-12-07 10:12:08,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455109 states to 455109 states and 1923510 transitions. [2019-12-07 10:12:08,114 INFO L78 Accepts]: Start accepts. Automaton has 455109 states and 1923510 transitions. Word has length 20 [2019-12-07 10:12:08,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:08,114 INFO L462 AbstractCegarLoop]: Abstraction has 455109 states and 1923510 transitions. [2019-12-07 10:12:08,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:12:08,114 INFO L276 IsEmpty]: Start isEmpty. Operand 455109 states and 1923510 transitions. [2019-12-07 10:12:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 10:12:08,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:08,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:08,157 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 10:12:08,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2111276614, now seen corresponding path program 1 times [2019-12-07 10:12:08,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:08,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136586672] [2019-12-07 10:12:08,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:08,209 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 10:12:08,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136586672] [2019-12-07 10:12:08,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:08,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:08,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487851449] [2019-12-07 10:12:08,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:08,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:08,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:08,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:08,211 INFO L87 Difference]: Start difference. First operand 455109 states and 1923510 transitions. Second operand 5 states. [2019-12-07 10:12:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:10,939 INFO L93 Difference]: Finished difference Result 479504 states and 2013854 transitions. [2019-12-07 10:12:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:12:10,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 10:12:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:11,183 INFO L225 Difference]: With dead ends: 479504 [2019-12-07 10:12:11,183 INFO L226 Difference]: Without dead ends: 110017 [2019-12-07 10:12:11,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:12:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110017 states. [2019-12-07 10:12:18,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110017 to 105634. [2019-12-07 10:12:18,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105634 states. [2019-12-07 10:12:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105634 states to 105634 states and 390939 transitions. [2019-12-07 10:12:18,848 INFO L78 Accepts]: Start accepts. Automaton has 105634 states and 390939 transitions. Word has length 21 [2019-12-07 10:12:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:18,848 INFO L462 AbstractCegarLoop]: Abstraction has 105634 states and 390939 transitions. [2019-12-07 10:12:18,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 105634 states and 390939 transitions. [2019-12-07 10:12:18,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:12:18,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:18,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] [2019-12-07 10:12:18,857 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 10:12:18,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:18,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1815258356, now seen corresponding path program 1 times [2019-12-07 10:12:18,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:18,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660685570] [2019-12-07 10:12:18,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:18,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:18,921 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 10:12:18,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660685570] [2019-12-07 10:12:18,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:18,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:18,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691664968] [2019-12-07 10:12:18,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:18,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:18,922 INFO L87 Difference]: Start difference. First operand 105634 states and 390939 transitions. Second operand 5 states. [2019-12-07 10:12:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:19,721 INFO L93 Difference]: Finished difference Result 158159 states and 574377 transitions. [2019-12-07 10:12:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:12:19,722 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 10:12:19,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:20,043 INFO L225 Difference]: With dead ends: 158159 [2019-12-07 10:12:20,043 INFO L226 Difference]: Without dead ends: 157494 [2019-12-07 10:12:20,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:12:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157494 states. [2019-12-07 10:12:23,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157494 to 111233. [2019-12-07 10:12:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111233 states. [2019-12-07 10:12:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111233 states to 111233 states and 410819 transitions. [2019-12-07 10:12:23,661 INFO L78 Accepts]: Start accepts. Automaton has 111233 states and 410819 transitions. Word has length 22 [2019-12-07 10:12:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:23,661 INFO L462 AbstractCegarLoop]: Abstraction has 111233 states and 410819 transitions. [2019-12-07 10:12:23,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 111233 states and 410819 transitions. [2019-12-07 10:12:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:12:23,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:23,670 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 10:12:23,670 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 10:12:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1131197002, now seen corresponding path program 1 times [2019-12-07 10:12:23,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:23,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269138172] [2019-12-07 10:12:23,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:23,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:23,724 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 10:12:23,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269138172] [2019-12-07 10:12:23,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:23,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:23,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919421018] [2019-12-07 10:12:23,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:23,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:23,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:23,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:23,726 INFO L87 Difference]: Start difference. First operand 111233 states and 410819 transitions. Second operand 6 states. [2019-12-07 10:12:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:24,712 INFO L93 Difference]: Finished difference Result 174021 states and 631034 transitions. [2019-12-07 10:12:24,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:12:24,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 10:12:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:25,055 INFO L225 Difference]: With dead ends: 174021 [2019-12-07 10:12:25,055 INFO L226 Difference]: Without dead ends: 173356 [2019-12-07 10:12:25,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:12:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173356 states. [2019-12-07 10:12:28,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173356 to 107265. [2019-12-07 10:12:28,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107265 states. [2019-12-07 10:12:28,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107265 states to 107265 states and 396321 transitions. [2019-12-07 10:12:28,825 INFO L78 Accepts]: Start accepts. Automaton has 107265 states and 396321 transitions. Word has length 22 [2019-12-07 10:12:28,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:28,826 INFO L462 AbstractCegarLoop]: Abstraction has 107265 states and 396321 transitions. [2019-12-07 10:12:28,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 107265 states and 396321 transitions. [2019-12-07 10:12:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 10:12:28,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:28,834 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 10:12:28,835 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 10:12:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash 242756801, now seen corresponding path program 1 times [2019-12-07 10:12:28,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:28,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589134350] [2019-12-07 10:12:28,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:28,875 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 10:12:28,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589134350] [2019-12-07 10:12:28,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:28,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:28,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755058794] [2019-12-07 10:12:28,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:12:28,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:28,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:12:28,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:12:28,876 INFO L87 Difference]: Start difference. First operand 107265 states and 396321 transitions. Second operand 4 states. [2019-12-07 10:12:28,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:28,970 INFO L93 Difference]: Finished difference Result 24734 states and 76261 transitions. [2019-12-07 10:12:28,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:12:28,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 10:12:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:28,995 INFO L225 Difference]: With dead ends: 24734 [2019-12-07 10:12:28,995 INFO L226 Difference]: Without dead ends: 20829 [2019-12-07 10:12:28,996 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 10:12:29,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20829 states. [2019-12-07 10:12:29,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20829 to 20443. [2019-12-07 10:12:29,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20443 states. [2019-12-07 10:12:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20443 states to 20443 states and 61013 transitions. [2019-12-07 10:12:29,258 INFO L78 Accepts]: Start accepts. Automaton has 20443 states and 61013 transitions. Word has length 22 [2019-12-07 10:12:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:29,259 INFO L462 AbstractCegarLoop]: Abstraction has 20443 states and 61013 transitions. [2019-12-07 10:12:29,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:12:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 20443 states and 61013 transitions. [2019-12-07 10:12:29,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:12:29,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:29,263 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 10:12:29,263 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 10:12:29,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:29,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1294927494, now seen corresponding path program 1 times [2019-12-07 10:12:29,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:29,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804176293] [2019-12-07 10:12:29,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:29,286 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 10:12:29,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804176293] [2019-12-07 10:12:29,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:29,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:29,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57626404] [2019-12-07 10:12:29,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:29,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:29,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:29,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:29,288 INFO L87 Difference]: Start difference. First operand 20443 states and 61013 transitions. Second operand 3 states. [2019-12-07 10:12:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:29,383 INFO L93 Difference]: Finished difference Result 34669 states and 103072 transitions. [2019-12-07 10:12:29,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:29,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-07 10:12:29,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:29,423 INFO L225 Difference]: With dead ends: 34669 [2019-12-07 10:12:29,424 INFO L226 Difference]: Without dead ends: 34669 [2019-12-07 10:12:29,424 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 10:12:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34669 states. [2019-12-07 10:12:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34669 to 20443. [2019-12-07 10:12:29,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20443 states. [2019-12-07 10:12:29,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20443 states to 20443 states and 59860 transitions. [2019-12-07 10:12:29,784 INFO L78 Accepts]: Start accepts. Automaton has 20443 states and 59860 transitions. Word has length 25 [2019-12-07 10:12:29,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:29,784 INFO L462 AbstractCegarLoop]: Abstraction has 20443 states and 59860 transitions. [2019-12-07 10:12:29,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 20443 states and 59860 transitions. [2019-12-07 10:12:29,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 10:12:29,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:29,788 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 10:12:29,788 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 10:12:29,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash 162333435, now seen corresponding path program 1 times [2019-12-07 10:12:29,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:29,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636926516] [2019-12-07 10:12:29,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:29,856 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 10:12:29,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636926516] [2019-12-07 10:12:29,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:29,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:29,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414646145] [2019-12-07 10:12:29,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:29,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:29,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:29,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:29,857 INFO L87 Difference]: Start difference. First operand 20443 states and 59860 transitions. Second operand 6 states. [2019-12-07 10:12:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:30,224 INFO L93 Difference]: Finished difference Result 30166 states and 87056 transitions. [2019-12-07 10:12:30,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 10:12:30,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 10:12:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:30,257 INFO L225 Difference]: With dead ends: 30166 [2019-12-07 10:12:30,257 INFO L226 Difference]: Without dead ends: 29717 [2019-12-07 10:12:30,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:12:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29717 states. [2019-12-07 10:12:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29717 to 23075. [2019-12-07 10:12:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23075 states. [2019-12-07 10:12:30,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23075 states to 23075 states and 67401 transitions. [2019-12-07 10:12:30,608 INFO L78 Accepts]: Start accepts. Automaton has 23075 states and 67401 transitions. Word has length 25 [2019-12-07 10:12:30,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:30,608 INFO L462 AbstractCegarLoop]: Abstraction has 23075 states and 67401 transitions. [2019-12-07 10:12:30,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:30,608 INFO L276 IsEmpty]: Start isEmpty. Operand 23075 states and 67401 transitions. [2019-12-07 10:12:30,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 10:12:30,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:30,613 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:30,613 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 10:12:30,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:30,613 INFO L82 PathProgramCache]: Analyzing trace with hash 864615985, now seen corresponding path program 1 times [2019-12-07 10:12:30,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:30,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317703881] [2019-12-07 10:12:30,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:30,869 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 10:12:30,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317703881] [2019-12-07 10:12:30,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:30,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:12:30,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473283263] [2019-12-07 10:12:30,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:30,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:30,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:30,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:30,870 INFO L87 Difference]: Start difference. First operand 23075 states and 67401 transitions. Second operand 5 states. [2019-12-07 10:12:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:31,219 INFO L93 Difference]: Finished difference Result 36938 states and 107556 transitions. [2019-12-07 10:12:31,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:12:31,220 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 10:12:31,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:31,258 INFO L225 Difference]: With dead ends: 36938 [2019-12-07 10:12:31,258 INFO L226 Difference]: Without dead ends: 36381 [2019-12-07 10:12:31,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 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 10:12:31,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36381 states. [2019-12-07 10:12:31,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36381 to 22473. [2019-12-07 10:12:31,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22473 states. [2019-12-07 10:12:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22473 states to 22473 states and 65309 transitions. [2019-12-07 10:12:31,618 INFO L78 Accepts]: Start accepts. Automaton has 22473 states and 65309 transitions. Word has length 26 [2019-12-07 10:12:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:31,619 INFO L462 AbstractCegarLoop]: Abstraction has 22473 states and 65309 transitions. [2019-12-07 10:12:31,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22473 states and 65309 transitions. [2019-12-07 10:12:31,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:12:31,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:31,625 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 10:12:31,625 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 10:12:31,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:31,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1640457078, now seen corresponding path program 1 times [2019-12-07 10:12:31,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:31,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535824506] [2019-12-07 10:12:31,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:31,681 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 10:12:31,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535824506] [2019-12-07 10:12:31,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:31,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:12:31,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306690867] [2019-12-07 10:12:31,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:31,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:31,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:31,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:31,682 INFO L87 Difference]: Start difference. First operand 22473 states and 65309 transitions. Second operand 6 states. [2019-12-07 10:12:32,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:32,086 INFO L93 Difference]: Finished difference Result 35097 states and 101411 transitions. [2019-12-07 10:12:32,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 10:12:32,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 10:12:32,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:32,123 INFO L225 Difference]: With dead ends: 35097 [2019-12-07 10:12:32,123 INFO L226 Difference]: Without dead ends: 34416 [2019-12-07 10:12:32,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:12:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34416 states. [2019-12-07 10:12:32,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34416 to 22746. [2019-12-07 10:12:32,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22746 states. [2019-12-07 10:12:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22746 states to 22746 states and 66134 transitions. [2019-12-07 10:12:32,477 INFO L78 Accepts]: Start accepts. Automaton has 22746 states and 66134 transitions. Word has length 33 [2019-12-07 10:12:32,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:32,477 INFO L462 AbstractCegarLoop]: Abstraction has 22746 states and 66134 transitions. [2019-12-07 10:12:32,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:32,477 INFO L276 IsEmpty]: Start isEmpty. Operand 22746 states and 66134 transitions. [2019-12-07 10:12:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:12:32,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:32,484 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:32,484 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 10:12:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1901024784, now seen corresponding path program 1 times [2019-12-07 10:12:32,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:32,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558701565] [2019-12-07 10:12:32,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:32,537 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 10:12:32,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558701565] [2019-12-07 10:12:32,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:32,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:12:32,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352353415] [2019-12-07 10:12:32,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:32,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:32,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:32,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:32,539 INFO L87 Difference]: Start difference. First operand 22746 states and 66134 transitions. Second operand 5 states. [2019-12-07 10:12:32,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:32,594 INFO L93 Difference]: Finished difference Result 11122 states and 31286 transitions. [2019-12-07 10:12:32,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:12:32,594 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-07 10:12:32,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:32,603 INFO L225 Difference]: With dead ends: 11122 [2019-12-07 10:12:32,603 INFO L226 Difference]: Without dead ends: 10315 [2019-12-07 10:12:32,604 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 10:12:32,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10315 states. [2019-12-07 10:12:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10315 to 10108. [2019-12-07 10:12:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10108 states. [2019-12-07 10:12:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10108 states to 10108 states and 28659 transitions. [2019-12-07 10:12:32,715 INFO L78 Accepts]: Start accepts. Automaton has 10108 states and 28659 transitions. Word has length 34 [2019-12-07 10:12:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:32,715 INFO L462 AbstractCegarLoop]: Abstraction has 10108 states and 28659 transitions. [2019-12-07 10:12:32,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 10108 states and 28659 transitions. [2019-12-07 10:12:32,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:12:32,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:32,721 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:32,722 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 10:12:32,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:32,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1142464834, now seen corresponding path program 1 times [2019-12-07 10:12:32,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:32,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792344205] [2019-12-07 10:12:32,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:32,791 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 10:12:32,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792344205] [2019-12-07 10:12:32,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:32,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:32,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366054460] [2019-12-07 10:12:32,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:32,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:32,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:32,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:32,792 INFO L87 Difference]: Start difference. First operand 10108 states and 28659 transitions. Second operand 6 states. [2019-12-07 10:12:33,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:33,234 INFO L93 Difference]: Finished difference Result 16031 states and 44727 transitions. [2019-12-07 10:12:33,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:12:33,234 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 10:12:33,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:33,248 INFO L225 Difference]: With dead ends: 16031 [2019-12-07 10:12:33,248 INFO L226 Difference]: Without dead ends: 15863 [2019-12-07 10:12:33,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:12:33,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15863 states. [2019-12-07 10:12:33,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15863 to 10038. [2019-12-07 10:12:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10038 states. [2019-12-07 10:12:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10038 states to 10038 states and 28489 transitions. [2019-12-07 10:12:33,391 INFO L78 Accepts]: Start accepts. Automaton has 10038 states and 28489 transitions. Word has length 34 [2019-12-07 10:12:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:33,392 INFO L462 AbstractCegarLoop]: Abstraction has 10038 states and 28489 transitions. [2019-12-07 10:12:33,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:33,392 INFO L276 IsEmpty]: Start isEmpty. Operand 10038 states and 28489 transitions. [2019-12-07 10:12:33,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:12:33,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:33,397 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:33,398 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 10:12:33,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:33,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1793840738, now seen corresponding path program 2 times [2019-12-07 10:12:33,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:33,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784242422] [2019-12-07 10:12:33,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:33,527 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 10:12:33,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784242422] [2019-12-07 10:12:33,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:33,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:12:33,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051292505] [2019-12-07 10:12:33,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:12:33,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:33,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:12:33,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:12:33,528 INFO L87 Difference]: Start difference. First operand 10038 states and 28489 transitions. Second operand 11 states. [2019-12-07 10:12:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:34,868 INFO L93 Difference]: Finished difference Result 27267 states and 76955 transitions. [2019-12-07 10:12:34,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 10:12:34,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-07 10:12:34,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:34,896 INFO L225 Difference]: With dead ends: 27267 [2019-12-07 10:12:34,896 INFO L226 Difference]: Without dead ends: 27150 [2019-12-07 10:12:34,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:12:34,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27150 states. [2019-12-07 10:12:35,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27150 to 11954. [2019-12-07 10:12:35,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11954 states. [2019-12-07 10:12:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11954 states to 11954 states and 33851 transitions. [2019-12-07 10:12:35,123 INFO L78 Accepts]: Start accepts. Automaton has 11954 states and 33851 transitions. Word has length 34 [2019-12-07 10:12:35,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:35,123 INFO L462 AbstractCegarLoop]: Abstraction has 11954 states and 33851 transitions. [2019-12-07 10:12:35,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:12:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 11954 states and 33851 transitions. [2019-12-07 10:12:35,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 10:12:35,130 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:35,130 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:35,131 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 10:12:35,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:35,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1667040740, now seen corresponding path program 3 times [2019-12-07 10:12:35,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:35,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553061376] [2019-12-07 10:12:35,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:35,203 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 10:12:35,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553061376] [2019-12-07 10:12:35,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:35,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:35,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008835626] [2019-12-07 10:12:35,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:35,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:35,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:35,204 INFO L87 Difference]: Start difference. First operand 11954 states and 33851 transitions. Second operand 6 states. [2019-12-07 10:12:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:35,620 INFO L93 Difference]: Finished difference Result 17699 states and 49627 transitions. [2019-12-07 10:12:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 10:12:35,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-07 10:12:35,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:35,636 INFO L225 Difference]: With dead ends: 17699 [2019-12-07 10:12:35,637 INFO L226 Difference]: Without dead ends: 17433 [2019-12-07 10:12:35,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 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 10:12:35,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17433 states. [2019-12-07 10:12:35,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17433 to 10429. [2019-12-07 10:12:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10429 states. [2019-12-07 10:12:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10429 states to 10429 states and 29430 transitions. [2019-12-07 10:12:35,791 INFO L78 Accepts]: Start accepts. Automaton has 10429 states and 29430 transitions. Word has length 34 [2019-12-07 10:12:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:35,791 INFO L462 AbstractCegarLoop]: Abstraction has 10429 states and 29430 transitions. [2019-12-07 10:12:35,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 10429 states and 29430 transitions. [2019-12-07 10:12:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-07 10:12:35,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:35,799 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:12:35,799 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 10:12:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash -812314550, now seen corresponding path program 1 times [2019-12-07 10:12:35,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:35,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714155742] [2019-12-07 10:12:35,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:35,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 10:12:35,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714155742] [2019-12-07 10:12:35,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:35,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:35,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66127060] [2019-12-07 10:12:35,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:12:35,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:35,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:12:35,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:35,864 INFO L87 Difference]: Start difference. First operand 10429 states and 29430 transitions. Second operand 6 states. [2019-12-07 10:12:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:35,929 INFO L93 Difference]: Finished difference Result 9820 states and 28136 transitions. [2019-12-07 10:12:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:12:35,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-07 10:12:35,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:35,938 INFO L225 Difference]: With dead ends: 9820 [2019-12-07 10:12:35,938 INFO L226 Difference]: Without dead ends: 9314 [2019-12-07 10:12:35,939 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 10:12:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9314 states. [2019-12-07 10:12:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9314 to 8288. [2019-12-07 10:12:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8288 states. [2019-12-07 10:12:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8288 states to 8288 states and 24191 transitions. [2019-12-07 10:12:36,041 INFO L78 Accepts]: Start accepts. Automaton has 8288 states and 24191 transitions. Word has length 51 [2019-12-07 10:12:36,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:36,041 INFO L462 AbstractCegarLoop]: Abstraction has 8288 states and 24191 transitions. [2019-12-07 10:12:36,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:12:36,041 INFO L276 IsEmpty]: Start isEmpty. Operand 8288 states and 24191 transitions. [2019-12-07 10:12:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:12:36,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:36,047 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, 1] [2019-12-07 10:12:36,047 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 10:12:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:36,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1107431318, now seen corresponding path program 1 times [2019-12-07 10:12:36,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:36,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252887362] [2019-12-07 10:12:36,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:36,065 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 10:12:36,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252887362] [2019-12-07 10:12:36,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:36,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:36,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173840277] [2019-12-07 10:12:36,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:36,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:36,066 INFO L87 Difference]: Start difference. First operand 8288 states and 24191 transitions. Second operand 3 states. [2019-12-07 10:12:36,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:36,193 INFO L93 Difference]: Finished difference Result 10149 states and 29640 transitions. [2019-12-07 10:12:36,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:36,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 10:12:36,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:36,202 INFO L225 Difference]: With dead ends: 10149 [2019-12-07 10:12:36,202 INFO L226 Difference]: Without dead ends: 10149 [2019-12-07 10:12:36,202 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 10:12:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10149 states. [2019-12-07 10:12:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10149 to 7756. [2019-12-07 10:12:36,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7756 states. [2019-12-07 10:12:36,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7756 states to 7756 states and 22498 transitions. [2019-12-07 10:12:36,304 INFO L78 Accepts]: Start accepts. Automaton has 7756 states and 22498 transitions. Word has length 68 [2019-12-07 10:12:36,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:36,304 INFO L462 AbstractCegarLoop]: Abstraction has 7756 states and 22498 transitions. [2019-12-07 10:12:36,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:36,304 INFO L276 IsEmpty]: Start isEmpty. Operand 7756 states and 22498 transitions. [2019-12-07 10:12:36,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:12:36,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:36,310 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, 1] [2019-12-07 10:12:36,310 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:36,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:36,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1554526866, now seen corresponding path program 2 times [2019-12-07 10:12:36,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:36,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493877557] [2019-12-07 10:12:36,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:36,400 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 10:12:36,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493877557] [2019-12-07 10:12:36,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:36,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 10:12:36,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794593095] [2019-12-07 10:12:36,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 10:12:36,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:36,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 10:12:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 10:12:36,402 INFO L87 Difference]: Start difference. First operand 7756 states and 22498 transitions. Second operand 8 states. [2019-12-07 10:12:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:36,855 INFO L93 Difference]: Finished difference Result 9860 states and 28404 transitions. [2019-12-07 10:12:36,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:12:36,855 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-07 10:12:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:36,864 INFO L225 Difference]: With dead ends: 9860 [2019-12-07 10:12:36,864 INFO L226 Difference]: Without dead ends: 9860 [2019-12-07 10:12:36,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:12:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9860 states. [2019-12-07 10:12:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9860 to 7796. [2019-12-07 10:12:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7796 states. [2019-12-07 10:12:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7796 states to 7796 states and 22642 transitions. [2019-12-07 10:12:36,963 INFO L78 Accepts]: Start accepts. Automaton has 7796 states and 22642 transitions. Word has length 68 [2019-12-07 10:12:36,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:36,964 INFO L462 AbstractCegarLoop]: Abstraction has 7796 states and 22642 transitions. [2019-12-07 10:12:36,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 10:12:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7796 states and 22642 transitions. [2019-12-07 10:12:36,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:12:36,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:36,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:12:36,969 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:36,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1217183450, now seen corresponding path program 3 times [2019-12-07 10:12:36,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:36,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368028417] [2019-12-07 10:12:36,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:37,016 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 10:12:37,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368028417] [2019-12-07 10:12:37,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:37,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:37,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538436701] [2019-12-07 10:12:37,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:12:37,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:12:37,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:37,017 INFO L87 Difference]: Start difference. First operand 7796 states and 22642 transitions. Second operand 5 states. [2019-12-07 10:12:37,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:37,242 INFO L93 Difference]: Finished difference Result 9812 states and 28270 transitions. [2019-12-07 10:12:37,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:12:37,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-07 10:12:37,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:37,251 INFO L225 Difference]: With dead ends: 9812 [2019-12-07 10:12:37,251 INFO L226 Difference]: Without dead ends: 9812 [2019-12-07 10:12:37,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:12:37,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9812 states. [2019-12-07 10:12:37,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9812 to 7926. [2019-12-07 10:12:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7926 states. [2019-12-07 10:12:37,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7926 states to 7926 states and 23059 transitions. [2019-12-07 10:12:37,350 INFO L78 Accepts]: Start accepts. Automaton has 7926 states and 23059 transitions. Word has length 68 [2019-12-07 10:12:37,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:37,350 INFO L462 AbstractCegarLoop]: Abstraction has 7926 states and 23059 transitions. [2019-12-07 10:12:37,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:12:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7926 states and 23059 transitions. [2019-12-07 10:12:37,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 10:12:37,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:37,356 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, 1] [2019-12-07 10:12:37,356 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -411611032, now seen corresponding path program 4 times [2019-12-07 10:12:37,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:37,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088893403] [2019-12-07 10:12:37,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:37,386 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 10:12:37,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088893403] [2019-12-07 10:12:37,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:37,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:37,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327632839] [2019-12-07 10:12:37,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:37,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:37,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:37,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:37,387 INFO L87 Difference]: Start difference. First operand 7926 states and 23059 transitions. Second operand 3 states. [2019-12-07 10:12:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:37,408 INFO L93 Difference]: Finished difference Result 7925 states and 23057 transitions. [2019-12-07 10:12:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:37,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-07 10:12:37,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:37,416 INFO L225 Difference]: With dead ends: 7925 [2019-12-07 10:12:37,417 INFO L226 Difference]: Without dead ends: 7925 [2019-12-07 10:12:37,417 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 10:12:37,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7925 states. [2019-12-07 10:12:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7925 to 7925. [2019-12-07 10:12:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7925 states. [2019-12-07 10:12:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7925 states to 7925 states and 23057 transitions. [2019-12-07 10:12:37,596 INFO L78 Accepts]: Start accepts. Automaton has 7925 states and 23057 transitions. Word has length 68 [2019-12-07 10:12:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:37,596 INFO L462 AbstractCegarLoop]: Abstraction has 7925 states and 23057 transitions. [2019-12-07 10:12:37,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 7925 states and 23057 transitions. [2019-12-07 10:12:37,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-07 10:12:37,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:37,602 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, 1, 1] [2019-12-07 10:12:37,602 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 112126650, now seen corresponding path program 1 times [2019-12-07 10:12:37,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:37,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844977471] [2019-12-07 10:12:37,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:37,646 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 10:12:37,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844977471] [2019-12-07 10:12:37,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:37,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:12:37,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223972873] [2019-12-07 10:12:37,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:12:37,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:37,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:12:37,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:12:37,647 INFO L87 Difference]: Start difference. First operand 7925 states and 23057 transitions. Second operand 3 states. [2019-12-07 10:12:37,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:37,671 INFO L93 Difference]: Finished difference Result 7755 states and 22314 transitions. [2019-12-07 10:12:37,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:12:37,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-07 10:12:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:37,679 INFO L225 Difference]: With dead ends: 7755 [2019-12-07 10:12:37,679 INFO L226 Difference]: Without dead ends: 7755 [2019-12-07 10:12:37,679 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 10:12:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-07 10:12:37,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 6787. [2019-12-07 10:12:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6787 states. [2019-12-07 10:12:37,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6787 states to 6787 states and 19619 transitions. [2019-12-07 10:12:37,763 INFO L78 Accepts]: Start accepts. Automaton has 6787 states and 19619 transitions. Word has length 69 [2019-12-07 10:12:37,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:37,763 INFO L462 AbstractCegarLoop]: Abstraction has 6787 states and 19619 transitions. [2019-12-07 10:12:37,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:12:37,764 INFO L276 IsEmpty]: Start isEmpty. Operand 6787 states and 19619 transitions. [2019-12-07 10:12:37,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:37,768 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:37,768 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, 1, 1, 1] [2019-12-07 10:12:37,768 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:37,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:37,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1038631405, now seen corresponding path program 1 times [2019-12-07 10:12:37,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:37,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322935313] [2019-12-07 10:12:37,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:37,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:37,836 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 10:12:37,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322935313] [2019-12-07 10:12:37,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:37,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:12:37,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328041793] [2019-12-07 10:12:37,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:12:37,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:37,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:12:37,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:12:37,837 INFO L87 Difference]: Start difference. First operand 6787 states and 19619 transitions. Second operand 7 states. [2019-12-07 10:12:37,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:37,888 INFO L93 Difference]: Finished difference Result 9671 states and 28018 transitions. [2019-12-07 10:12:37,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:12:37,888 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-07 10:12:37,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:37,892 INFO L225 Difference]: With dead ends: 9671 [2019-12-07 10:12:37,892 INFO L226 Difference]: Without dead ends: 3256 [2019-12-07 10:12:37,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:12:37,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2019-12-07 10:12:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 3256. [2019-12-07 10:12:37,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3256 states. [2019-12-07 10:12:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3256 states to 3256 states and 9406 transitions. [2019-12-07 10:12:37,943 INFO L78 Accepts]: Start accepts. Automaton has 3256 states and 9406 transitions. Word has length 70 [2019-12-07 10:12:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:37,943 INFO L462 AbstractCegarLoop]: Abstraction has 3256 states and 9406 transitions. [2019-12-07 10:12:37,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:12:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3256 states and 9406 transitions. [2019-12-07 10:12:37,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:37,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:37,946 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, 1, 1, 1] [2019-12-07 10:12:37,946 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:37,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1364559435, now seen corresponding path program 1 times [2019-12-07 10:12:37,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:37,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036632835] [2019-12-07 10:12:37,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:12:37,983 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 10:12:37,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036632835] [2019-12-07 10:12:37,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:12:37,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:12:37,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636835163] [2019-12-07 10:12:37,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:12:37,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 10:12:37,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:12:37,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:12:37,985 INFO L87 Difference]: Start difference. First operand 3256 states and 9406 transitions. Second operand 4 states. [2019-12-07 10:12:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:12:38,008 INFO L93 Difference]: Finished difference Result 3256 states and 9198 transitions. [2019-12-07 10:12:38,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:12:38,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-07 10:12:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:12:38,010 INFO L225 Difference]: With dead ends: 3256 [2019-12-07 10:12:38,011 INFO L226 Difference]: Without dead ends: 3256 [2019-12-07 10:12:38,011 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:12:38,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3256 states. [2019-12-07 10:12:38,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3256 to 2978. [2019-12-07 10:12:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2978 states. [2019-12-07 10:12:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2978 states to 2978 states and 8390 transitions. [2019-12-07 10:12:38,049 INFO L78 Accepts]: Start accepts. Automaton has 2978 states and 8390 transitions. Word has length 70 [2019-12-07 10:12:38,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:12:38,049 INFO L462 AbstractCegarLoop]: Abstraction has 2978 states and 8390 transitions. [2019-12-07 10:12:38,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:12:38,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2978 states and 8390 transitions. [2019-12-07 10:12:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-07 10:12:38,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:12:38,051 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, 1, 1, 1] [2019-12-07 10:12:38,051 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:12:38,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:12:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1353113997, now seen corresponding path program 2 times [2019-12-07 10:12:38,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 10:12:38,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051370220] [2019-12-07 10:12:38,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:12:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:12:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:12:38,163 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 10:12:38,163 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:12:38,165 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse1 (store |v_#valid_75| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_154| 1))) (and (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1780~0.base_24|)) (= v_~x$r_buff1_thd0~0_273 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8 0) (= v_~x$mem_tmp~0_19 0) (= |v_#memory_int_284| (store |v_#memory_int_285| |v_ULTIMATE.start_main_~#t1780~0.base_24| (store (select |v_#memory_int_285| |v_ULTIMATE.start_main_~#t1780~0.base_24|) |v_ULTIMATE.start_main_~#t1780~0.offset_19| 0))) (= 0 v_~x$w_buff1~0_258) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_4 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7 0) (= v_~x$r_buff0_thd1~0_292 0) (= 0 v_~weak$$choice1~0_85) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed~0_56 0) (= v_~x$r_buff1_thd1~0_239 0) (= 0 v_~x$w_buff1_used~0_675) (= 0 v_~x$r_buff0_thd2~0_541) (= 0 v_~x$read_delayed~0_8) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (= 0 v_~x$w_buff0~0_331) (= 0 v_~weak$$choice0~0_164) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff1_thd3~0_256) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_45 0) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 |v_~#x~0.offset_154|) (= v_~x$r_buff0_thd0~0_123 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~x$r_buff0_thd3~0_137) (= (select .cse1 |v_~#x~0.base_154|) 0) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~weak$$choice2~0_80) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_154|) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_45 0) (= |v_#length_34| (store (store |v_#length_35| |v_~#x~0.base_154| 4) |v_ULTIMATE.start_main_~#t1780~0.base_24| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_6 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_7 0) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= v_~x$w_buff0_used~0_1111 0) (= 0 v_~__unbuffered_p0_EAX~0_122) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_cnt~0_123 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_5 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1780~0.base_24| 1)) (= v_~y~0_133 0) (= 0 v_~x$r_buff1_thd2~0_595) (= 0 v_~__unbuffered_p2_EAX~0_37) (= |v_ULTIMATE.start_main_~#t1780~0.offset_19| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1780~0.base_24|) (= (select (select |v_#memory_int_285| |v_~#x~0.base_154|) |v_~#x~0.offset_154|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_285|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_239, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~weak$$choice1~0=v_~weak$$choice1~0_85, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_122, ULTIMATE.start_main_~#t1782~0.base=|v_ULTIMATE.start_main_~#t1782~0.base_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_45, #length=|v_#length_34|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_4, ~#x~0.offset=|v_~#x~0.offset_154|, ~x$w_buff1~0=v_~x$w_buff1~0_258, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_675, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_595, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_73|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_29|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_91|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_164, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_105|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_7, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_71|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_6, ULTIMATE.start_main_~#t1780~0.base=|v_ULTIMATE.start_main_~#t1780~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_~#t1780~0.offset=|v_ULTIMATE.start_main_~#t1780~0.offset_19|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_20|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_5, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_292, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_10|, ULTIMATE.start_main_~#t1781~0.base=|v_ULTIMATE.start_main_~#t1781~0.base_22|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_256, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_47|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_6, ~y~0=v_~y~0_133, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_28|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_273, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_541, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_28|, ULTIMATE.start_main_~#t1782~0.offset=|v_ULTIMATE.start_main_~#t1782~0.offset_17|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1111, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_40|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_284|, ~#x~0.base=|v_~#x~0.base_154|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~weak$$choice2~0=v_~weak$$choice2~0_80, ULTIMATE.start_main_~#t1781~0.offset=|v_ULTIMATE.start_main_~#t1781~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1782~0.base, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ULTIMATE.start_main_~#t1780~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1780~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ULTIMATE.start_main_~#t1781~0.base, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, ULTIMATE.start_main_~#t1782~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1781~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:12:38,166 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L840-1-->L842: Formula: (and (= (store |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1781~0.base_10| (store (select |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1781~0.base_10|) |v_ULTIMATE.start_main_~#t1781~0.offset_9| 1)) |v_#memory_int_154|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1781~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1781~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1781~0.base_10|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1781~0.base_10| 4) |v_#length_17|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1781~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1781~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_155|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1781~0.base=|v_ULTIMATE.start_main_~#t1781~0.base_10|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_154|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1781~0.offset=|v_ULTIMATE.start_main_~#t1781~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1781~0.base, ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1781~0.offset] because there is no mapped edge [2019-12-07 10:12:38,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1201] [1201] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1782~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1782~0.base_11| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1782~0.base_11| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t1782~0.offset_9|) (= |v_#memory_int_156| (store |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1782~0.base_11| (store (select |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1782~0.base_11|) |v_ULTIMATE.start_main_~#t1782~0.offset_9| 2))) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1782~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1782~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_157|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_3|, ULTIMATE.start_main_~#t1782~0.base=|v_ULTIMATE.start_main_~#t1782~0.base_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_156|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1782~0.offset=|v_ULTIMATE.start_main_~#t1782~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet74, ULTIMATE.start_main_~#t1782~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1782~0.offset] because there is no mapped edge [2019-12-07 10:12:38,169 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L781-->L781-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1746058200 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1746058200| |P1Thread1of1ForFork0_#t~ite28_Out-1746058200|) .cse0 (= (mod ~x$w_buff0_used~0_In-1746058200 256) 0) (= ~x$w_buff0~0_In-1746058200 |P1Thread1of1ForFork0_#t~ite28_Out-1746058200|)) (and (= |P1Thread1of1ForFork0_#t~ite28_In-1746058200| |P1Thread1of1ForFork0_#t~ite28_Out-1746058200|) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-1746058200| ~x$w_buff0~0_In-1746058200)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1746058200, ~weak$$choice2~0=~weak$$choice2~0_In-1746058200, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_In-1746058200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1746058200, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1746058200|, ~weak$$choice2~0=~weak$$choice2~0_In-1746058200, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1746058200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:12:38,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1095] [1095] L785-->L786: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_8|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_23, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:12:38,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L790-->L797: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| v_~x$mem_tmp~0_4)) |v_#memory_int_39|) (= 1 v_~y~0_8) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~#x~0.offset=|v_~#x~0.offset_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_24|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 10:12:38,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1091] [1091] P0ENTRY-->L4-3: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_~x$w_buff0~0_59 v_~x$w_buff1~0_46) (= 1 v_~x$w_buff0_used~0_228) (= 1 v_~x$w_buff0~0_58) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= v_~y~0_34 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_228 256))) (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_229 v_~x$w_buff1_used~0_124) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17)) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_59, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_46, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_34, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_228, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:12:38,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L817-2-->L817-5: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1556381940 256) 0)) (.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out-1556381940| |P2Thread1of1ForFork1_#t~ite67_Out-1556381940|)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1556381940 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~mem66_Out-1556381940| |P2Thread1of1ForFork1_#t~ite67_Out-1556381940|) (or .cse1 .cse2) (= |P2Thread1of1ForFork1_#t~mem66_Out-1556381940| (select (select |#memory_int_In-1556381940| |~#x~0.base_In-1556381940|) |~#x~0.offset_In-1556381940|))) (and (not .cse2) .cse0 (= ~x$w_buff1~0_In-1556381940 |P2Thread1of1ForFork1_#t~ite67_Out-1556381940|) (not .cse1) (= |P2Thread1of1ForFork1_#t~mem66_In-1556381940| |P2Thread1of1ForFork1_#t~mem66_Out-1556381940|)))) InVars {~#x~0.offset=|~#x~0.offset_In-1556381940|, ~x$w_buff1~0=~x$w_buff1~0_In-1556381940, ~#x~0.base=|~#x~0.base_In-1556381940|, #memory_int=|#memory_int_In-1556381940|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556381940, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1556381940, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In-1556381940|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out-1556381940|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out-1556381940|, ~#x~0.offset=|~#x~0.offset_In-1556381940|, ~x$w_buff1~0=~x$w_buff1~0_In-1556381940, ~#x~0.base=|~#x~0.base_In-1556381940|, #memory_int=|#memory_int_In-1556381940|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556381940, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1556381940, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out-1556381940|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 10:12:38,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In1334763965 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1334763965 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite60_Out1334763965| |P1Thread1of1ForFork0_#t~ite61_Out1334763965|))) (or (and (not .cse0) (= ~x$w_buff1~0_In1334763965 |P1Thread1of1ForFork0_#t~ite60_Out1334763965|) (not .cse1) .cse2 (= |P1Thread1of1ForFork0_#t~mem59_In1334763965| |P1Thread1of1ForFork0_#t~mem59_Out1334763965|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~mem59_Out1334763965| |P1Thread1of1ForFork0_#t~ite60_Out1334763965|) (= |P1Thread1of1ForFork0_#t~mem59_Out1334763965| (select (select |#memory_int_In1334763965| |~#x~0.base_In1334763965|) |~#x~0.offset_In1334763965|)) .cse2))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1334763965|, ~#x~0.offset=|~#x~0.offset_In1334763965|, ~x$w_buff1~0=~x$w_buff1~0_In1334763965, ~#x~0.base=|~#x~0.base_In1334763965|, #memory_int=|#memory_int_In1334763965|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1334763965, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1334763965} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1334763965|, ~#x~0.offset=|~#x~0.offset_In1334763965|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1334763965|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1334763965|, ~x$w_buff1~0=~x$w_buff1~0_In1334763965, ~#x~0.base=|~#x~0.base_In1334763965|, #memory_int=|#memory_int_In1334763965|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1334763965, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1334763965} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 10:12:38,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-522715394 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-522715394 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite69_Out-522715394| ~x$w_buff0_used~0_In-522715394)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite69_Out-522715394| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-522715394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-522715394} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-522715394|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-522715394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-522715394} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 10:12:38,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1001497984 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1001497984 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite62_Out-1001497984| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite62_Out-1001497984| ~x$w_buff0_used~0_In-1001497984)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out-1001497984|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 10:12:38,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1164] [1164] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-2062646798 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2062646798 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-2062646798 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2062646798 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2062646798 |P2Thread1of1ForFork1_#t~ite70_Out-2062646798|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out-2062646798|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2062646798, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2062646798, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2062646798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2062646798, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2062646798, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2062646798, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out-2062646798|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 10:12:38,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1178] [1178] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-872936135 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-872936135 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite71_Out-872936135| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite71_Out-872936135| ~x$r_buff0_thd3~0_In-872936135)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-872936135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out-872936135|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-872936135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 10:12:38,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1062026417 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1062026417 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1062026417 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1062026417 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out1062026417| ~x$r_buff1_thd3~0_In1062026417) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite72_Out1062026417| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1062026417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1062026417, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1062026417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062026417} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1062026417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1062026417, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1062026417, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out1062026417|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062026417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 10:12:38,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L821-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= |v_P2Thread1of1ForFork1_#t~ite72_48| v_~x$r_buff1_thd3~0_207)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_48|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_207, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_47|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:12:38,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1766789498 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1766789498 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1766789498 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1766789498 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1766789498 |P1Thread1of1ForFork0_#t~ite63_Out1766789498|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite63_Out1766789498|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766789498, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766789498} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out1766789498|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766789498, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766789498} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 10:12:38,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1581801045 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1581801045 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite64_Out1581801045| 0)) (and (= ~x$r_buff0_thd2~0_In1581801045 |P1Thread1of1ForFork0_#t~ite64_Out1581801045|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1581801045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1581801045} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out1581801045|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1581801045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1581801045} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 10:12:38,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-701642706 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-701642706 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-701642706 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-701642706 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-701642706 |P1Thread1of1ForFork0_#t~ite65_Out-701642706|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite65_Out-701642706|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-701642706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-701642706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-701642706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-701642706} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out-701642706|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-701642706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-701642706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-701642706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-701642706} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 10:12:38,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1207] [1207] L801-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_311 |v_P1Thread1of1ForFork0_#t~ite65_30|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_311, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:12:38,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1623938411 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1623938411 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out-1623938411| ~x$w_buff0_used~0_In-1623938411) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1623938411| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1623938411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1623938411, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1623938411|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 10:12:38,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-412458802 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-412458802 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-412458802 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-412458802 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite7_Out-412458802| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork2_#t~ite7_Out-412458802| ~x$w_buff1_used~0_In-412458802) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-412458802, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-412458802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-412458802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-412458802} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-412458802, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-412458802|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-412458802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-412458802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-412458802} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 10:12:38,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L764-->L765: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1717474642 256))) (.cse0 (= ~x$r_buff0_thd1~0_Out1717474642 ~x$r_buff0_thd1~0_In1717474642)) (.cse2 (= (mod ~x$w_buff0_used~0_In1717474642 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~x$r_buff0_thd1~0_Out1717474642) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1717474642, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1717474642} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1717474642, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1717474642|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1717474642} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 10:12:38,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L765-->L765-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In629472419 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In629472419 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In629472419 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In629472419 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In629472419 |P0Thread1of1ForFork2_#t~ite9_Out629472419|)) (and (= 0 |P0Thread1of1ForFork2_#t~ite9_Out629472419|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out629472419|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:12:38,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L765-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_182) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_182, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:12:38,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L848-->L850-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_415 256) 0) (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:12:38,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1183] [1183] L850-2-->L850-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-187844000 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-187844000 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite78_Out-187844000| |ULTIMATE.start_main_#t~ite77_Out-187844000|))) (or (and (= |ULTIMATE.start_main_#t~mem76_Out-187844000| |ULTIMATE.start_main_#t~ite77_Out-187844000|) (= (select (select |#memory_int_In-187844000| |~#x~0.base_In-187844000|) |~#x~0.offset_In-187844000|) |ULTIMATE.start_main_#t~mem76_Out-187844000|) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In-187844000 |ULTIMATE.start_main_#t~ite77_Out-187844000|) (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~mem76_In-187844000| |ULTIMATE.start_main_#t~mem76_Out-187844000|) .cse2))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-187844000|, ~#x~0.offset=|~#x~0.offset_In-187844000|, ~x$w_buff1~0=~x$w_buff1~0_In-187844000, ~#x~0.base=|~#x~0.base_In-187844000|, #memory_int=|#memory_int_In-187844000|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-187844000, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-187844000} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-187844000|, ~#x~0.offset=|~#x~0.offset_In-187844000|, ~x$w_buff1~0=~x$w_buff1~0_In-187844000, ~#x~0.base=|~#x~0.base_In-187844000|, #memory_int=|#memory_int_In-187844000|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-187844000, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-187844000|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-187844000, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-187844000|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 10:12:38,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In788741381 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In788741381 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite79_Out788741381|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In788741381 |ULTIMATE.start_main_#t~ite79_Out788741381|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788741381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788741381} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788741381, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out788741381|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788741381} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 10:12:38,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1181] [1181] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In610783480 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In610783480 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In610783480 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In610783480 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In610783480 |ULTIMATE.start_main_#t~ite80_Out610783480|)) (and (= 0 |ULTIMATE.start_main_#t~ite80_Out610783480|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In610783480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In610783480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In610783480, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out610783480|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In610783480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 10:12:38,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1170] [1170] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-965868511 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-965868511 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-965868511 |ULTIMATE.start_main_#t~ite81_Out-965868511|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite81_Out-965868511|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-965868511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-965868511, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-965868511|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 10:12:38,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In396963821 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In396963821 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In396963821 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In396963821 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite82_Out396963821| ~x$r_buff1_thd0~0_In396963821) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite82_Out396963821| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In396963821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In396963821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In396963821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In396963821} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In396963821, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out396963821|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In396963821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In396963821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In396963821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 10:12:38,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L858-->L858-3: Formula: (let ((.cse1 (not (= (mod ~__unbuffered_p1_EAX$read_delayed~0_In-1774894562 256) 0))) (.cse0 (= 0 (mod ~weak$$choice1~0_In-1774894562 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~mem84_In-1774894562| |ULTIMATE.start_main_#t~mem84_Out-1774894562|) .cse1 (= ~__unbuffered_p1_EAX~0_In-1774894562 |ULTIMATE.start_main_#t~ite85_Out-1774894562|)) (and (= |ULTIMATE.start_main_#t~mem84_Out-1774894562| |ULTIMATE.start_main_#t~ite85_Out-1774894562|) .cse1 (not .cse0) (= (select (select |#memory_int_In-1774894562| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1774894562) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1774894562) |ULTIMATE.start_main_#t~mem84_Out-1774894562|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-1774894562, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1774894562, #memory_int=|#memory_int_In-1774894562|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1774894562, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-1774894562|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-1774894562|, ~weak$$choice1~0=~weak$$choice1~0_In-1774894562, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1774894562, #memory_int=|#memory_int_In-1774894562|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-1774894562|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1774894562} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 10:12:38,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L858-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_12 1)) (.cse5 (= 1 v_~__unbuffered_p2_EAX~0_19)) (.cse3 (= 1 v_~__unbuffered_p1_EAX~0_33)) (.cse4 (= 2 v_~__unbuffered_p0_EAX~0_50)) (.cse0 (= v_~y~0_70 2)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite85_21| v_~__unbuffered_p1_EAX~0_33))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) .cse1 .cse2) (and (not .cse4) .cse1 .cse2) (and .cse1 (not .cse5) .cse2) (and .cse5 .cse3 .cse4 .cse0 (= v_~main$tmp_guard1~0_12 0) .cse1)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_70} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 10:12:38,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:12:38,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:12:38 BasicIcfg [2019-12-07 10:12:38,250 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:12:38,250 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:12:38,250 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:12:38,251 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:12:38,251 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:07:30" (3/4) ... [2019-12-07 10:12:38,252 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:12:38,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse1 (store |v_#valid_75| 0 0))) (let ((.cse0 (store .cse1 |v_~#x~0.base_154| 1))) (and (= 0 v_~__unbuffered_p1_EAX$mem_tmp~0_6) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1780~0.base_24|)) (= v_~x$r_buff1_thd0~0_273 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8 0) (= v_~x$mem_tmp~0_19 0) (= |v_#memory_int_284| (store |v_#memory_int_285| |v_ULTIMATE.start_main_~#t1780~0.base_24| (store (select |v_#memory_int_285| |v_ULTIMATE.start_main_~#t1780~0.base_24|) |v_ULTIMATE.start_main_~#t1780~0.offset_19| 0))) (= 0 v_~x$w_buff1~0_258) (= v_~__unbuffered_p1_EAX$r_buff0_thd1~0_4 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7 0) (= v_~x$r_buff0_thd1~0_292 0) (= 0 v_~weak$$choice1~0_85) (= v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8 0) (= v_~__unbuffered_p1_EAX$read_delayed~0_56 0) (= v_~x$r_buff1_thd1~0_239 0) (= 0 v_~x$w_buff1_used~0_675) (= 0 v_~x$r_buff0_thd2~0_541) (= 0 v_~x$read_delayed~0_8) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed_var~0.offset_8) (= v_~__unbuffered_p1_EAX$w_buff0_used~0_8 0) (= 0 v_~x$w_buff0~0_331) (= 0 v_~weak$$choice0~0_164) (= v_~main$tmp_guard1~0_23 0) (= 0 v_~x$r_buff1_thd3~0_256) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_45 0) (= v_~__unbuffered_p1_EAX$w_buff0~0_8 0) (= 0 |v_~#x~0.offset_154|) (= v_~x$r_buff0_thd0~0_123 0) (= 0 v_~__unbuffered_p1_EAX~0_65) (= 0 v_~x$r_buff0_thd3~0_137) (= (select .cse1 |v_~#x~0.base_154|) 0) (= v_~main$tmp_guard0~0_31 0) (= 0 v_~weak$$choice2~0_80) (< |v_#StackHeapBarrier_22| |v_~#x~0.base_154|) (< 0 |v_#StackHeapBarrier_22|) (= v_~__unbuffered_p1_EAX$read_delayed_var~0.base_45 0) (= |v_#length_34| (store (store |v_#length_35| |v_~#x~0.base_154| 4) |v_ULTIMATE.start_main_~#t1780~0.base_24| 4)) (= v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6 0) (= v_~__unbuffered_p1_EAX$w_buff1~0_6 0) (= v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$w_buff1_used~0_7 0) (= 0 v_~x$read_delayed_var~0.base_8) (= v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8 0) (= v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8 0) (= v_~x$w_buff0_used~0_1111 0) (= 0 v_~__unbuffered_p0_EAX~0_122) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_cnt~0_123 0) (= v_~__unbuffered_p1_EAX$flush_delayed~0_5 0) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t1780~0.base_24| 1)) (= v_~y~0_133 0) (= 0 v_~x$r_buff1_thd2~0_595) (= 0 v_~__unbuffered_p2_EAX~0_37) (= |v_ULTIMATE.start_main_~#t1780~0.offset_19| 0) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t1780~0.base_24|) (= (select (select |v_#memory_int_285| |v_~#x~0.base_154|) |v_~#x~0.offset_154|) 0)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_285|, #length=|v_#length_35|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_331, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_9|, ~__unbuffered_p1_EAX$r_buff0_thd0~0=v_~__unbuffered_p1_EAX$r_buff0_thd0~0_6, ~__unbuffered_p1_EAX$r_buff1_thd2~0=v_~__unbuffered_p1_EAX$r_buff1_thd2~0_8, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_239, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_137, ~weak$$choice1~0=v_~weak$$choice1~0_85, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_122, ULTIMATE.start_main_~#t1782~0.base=|v_ULTIMATE.start_main_~#t1782~0.base_21|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_65, ~__unbuffered_p1_EAX$w_buff0~0=v_~__unbuffered_p1_EAX$w_buff0~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.base=v_~__unbuffered_p1_EAX$read_delayed_var~0.base_45, #length=|v_#length_34|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_123, ~__unbuffered_p1_EAX$r_buff0_thd1~0=v_~__unbuffered_p1_EAX$r_buff0_thd1~0_4, ~#x~0.offset=|v_~#x~0.offset_154|, ~x$w_buff1~0=v_~x$w_buff1~0_258, ~__unbuffered_p1_EAX$r_buff1_thd3~0=v_~__unbuffered_p1_EAX$r_buff1_thd3~0_8, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_675, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_595, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_73|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_29|, ULTIMATE.start_main_#t~nondet83=|v_ULTIMATE.start_main_#t~nondet83_91|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_8, ~weak$$choice0~0=v_~weak$$choice0~0_164, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_105|, ~__unbuffered_p1_EAX$w_buff1_used~0=v_~__unbuffered_p1_EAX$w_buff1_used~0_7, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_71|, ~__unbuffered_p1_EAX$w_buff1~0=v_~__unbuffered_p1_EAX$w_buff1~0_6, ULTIMATE.start_main_~#t1780~0.base=|v_ULTIMATE.start_main_~#t1780~0.base_24|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ULTIMATE.start_main_~#t1780~0.offset=|v_ULTIMATE.start_main_~#t1780~0.offset_19|, ~__unbuffered_p1_EAX$r_buff0_thd2~0=v_~__unbuffered_p1_EAX$r_buff0_thd2~0_8, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_20|, ~__unbuffered_p1_EAX$r_buff1_thd0~0=v_~__unbuffered_p1_EAX$r_buff1_thd0~0_7, ~__unbuffered_p1_EAX$flush_delayed~0=v_~__unbuffered_p1_EAX$flush_delayed~0_5, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_292, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_10|, ULTIMATE.start_main_~#t1781~0.base=|v_ULTIMATE.start_main_~#t1781~0.base_22|, ~__unbuffered_p1_EAX$read_delayed~0=v_~__unbuffered_p1_EAX$read_delayed~0_56, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_256, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_47|, ~__unbuffered_p1_EAX$mem_tmp~0=v_~__unbuffered_p1_EAX$mem_tmp~0_6, ~y~0=v_~y~0_133, ~__unbuffered_p1_EAX$r_buff0_thd3~0=v_~__unbuffered_p1_EAX$r_buff0_thd3~0_8, ULTIMATE.start_main_#t~mem76=|v_ULTIMATE.start_main_#t~mem76_28|, ~__unbuffered_p1_EAX$r_buff1_thd1~0=v_~__unbuffered_p1_EAX$r_buff1_thd1~0_8, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=v_~__unbuffered_p1_EAX$read_delayed_var~0.offset_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_273, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_541, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_28|, ULTIMATE.start_main_~#t1782~0.offset=|v_ULTIMATE.start_main_~#t1782~0.offset_17|, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_1111, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_40|, ~__unbuffered_p1_EAX$w_buff0_used~0=v_~__unbuffered_p1_EAX$w_buff0_used~0_8, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_27|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_73|, #memory_int=|v_#memory_int_284|, ~#x~0.base=|v_~#x~0.base_154|, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_37|, ~weak$$choice2~0=v_~weak$$choice2~0_80, ULTIMATE.start_main_~#t1781~0.offset=|v_ULTIMATE.start_main_~#t1781~0.offset_17|, ~x$read_delayed~0=v_~x$read_delayed~0_8} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet74, ~__unbuffered_p1_EAX$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff1_thd2~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ~weak$$choice1~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1782~0.base, ~__unbuffered_p1_EAX~0, ~__unbuffered_p1_EAX$w_buff0~0, ~__unbuffered_p1_EAX$read_delayed_var~0.base, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EAX$r_buff0_thd1~0, ~#x~0.offset, ~x$w_buff1~0, ~__unbuffered_p1_EAX$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~nondet83, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~__unbuffered_p1_EAX$w_buff1_used~0, ULTIMATE.start_main_#t~ite80, ~__unbuffered_p1_EAX$w_buff1~0, ULTIMATE.start_main_~#t1780~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1780~0.offset, ~__unbuffered_p1_EAX$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet75, ~__unbuffered_p1_EAX$r_buff1_thd0~0, ~__unbuffered_p1_EAX$flush_delayed~0, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet73, ULTIMATE.start_main_~#t1781~0.base, ~__unbuffered_p1_EAX$read_delayed~0, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite86, ~__unbuffered_p1_EAX$mem_tmp~0, ~y~0, ~__unbuffered_p1_EAX$r_buff0_thd3~0, ULTIMATE.start_main_#t~mem76, ~__unbuffered_p1_EAX$r_buff1_thd1~0, ~__unbuffered_p1_EAX$read_delayed_var~0.offset, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite78, ULTIMATE.start_main_~#t1782~0.offset, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite85, ~__unbuffered_p1_EAX$w_buff0_used~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, #valid, #memory_int, ~#x~0.base, ULTIMATE.start_main_#t~mem84, ~weak$$choice2~0, ULTIMATE.start_main_~#t1781~0.offset, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 10:12:38,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1199] [1199] L840-1-->L842: Formula: (and (= (store |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1781~0.base_10| (store (select |v_#memory_int_155| |v_ULTIMATE.start_main_~#t1781~0.base_10|) |v_ULTIMATE.start_main_~#t1781~0.offset_9| 1)) |v_#memory_int_154|) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1781~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1781~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1781~0.base_10|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1781~0.base_10| 4) |v_#length_17|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1781~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t1781~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_155|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1781~0.base=|v_ULTIMATE.start_main_~#t1781~0.base_10|, ULTIMATE.start_main_#t~nondet73=|v_ULTIMATE.start_main_#t~nondet73_4|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_154|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1781~0.offset=|v_ULTIMATE.start_main_~#t1781~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1781~0.base, ULTIMATE.start_main_#t~nondet73, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1781~0.offset] because there is no mapped edge [2019-12-07 10:12:38,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1201] [1201] L842-1-->L844: Formula: (and (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t1782~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t1782~0.base_11| 0)) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t1782~0.base_11| 1) |v_#valid_41|) (= 0 |v_ULTIMATE.start_main_~#t1782~0.offset_9|) (= |v_#memory_int_156| (store |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1782~0.base_11| (store (select |v_#memory_int_157| |v_ULTIMATE.start_main_~#t1782~0.base_11|) |v_ULTIMATE.start_main_~#t1782~0.offset_9| 2))) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t1782~0.base_11| 4) |v_#length_19|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1782~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_157|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet74=|v_ULTIMATE.start_main_#t~nondet74_3|, ULTIMATE.start_main_~#t1782~0.base=|v_ULTIMATE.start_main_~#t1782~0.base_11|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_156|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1782~0.offset=|v_ULTIMATE.start_main_~#t1782~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet74, ULTIMATE.start_main_~#t1782~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1782~0.offset] because there is no mapped edge [2019-12-07 10:12:38,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L781-->L781-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1746058200 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-1746058200| |P1Thread1of1ForFork0_#t~ite28_Out-1746058200|) .cse0 (= (mod ~x$w_buff0_used~0_In-1746058200 256) 0) (= ~x$w_buff0~0_In-1746058200 |P1Thread1of1ForFork0_#t~ite28_Out-1746058200|)) (and (= |P1Thread1of1ForFork0_#t~ite28_In-1746058200| |P1Thread1of1ForFork0_#t~ite28_Out-1746058200|) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out-1746058200| ~x$w_buff0~0_In-1746058200)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1746058200, ~weak$$choice2~0=~weak$$choice2~0_In-1746058200, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_In-1746058200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1746058200, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1746058200|, ~weak$$choice2~0=~weak$$choice2~0_In-1746058200, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1746058200|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1746058200} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28, P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 10:12:38,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1095] [1095] L785-->L786: Formula: (and (= v_~x$r_buff0_thd2~0_109 v_~x$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P1Thread1of1ForFork0_#t~ite47=|v_P1Thread1of1ForFork0_#t~ite47_8|, P1Thread1of1ForFork0_#t~ite46=|v_P1Thread1of1ForFork0_#t~ite46_6|, P1Thread1of1ForFork0_#t~ite45=|v_P1Thread1of1ForFork0_#t~ite45_6|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_108, ~weak$$choice2~0=v_~weak$$choice2~0_23, P1Thread1of1ForFork0_#t~ite49=|v_P1Thread1of1ForFork0_#t~ite49_7|, P1Thread1of1ForFork0_#t~ite48=|v_P1Thread1of1ForFork0_#t~ite48_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite47, P1Thread1of1ForFork0_#t~ite46, P1Thread1of1ForFork0_#t~ite45, ~x$r_buff0_thd2~0, P1Thread1of1ForFork0_#t~ite49, P1Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 10:12:38,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L790-->L797: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= (store |v_#memory_int_40| |v_~#x~0.base_24| (store (select |v_#memory_int_40| |v_~#x~0.base_24|) |v_~#x~0.offset_24| v_~x$mem_tmp~0_4)) |v_#memory_int_39|) (= 1 v_~y~0_8) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~#x~0.offset=|v_~#x~0.offset_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_7, #memory_int=|v_#memory_int_40|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P1Thread1of1ForFork0_#t~mem57=|v_P1Thread1of1ForFork0_#t~mem57_3|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~#x~0.offset=|v_~#x~0.offset_24|, P1Thread1of1ForFork0_#t~ite58=|v_P1Thread1of1ForFork0_#t~ite58_5|, #memory_int=|v_#memory_int_39|, ~#x~0.base=|v_~#x~0.base_24|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~y~0=v_~y~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem57, ~x$flush_delayed~0, P1Thread1of1ForFork0_#t~ite58, #memory_int, ~y~0] because there is no mapped edge [2019-12-07 10:12:38,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1091] [1091] P0ENTRY-->L4-3: Formula: (and (= |v_P0Thread1of1ForFork2_#in~arg.offset_17| v_P0Thread1of1ForFork2_~arg.offset_15) (= v_~x$w_buff0~0_59 v_~x$w_buff1~0_46) (= 1 v_~x$w_buff0_used~0_228) (= 1 v_~x$w_buff0~0_58) (= v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17 |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|) (= v_~y~0_34 v_~__unbuffered_p0_EAX~0_20) (= |v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15| (ite (not (and (not (= 0 (mod v_~x$w_buff0_used~0_228 256))) (not (= (mod v_~x$w_buff1_used~0_124 256) 0)))) 1 0)) (= v_~x$w_buff0_used~0_229 v_~x$w_buff1_used~0_124) (not (= 0 v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17)) (= v_P0Thread1of1ForFork2_~arg.base_15 |v_P0Thread1of1ForFork2_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_59, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_34, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_229} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_20, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_17|, ~x$w_buff1~0=v_~x$w_buff1~0_46, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_15, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_124, P0Thread1of1ForFork2___VERIFIER_assert_~expression=v_P0Thread1of1ForFork2___VERIFIER_assert_~expression_17, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_17|, ~y~0=v_~y~0_34, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_15, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_228, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork2___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[~x$w_buff0~0, ~__unbuffered_p0_EAX~0, ~x$w_buff1~0, P0Thread1of1ForFork2_~arg.offset, ~x$w_buff1_used~0, P0Thread1of1ForFork2___VERIFIER_assert_~expression, P0Thread1of1ForFork2_~arg.base, ~x$w_buff0_used~0, P0Thread1of1ForFork2___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:12:38,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1174] [1174] L817-2-->L817-5: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-1556381940 256) 0)) (.cse0 (= |P2Thread1of1ForFork1_#t~ite68_Out-1556381940| |P2Thread1of1ForFork1_#t~ite67_Out-1556381940|)) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1556381940 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~mem66_Out-1556381940| |P2Thread1of1ForFork1_#t~ite67_Out-1556381940|) (or .cse1 .cse2) (= |P2Thread1of1ForFork1_#t~mem66_Out-1556381940| (select (select |#memory_int_In-1556381940| |~#x~0.base_In-1556381940|) |~#x~0.offset_In-1556381940|))) (and (not .cse2) .cse0 (= ~x$w_buff1~0_In-1556381940 |P2Thread1of1ForFork1_#t~ite67_Out-1556381940|) (not .cse1) (= |P2Thread1of1ForFork1_#t~mem66_In-1556381940| |P2Thread1of1ForFork1_#t~mem66_Out-1556381940|)))) InVars {~#x~0.offset=|~#x~0.offset_In-1556381940|, ~x$w_buff1~0=~x$w_buff1~0_In-1556381940, ~#x~0.base=|~#x~0.base_In-1556381940|, #memory_int=|#memory_int_In-1556381940|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556381940, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1556381940, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_In-1556381940|} OutVars{P2Thread1of1ForFork1_#t~ite68=|P2Thread1of1ForFork1_#t~ite68_Out-1556381940|, P2Thread1of1ForFork1_#t~ite67=|P2Thread1of1ForFork1_#t~ite67_Out-1556381940|, ~#x~0.offset=|~#x~0.offset_In-1556381940|, ~x$w_buff1~0=~x$w_buff1~0_In-1556381940, ~#x~0.base=|~#x~0.base_In-1556381940|, #memory_int=|#memory_int_In-1556381940|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1556381940, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1556381940, P2Thread1of1ForFork1_#t~mem66=|P2Thread1of1ForFork1_#t~mem66_Out-1556381940|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite68, P2Thread1of1ForFork1_#t~ite67, P2Thread1of1ForFork1_#t~mem66] because there is no mapped edge [2019-12-07 10:12:38,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1159] [1159] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In1334763965 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1334763965 256))) (.cse2 (= |P1Thread1of1ForFork0_#t~ite60_Out1334763965| |P1Thread1of1ForFork0_#t~ite61_Out1334763965|))) (or (and (not .cse0) (= ~x$w_buff1~0_In1334763965 |P1Thread1of1ForFork0_#t~ite60_Out1334763965|) (not .cse1) .cse2 (= |P1Thread1of1ForFork0_#t~mem59_In1334763965| |P1Thread1of1ForFork0_#t~mem59_Out1334763965|)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~mem59_Out1334763965| |P1Thread1of1ForFork0_#t~ite60_Out1334763965|) (= |P1Thread1of1ForFork0_#t~mem59_Out1334763965| (select (select |#memory_int_In1334763965| |~#x~0.base_In1334763965|) |~#x~0.offset_In1334763965|)) .cse2))) InVars {P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_In1334763965|, ~#x~0.offset=|~#x~0.offset_In1334763965|, ~x$w_buff1~0=~x$w_buff1~0_In1334763965, ~#x~0.base=|~#x~0.base_In1334763965|, #memory_int=|#memory_int_In1334763965|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1334763965, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1334763965} OutVars{P1Thread1of1ForFork0_#t~mem59=|P1Thread1of1ForFork0_#t~mem59_Out1334763965|, ~#x~0.offset=|~#x~0.offset_In1334763965|, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out1334763965|, P1Thread1of1ForFork0_#t~ite61=|P1Thread1of1ForFork0_#t~ite61_Out1334763965|, ~x$w_buff1~0=~x$w_buff1~0_In1334763965, ~#x~0.base=|~#x~0.base_In1334763965|, #memory_int=|#memory_int_In1334763965|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1334763965, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1334763965} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~mem59, P1Thread1of1ForFork0_#t~ite60, P1Thread1of1ForFork0_#t~ite61] because there is no mapped edge [2019-12-07 10:12:38,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1161] [1161] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-522715394 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-522715394 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite69_Out-522715394| ~x$w_buff0_used~0_In-522715394)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork1_#t~ite69_Out-522715394| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-522715394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-522715394} OutVars{P2Thread1of1ForFork1_#t~ite69=|P2Thread1of1ForFork1_#t~ite69_Out-522715394|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-522715394, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-522715394} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite69] because there is no mapped edge [2019-12-07 10:12:38,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L798-->L798-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1001497984 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd2~0_In-1001497984 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite62_Out-1001497984| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite62_Out-1001497984| ~x$w_buff0_used~0_In-1001497984)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} OutVars{P1Thread1of1ForFork0_#t~ite62=|P1Thread1of1ForFork0_#t~ite62_Out-1001497984|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1001497984, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1001497984} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite62] because there is no mapped edge [2019-12-07 10:12:38,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1164] [1164] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd3~0_In-2062646798 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-2062646798 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-2062646798 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2062646798 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-2062646798 |P2Thread1of1ForFork1_#t~ite70_Out-2062646798|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite70_Out-2062646798|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2062646798, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2062646798, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2062646798, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2062646798, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2062646798, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-2062646798, P2Thread1of1ForFork1_#t~ite70=|P2Thread1of1ForFork1_#t~ite70_Out-2062646798|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2062646798} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite70] because there is no mapped edge [2019-12-07 10:12:38,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1178] [1178] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-872936135 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-872936135 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite71_Out-872936135| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork1_#t~ite71_Out-872936135| ~x$r_buff0_thd3~0_In-872936135)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-872936135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} OutVars{P2Thread1of1ForFork1_#t~ite71=|P2Thread1of1ForFork1_#t~ite71_Out-872936135|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-872936135, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-872936135} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite71] because there is no mapped edge [2019-12-07 10:12:38,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1166] [1166] L821-->L821-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In1062026417 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1062026417 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1062026417 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1062026417 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite72_Out1062026417| ~x$r_buff1_thd3~0_In1062026417) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite72_Out1062026417| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1062026417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1062026417, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1062026417, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062026417} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1062026417, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1062026417, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1062026417, P2Thread1of1ForFork1_#t~ite72=|P2Thread1of1ForFork1_#t~ite72_Out1062026417|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1062026417} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite72] because there is no mapped edge [2019-12-07 10:12:38,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L821-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= v_~__unbuffered_cnt~0_75 (+ v_~__unbuffered_cnt~0_76 1)) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= |v_P2Thread1of1ForFork1_#t~ite72_48| v_~x$r_buff1_thd3~0_207)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_48|} OutVars{P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_207, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75, P2Thread1of1ForFork1_#t~ite72=|v_P2Thread1of1ForFork1_#t~ite72_47|, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#t~ite72, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 10:12:38,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1167] [1167] L799-->L799-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1766789498 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1766789498 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1766789498 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1766789498 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1766789498 |P1Thread1of1ForFork0_#t~ite63_Out1766789498|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite63_Out1766789498|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766789498, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766789498} OutVars{P1Thread1of1ForFork0_#t~ite63=|P1Thread1of1ForFork0_#t~ite63_Out1766789498|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1766789498, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1766789498, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1766789498, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1766789498} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite63] because there is no mapped edge [2019-12-07 10:12:38,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1165] [1165] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1581801045 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In1581801045 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite64_Out1581801045| 0)) (and (= ~x$r_buff0_thd2~0_In1581801045 |P1Thread1of1ForFork0_#t~ite64_Out1581801045|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1581801045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1581801045} OutVars{P1Thread1of1ForFork0_#t~ite64=|P1Thread1of1ForFork0_#t~ite64_Out1581801045|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1581801045, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1581801045} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite64] because there is no mapped edge [2019-12-07 10:12:38,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1160] [1160] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-701642706 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-701642706 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-701642706 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-701642706 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-701642706 |P1Thread1of1ForFork0_#t~ite65_Out-701642706|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork0_#t~ite65_Out-701642706|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-701642706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-701642706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-701642706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-701642706} OutVars{P1Thread1of1ForFork0_#t~ite65=|P1Thread1of1ForFork0_#t~ite65_Out-701642706|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-701642706, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-701642706, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-701642706, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-701642706} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65] because there is no mapped edge [2019-12-07 10:12:38,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1207] [1207] L801-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_311 |v_P1Thread1of1ForFork0_#t~ite65_30|) (= v_~__unbuffered_cnt~0_49 (+ v_~__unbuffered_cnt~0_50 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50} OutVars{P1Thread1of1ForFork0_#t~ite65=|v_P1Thread1of1ForFork0_#t~ite65_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_311, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite65, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 10:12:38,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L762-->L762-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1623938411 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1623938411 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite6_Out-1623938411| ~x$w_buff0_used~0_In-1623938411) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite6_Out-1623938411| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1623938411, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1623938411, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out-1623938411|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1623938411} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 10:12:38,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1169] [1169] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-412458802 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-412458802 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-412458802 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-412458802 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite7_Out-412458802| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork2_#t~ite7_Out-412458802| ~x$w_buff1_used~0_In-412458802) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-412458802, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-412458802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-412458802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-412458802} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-412458802, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out-412458802|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-412458802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-412458802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-412458802} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 10:12:38,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L764-->L765: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1717474642 256))) (.cse0 (= ~x$r_buff0_thd1~0_Out1717474642 ~x$r_buff0_thd1~0_In1717474642)) (.cse2 (= (mod ~x$w_buff0_used~0_In1717474642 256) 0))) (or (and .cse0 .cse1) (and (= 0 ~x$r_buff0_thd1~0_Out1717474642) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1717474642, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1717474642} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1717474642, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out1717474642|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1717474642} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 10:12:38,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1176] [1176] L765-->L765-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In629472419 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In629472419 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In629472419 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In629472419 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd1~0_In629472419 |P0Thread1of1ForFork2_#t~ite9_Out629472419|)) (and (= 0 |P0Thread1of1ForFork2_#t~ite9_Out629472419|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In629472419, ~x$w_buff1_used~0=~x$w_buff1_used~0_In629472419, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In629472419, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out629472419|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In629472419} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 10:12:38,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1225] [1225] L765-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= |v_P0Thread1of1ForFork2_#t~ite9_30| v_~x$r_buff1_thd1~0_182) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_30|} OutVars{P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_182, P0Thread1of1ForFork2_#t~ite9=|v_P0Thread1of1ForFork2_#t~ite9_29|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite9, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 10:12:38,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L848-->L850-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= (mod v_~x$w_buff0_used~0_415 256) 0) (= (mod v_~x$r_buff0_thd0~0_51 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_415} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:12:38,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1183] [1183] L850-2-->L850-5: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-187844000 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-187844000 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite78_Out-187844000| |ULTIMATE.start_main_#t~ite77_Out-187844000|))) (or (and (= |ULTIMATE.start_main_#t~mem76_Out-187844000| |ULTIMATE.start_main_#t~ite77_Out-187844000|) (= (select (select |#memory_int_In-187844000| |~#x~0.base_In-187844000|) |~#x~0.offset_In-187844000|) |ULTIMATE.start_main_#t~mem76_Out-187844000|) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In-187844000 |ULTIMATE.start_main_#t~ite77_Out-187844000|) (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~mem76_In-187844000| |ULTIMATE.start_main_#t~mem76_Out-187844000|) .cse2))) InVars {ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_In-187844000|, ~#x~0.offset=|~#x~0.offset_In-187844000|, ~x$w_buff1~0=~x$w_buff1~0_In-187844000, ~#x~0.base=|~#x~0.base_In-187844000|, #memory_int=|#memory_int_In-187844000|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-187844000, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-187844000} OutVars{ULTIMATE.start_main_#t~mem76=|ULTIMATE.start_main_#t~mem76_Out-187844000|, ~#x~0.offset=|~#x~0.offset_In-187844000|, ~x$w_buff1~0=~x$w_buff1~0_In-187844000, ~#x~0.base=|~#x~0.base_In-187844000|, #memory_int=|#memory_int_In-187844000|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-187844000, ULTIMATE.start_main_#t~ite77=|ULTIMATE.start_main_#t~ite77_Out-187844000|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-187844000, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-187844000|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem76, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 10:12:38,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1156] [1156] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In788741381 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In788741381 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite79_Out788741381|) (not .cse1)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In788741381 |ULTIMATE.start_main_#t~ite79_Out788741381|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788741381, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788741381} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In788741381, ULTIMATE.start_main_#t~ite79=|ULTIMATE.start_main_#t~ite79_Out788741381|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In788741381} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite79] because there is no mapped edge [2019-12-07 10:12:38,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1181] [1181] L852-->L852-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In610783480 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In610783480 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In610783480 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In610783480 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In610783480 |ULTIMATE.start_main_#t~ite80_Out610783480|)) (and (= 0 |ULTIMATE.start_main_#t~ite80_Out610783480|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In610783480, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In610783480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In610783480, ULTIMATE.start_main_#t~ite80=|ULTIMATE.start_main_#t~ite80_Out610783480|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In610783480, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In610783480, ~x$w_buff0_used~0=~x$w_buff0_used~0_In610783480} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite80] because there is no mapped edge [2019-12-07 10:12:38,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1170] [1170] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-965868511 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-965868511 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In-965868511 |ULTIMATE.start_main_#t~ite81_Out-965868511|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite81_Out-965868511|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-965868511, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-965868511, ULTIMATE.start_main_#t~ite81=|ULTIMATE.start_main_#t~ite81_Out-965868511|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-965868511} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite81] because there is no mapped edge [2019-12-07 10:12:38,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1155] [1155] L854-->L854-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In396963821 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In396963821 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In396963821 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In396963821 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite82_Out396963821| ~x$r_buff1_thd0~0_In396963821) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite82_Out396963821| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In396963821, ~x$w_buff1_used~0=~x$w_buff1_used~0_In396963821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In396963821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In396963821} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In396963821, ULTIMATE.start_main_#t~ite82=|ULTIMATE.start_main_#t~ite82_Out396963821|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In396963821, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In396963821, ~x$w_buff0_used~0=~x$w_buff0_used~0_In396963821} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite82] because there is no mapped edge [2019-12-07 10:12:38,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1154] [1154] L858-->L858-3: Formula: (let ((.cse1 (not (= (mod ~__unbuffered_p1_EAX$read_delayed~0_In-1774894562 256) 0))) (.cse0 (= 0 (mod ~weak$$choice1~0_In-1774894562 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~mem84_In-1774894562| |ULTIMATE.start_main_#t~mem84_Out-1774894562|) .cse1 (= ~__unbuffered_p1_EAX~0_In-1774894562 |ULTIMATE.start_main_#t~ite85_Out-1774894562|)) (and (= |ULTIMATE.start_main_#t~mem84_Out-1774894562| |ULTIMATE.start_main_#t~ite85_Out-1774894562|) .cse1 (not .cse0) (= (select (select |#memory_int_In-1774894562| ~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1774894562) ~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1774894562) |ULTIMATE.start_main_#t~mem84_Out-1774894562|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-1774894562, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1774894562, #memory_int=|#memory_int_In-1774894562|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1774894562, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_In-1774894562|} OutVars{ULTIMATE.start_main_#t~ite85=|ULTIMATE.start_main_#t~ite85_Out-1774894562|, ~weak$$choice1~0=~weak$$choice1~0_In-1774894562, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed~0=~__unbuffered_p1_EAX$read_delayed~0_In-1774894562, ~__unbuffered_p1_EAX$read_delayed_var~0.base=~__unbuffered_p1_EAX$read_delayed_var~0.base_In-1774894562, #memory_int=|#memory_int_In-1774894562|, ULTIMATE.start_main_#t~mem84=|ULTIMATE.start_main_#t~mem84_Out-1774894562|, ~__unbuffered_p1_EAX$read_delayed_var~0.offset=~__unbuffered_p1_EAX$read_delayed_var~0.offset_In-1774894562} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start_main_#t~mem84] because there is no mapped edge [2019-12-07 10:12:38,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L858-3-->L4: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_12 256)) (let ((.cse2 (= v_~main$tmp_guard1~0_12 1)) (.cse5 (= 1 v_~__unbuffered_p2_EAX~0_19)) (.cse3 (= 1 v_~__unbuffered_p1_EAX~0_33)) (.cse4 (= 2 v_~__unbuffered_p0_EAX~0_50)) (.cse0 (= v_~y~0_70 2)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite85_21| v_~__unbuffered_p1_EAX~0_33))) (or (and (not .cse0) .cse1 .cse2) (and (not .cse3) .cse1 .cse2) (and (not .cse4) .cse1 .cse2) (and .cse1 (not .cse5) .cse2) (and .cse5 .cse3 .cse4 .cse0 (= v_~main$tmp_guard1~0_12 0) .cse1)))) InVars {ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_21|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_70} OutVars{ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_50, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_33, ULTIMATE.start_main_#t~mem84=|v_ULTIMATE.start_main_#t~mem84_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ~y~0=v_~y~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite85, ULTIMATE.start___VERIFIER_assert_~expression, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~mem84, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite86] because there is no mapped edge [2019-12-07 10:12:38,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 10:12:38,342 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ed1ba1b6-2614-455a-8c5f-babdc4bc9d90/bin/uautomizer/witness.graphml [2019-12-07 10:12:38,342 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:12:38,343 INFO L168 Benchmark]: Toolchain (without parser) took 308946.94 ms. Allocated memory was 1.0 GB in the beginning and 11.3 GB in the end (delta: 10.2 GB). Free memory was 935.5 MB in the beginning and 5.3 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:12:38,344 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:12:38,344 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:12:38,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:12:38,345 INFO L168 Benchmark]: Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:12:38,345 INFO L168 Benchmark]: RCFGBuilder took 489.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. [2019-12-07 10:12:38,345 INFO L168 Benchmark]: TraceAbstraction took 307877.39 ms. Allocated memory was 1.1 GB in the beginning and 11.3 GB in the end (delta: 10.1 GB). Free memory was 987.3 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. [2019-12-07 10:12:38,346 INFO L168 Benchmark]: Witness Printer took 91.96 ms. Allocated memory is still 11.3 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:12:38,347 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 413.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 489.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 987.3 MB in the end (delta: 71.3 MB). Peak memory consumption was 71.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 307877.39 ms. Allocated memory was 1.1 GB in the beginning and 11.3 GB in the end (delta: 10.1 GB). Free memory was 987.3 MB in the beginning and 5.4 GB in the end (delta: -4.4 GB). Peak memory consumption was 5.8 GB. Max. memory is 11.5 GB. * Witness Printer took 91.96 ms. Allocated memory is still 11.3 GB. Free memory was 5.4 GB in the beginning and 5.3 GB in the end (delta: 39.1 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.8s, 235 ProgramPointsBefore, 118 ProgramPointsAfterwards, 293 TransitionsBefore, 145 TransitionsAfterwards, 31682 CoEnabledTransitionPairs, 8 FixpointIterations, 50 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 70 ConcurrentYvCompositions, 35 ChoiceCompositions, 11910 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 341 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 167703 CheckedPairsTotal, 175 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L842] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 x$flush_delayed = weak$$choice2 [L778] EXPR 2 \read(x) [L778] 2 x$mem_tmp = x [L779] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L780] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L780] EXPR 2 \read(x) [L780] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) VAL [!x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))))=0, \read(x)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L844] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L782] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L783] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L783] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L784] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L784] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L786] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))))=0, x={6:0}, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L787] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L788] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L789] EXPR 2 \read(x) [L789] 2 __unbuffered_p1_EAX = x [L811] 3 __unbuffered_p2_EAX = y [L814] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L817] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L817] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L818] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L754] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L755] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L756] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L757] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L758] 1 x$r_buff0_thd1 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L761] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L763] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={6:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice1=3, weak$$choice2=1, x={6:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L850] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L857] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 226 locations, 2 error locations. Result: UNSAFE, OverallTime: 307.6s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 71.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6298 SDtfs, 7901 SDslu, 11904 SDs, 0 SdLazy, 7945 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 45 SyntacticMatches, 24 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=460898occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 190.6s AutomataMinimizationTime, 29 MinimizatonAttempts, 830608 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1064 NumberOfCodeBlocks, 1064 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 965 ConstructedInterpolants, 0 QuantifiedInterpolants, 134224 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...