./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix035_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix035_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/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 e26bb2f8862e1d9a90c30fba0ca29a6f12858607 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 18:38:41,692 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:38:41,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:38:41,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:38:41,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:38:41,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:38:41,702 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:38:41,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:38:41,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:38:41,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:38:41,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:38:41,706 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:38:41,707 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:38:41,707 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:38:41,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:38:41,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:38:41,709 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:38:41,710 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:38:41,711 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:38:41,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:38:41,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:38:41,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:38:41,715 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:38:41,716 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:38:41,717 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:38:41,718 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:38:41,718 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:38:41,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:38:41,718 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:38:41,719 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:38:41,719 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:38:41,720 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:38:41,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:38:41,720 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:38:41,721 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:38:41,721 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:38:41,722 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:38:41,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:38:41,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:38:41,722 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:38:41,723 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:38:41,723 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:38:41,732 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:38:41,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:38:41,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:38:41,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:38:41,733 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:38:41,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:38:41,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:38:41,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:38:41,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:38:41,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:38:41,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:38:41,735 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:38:41,735 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:38:41,735 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:38:41,735 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:38:41,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:38:41,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:38:41,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:38:41,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:38:41,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:38:41,736 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:38:41,736 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_4101a352-4c82-4445-9cfd-4d91ce11cf93/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 -> e26bb2f8862e1d9a90c30fba0ca29a6f12858607 [2019-12-07 18:38:41,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:38:41,844 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:38:41,847 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:38:41,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:38:41,849 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:38:41,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix035_pso.oepc.i [2019-12-07 18:38:41,891 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/data/53c70c232/8337d96d033e41318d9df822be898091/FLAGb41842157 [2019-12-07 18:38:42,250 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:38:42,250 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/sv-benchmarks/c/pthread-wmm/mix035_pso.oepc.i [2019-12-07 18:38:42,261 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/data/53c70c232/8337d96d033e41318d9df822be898091/FLAGb41842157 [2019-12-07 18:38:42,649 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/data/53c70c232/8337d96d033e41318d9df822be898091 [2019-12-07 18:38:42,650 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:38:42,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:38:42,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:38:42,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:38:42,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:38:42,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:38:42" (1/1) ... [2019-12-07 18:38:42,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14b30403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:42, skipping insertion in model container [2019-12-07 18:38:42,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:38:42" (1/1) ... [2019-12-07 18:38:42,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:38:42,691 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:38:42,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:38:42,957 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:38:43,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:38:43,050 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:38:43,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43 WrapperNode [2019-12-07 18:38:43,051 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:38:43,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:38:43,052 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:38:43,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:38:43,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,092 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:38:43,093 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:38:43,093 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:38:43,093 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:38:43,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... [2019-12-07 18:38:43,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:38:43,120 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:38:43,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:38:43,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:38:43,121 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/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 18:38:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:38:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:38:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:38:43,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:38:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:38:43,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:38:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:38:43,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:38:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:38:43,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:38:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:38:43,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:38:43,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:38:43,167 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 18:38:43,538 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:38:43,538 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:38:43,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:38:43 BoogieIcfgContainer [2019-12-07 18:38:43,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:38:43,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:38:43,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:38:43,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:38:43,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:38:42" (1/3) ... [2019-12-07 18:38:43,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fbcc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:38:43, skipping insertion in model container [2019-12-07 18:38:43,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:38:43" (2/3) ... [2019-12-07 18:38:43,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78fbcc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:38:43, skipping insertion in model container [2019-12-07 18:38:43,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:38:43" (3/3) ... [2019-12-07 18:38:43,543 INFO L109 eAbstractionObserver]: Analyzing ICFG mix035_pso.oepc.i [2019-12-07 18:38:43,550 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:38:43,550 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:38:43,555 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:38:43,555 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:38:43,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,581 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,581 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,582 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,582 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,582 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,583 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,584 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,585 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,586 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,586 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,587 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,587 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,588 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,589 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,594 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,595 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,596 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,597 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,598 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,599 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,600 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,601 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,602 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,603 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,604 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,605 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,606 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,607 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:38:43,618 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:38:43,631 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:38:43,631 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:38:43,631 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:38:43,631 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:38:43,631 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:38:43,631 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:38:43,631 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:38:43,631 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:38:43,645 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 215 transitions [2019-12-07 18:38:43,646 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 18:38:43,712 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 18:38:43,713 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:38:43,723 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 707 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 18:38:43,738 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 215 transitions [2019-12-07 18:38:43,780 INFO L134 PetriNetUnfolder]: 47/212 cut-off events. [2019-12-07 18:38:43,780 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:38:43,786 INFO L76 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 212 events. 47/212 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 707 event pairs. 9/172 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 18:38:43,803 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 18:38:43,804 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:38:46,759 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-07 18:38:46,973 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 18:38:47,015 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83880 [2019-12-07 18:38:47,016 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 18:38:47,018 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-07 18:39:02,560 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 118052 states. [2019-12-07 18:39:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 118052 states. [2019-12-07 18:39:02,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 18:39:02,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:39:02,565 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 18:39:02,566 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 18:39:02,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:39:02,569 INFO L82 PathProgramCache]: Analyzing trace with hash 918883, now seen corresponding path program 1 times [2019-12-07 18:39:02,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:39:02,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182723125] [2019-12-07 18:39:02,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:39:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:39:02,712 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 18:39:02,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182723125] [2019-12-07 18:39:02,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:39:02,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:39:02,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969284794] [2019-12-07 18:39:02,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:39:02,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:39:02,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:39:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:39:02,727 INFO L87 Difference]: Start difference. First operand 118052 states. Second operand 3 states. [2019-12-07 18:39:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:39:03,451 INFO L93 Difference]: Finished difference Result 117122 states and 502402 transitions. [2019-12-07 18:39:03,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:39:03,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 18:39:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:39:03,937 INFO L225 Difference]: With dead ends: 117122 [2019-12-07 18:39:03,937 INFO L226 Difference]: Without dead ends: 109842 [2019-12-07 18:39:03,938 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 18:39:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109842 states. [2019-12-07 18:39:10,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109842 to 109842. [2019-12-07 18:39:10,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109842 states. [2019-12-07 18:39:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109842 states to 109842 states and 470538 transitions. [2019-12-07 18:39:11,266 INFO L78 Accepts]: Start accepts. Automaton has 109842 states and 470538 transitions. Word has length 3 [2019-12-07 18:39:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:39:11,266 INFO L462 AbstractCegarLoop]: Abstraction has 109842 states and 470538 transitions. [2019-12-07 18:39:11,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:39:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 109842 states and 470538 transitions. [2019-12-07 18:39:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 18:39:11,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:39:11,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:39:11,271 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 18:39:11,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:39:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1326055600, now seen corresponding path program 1 times [2019-12-07 18:39:11,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:39:11,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071903728] [2019-12-07 18:39:11,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:39:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:39:11,347 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 18:39:11,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071903728] [2019-12-07 18:39:11,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:39:11,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:39:11,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531237990] [2019-12-07 18:39:11,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:39:11,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:39:11,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:39:11,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:39:11,349 INFO L87 Difference]: Start difference. First operand 109842 states and 470538 transitions. Second operand 4 states. [2019-12-07 18:39:12,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:39:12,590 INFO L93 Difference]: Finished difference Result 170700 states and 702967 transitions. [2019-12-07 18:39:12,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:39:12,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 18:39:12,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:39:13,038 INFO L225 Difference]: With dead ends: 170700 [2019-12-07 18:39:13,038 INFO L226 Difference]: Without dead ends: 170651 [2019-12-07 18:39:13,039 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 18:39:18,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170651 states. [2019-12-07 18:39:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170651 to 155174. [2019-12-07 18:39:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155174 states. [2019-12-07 18:39:22,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155174 states to 155174 states and 647977 transitions. [2019-12-07 18:39:22,939 INFO L78 Accepts]: Start accepts. Automaton has 155174 states and 647977 transitions. Word has length 11 [2019-12-07 18:39:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:39:22,939 INFO L462 AbstractCegarLoop]: Abstraction has 155174 states and 647977 transitions. [2019-12-07 18:39:22,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:39:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 155174 states and 647977 transitions. [2019-12-07 18:39:22,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:39:22,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:39:22,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:39:22,944 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 18:39:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:39:22,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1447855061, now seen corresponding path program 1 times [2019-12-07 18:39:22,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:39:22,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638621108] [2019-12-07 18:39:22,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:39:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:39:23,001 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 18:39:23,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638621108] [2019-12-07 18:39:23,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:39:23,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:39:23,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96377876] [2019-12-07 18:39:23,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:39:23,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:39:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:39:23,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:39:23,002 INFO L87 Difference]: Start difference. First operand 155174 states and 647977 transitions. Second operand 4 states. [2019-12-07 18:39:24,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:39:24,430 INFO L93 Difference]: Finished difference Result 224055 states and 913655 transitions. [2019-12-07 18:39:24,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:39:24,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:39:24,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:39:25,055 INFO L225 Difference]: With dead ends: 224055 [2019-12-07 18:39:25,055 INFO L226 Difference]: Without dead ends: 223999 [2019-12-07 18:39:25,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:39:31,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223999 states. [2019-12-07 18:39:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223999 to 186994. [2019-12-07 18:39:36,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186994 states. [2019-12-07 18:39:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186994 states to 186994 states and 776530 transitions. [2019-12-07 18:39:37,159 INFO L78 Accepts]: Start accepts. Automaton has 186994 states and 776530 transitions. Word has length 13 [2019-12-07 18:39:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:39:37,159 INFO L462 AbstractCegarLoop]: Abstraction has 186994 states and 776530 transitions. [2019-12-07 18:39:37,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:39:37,160 INFO L276 IsEmpty]: Start isEmpty. Operand 186994 states and 776530 transitions. [2019-12-07 18:39:37,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:39:37,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:39:37,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:39:37,168 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 18:39:37,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:39:37,168 INFO L82 PathProgramCache]: Analyzing trace with hash 627665056, now seen corresponding path program 1 times [2019-12-07 18:39:37,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:39:37,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295171808] [2019-12-07 18:39:37,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:39:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:39:37,202 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 18:39:37,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295171808] [2019-12-07 18:39:37,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:39:37,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:39:37,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139438155] [2019-12-07 18:39:37,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:39:37,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:39:37,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:39:37,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:39:37,204 INFO L87 Difference]: Start difference. First operand 186994 states and 776530 transitions. Second operand 3 states. [2019-12-07 18:39:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:39:38,776 INFO L93 Difference]: Finished difference Result 280132 states and 1157620 transitions. [2019-12-07 18:39:38,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:39:38,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:39:38,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:39:39,509 INFO L225 Difference]: With dead ends: 280132 [2019-12-07 18:39:39,509 INFO L226 Difference]: Without dead ends: 280132 [2019-12-07 18:39:39,509 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 18:39:46,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280132 states. [2019-12-07 18:39:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280132 to 219156. [2019-12-07 18:39:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219156 states. [2019-12-07 18:39:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219156 states to 219156 states and 912840 transitions. [2019-12-07 18:39:50,674 INFO L78 Accepts]: Start accepts. Automaton has 219156 states and 912840 transitions. Word has length 16 [2019-12-07 18:39:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:39:50,675 INFO L462 AbstractCegarLoop]: Abstraction has 219156 states and 912840 transitions. [2019-12-07 18:39:50,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:39:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 219156 states and 912840 transitions. [2019-12-07 18:39:50,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:39:50,683 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:39:50,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:39:50,683 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 18:39:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:39:50,684 INFO L82 PathProgramCache]: Analyzing trace with hash 712450242, now seen corresponding path program 1 times [2019-12-07 18:39:50,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:39:50,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901165617] [2019-12-07 18:39:50,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:39:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:39:50,737 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 18:39:50,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901165617] [2019-12-07 18:39:50,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:39:50,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:39:50,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763868980] [2019-12-07 18:39:50,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:39:50,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:39:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:39:50,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:39:50,739 INFO L87 Difference]: Start difference. First operand 219156 states and 912840 transitions. Second operand 4 states. [2019-12-07 18:39:52,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:39:52,024 INFO L93 Difference]: Finished difference Result 260201 states and 1070965 transitions. [2019-12-07 18:39:52,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:39:52,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:39:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:39:55,756 INFO L225 Difference]: With dead ends: 260201 [2019-12-07 18:39:55,757 INFO L226 Difference]: Without dead ends: 260201 [2019-12-07 18:39:55,757 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 18:40:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260201 states. [2019-12-07 18:40:05,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260201 to 231090. [2019-12-07 18:40:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231090 states. [2019-12-07 18:40:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231090 states to 231090 states and 960623 transitions. [2019-12-07 18:40:06,605 INFO L78 Accepts]: Start accepts. Automaton has 231090 states and 960623 transitions. Word has length 16 [2019-12-07 18:40:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:06,606 INFO L462 AbstractCegarLoop]: Abstraction has 231090 states and 960623 transitions. [2019-12-07 18:40:06,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:40:06,606 INFO L276 IsEmpty]: Start isEmpty. Operand 231090 states and 960623 transitions. [2019-12-07 18:40:06,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:40:06,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:06,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:40:06,612 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 18:40:06,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:06,612 INFO L82 PathProgramCache]: Analyzing trace with hash 646000998, now seen corresponding path program 1 times [2019-12-07 18:40:06,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:06,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256531655] [2019-12-07 18:40:06,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:06,650 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 18:40:06,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256531655] [2019-12-07 18:40:06,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:06,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:40:06,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978834714] [2019-12-07 18:40:06,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:40:06,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:40:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:40:06,652 INFO L87 Difference]: Start difference. First operand 231090 states and 960623 transitions. Second operand 4 states. [2019-12-07 18:40:08,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:08,436 INFO L93 Difference]: Finished difference Result 274316 states and 1132270 transitions. [2019-12-07 18:40:08,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:40:08,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 18:40:08,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:09,155 INFO L225 Difference]: With dead ends: 274316 [2019-12-07 18:40:09,155 INFO L226 Difference]: Without dead ends: 274316 [2019-12-07 18:40:09,155 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 18:40:19,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274316 states. [2019-12-07 18:40:22,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274316 to 234317. [2019-12-07 18:40:22,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234317 states. [2019-12-07 18:40:23,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234317 states to 234317 states and 974891 transitions. [2019-12-07 18:40:23,690 INFO L78 Accepts]: Start accepts. Automaton has 234317 states and 974891 transitions. Word has length 16 [2019-12-07 18:40:23,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:23,690 INFO L462 AbstractCegarLoop]: Abstraction has 234317 states and 974891 transitions. [2019-12-07 18:40:23,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:40:23,690 INFO L276 IsEmpty]: Start isEmpty. Operand 234317 states and 974891 transitions. [2019-12-07 18:40:23,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:40:23,702 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:23,702 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:40:23,702 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 18:40:23,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:23,702 INFO L82 PathProgramCache]: Analyzing trace with hash 910996381, now seen corresponding path program 1 times [2019-12-07 18:40:23,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:23,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977599585] [2019-12-07 18:40:23,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:23,747 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 18:40:23,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977599585] [2019-12-07 18:40:23,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:23,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:40:23,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693070744] [2019-12-07 18:40:23,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:40:23,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:23,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:40:23,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:40:23,748 INFO L87 Difference]: Start difference. First operand 234317 states and 974891 transitions. Second operand 3 states. [2019-12-07 18:40:24,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:24,797 INFO L93 Difference]: Finished difference Result 234317 states and 965027 transitions. [2019-12-07 18:40:24,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:40:24,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:40:24,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:25,438 INFO L225 Difference]: With dead ends: 234317 [2019-12-07 18:40:25,438 INFO L226 Difference]: Without dead ends: 234317 [2019-12-07 18:40:25,438 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 18:40:32,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234317 states. [2019-12-07 18:40:35,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234317 to 230795. [2019-12-07 18:40:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230795 states. [2019-12-07 18:40:36,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230795 states to 230795 states and 951941 transitions. [2019-12-07 18:40:36,493 INFO L78 Accepts]: Start accepts. Automaton has 230795 states and 951941 transitions. Word has length 18 [2019-12-07 18:40:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:36,493 INFO L462 AbstractCegarLoop]: Abstraction has 230795 states and 951941 transitions. [2019-12-07 18:40:36,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:40:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 230795 states and 951941 transitions. [2019-12-07 18:40:36,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:40:36,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:36,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:40:36,504 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 18:40:36,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:36,504 INFO L82 PathProgramCache]: Analyzing trace with hash 704033498, now seen corresponding path program 1 times [2019-12-07 18:40:36,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:36,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692239726] [2019-12-07 18:40:36,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:36,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:36,559 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 18:40:36,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692239726] [2019-12-07 18:40:36,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:36,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:40:36,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624588474] [2019-12-07 18:40:36,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:40:36,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:36,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:40:36,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:40:36,561 INFO L87 Difference]: Start difference. First operand 230795 states and 951941 transitions. Second operand 3 states. [2019-12-07 18:40:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:37,564 INFO L93 Difference]: Finished difference Result 232502 states and 956244 transitions. [2019-12-07 18:40:37,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:40:37,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 18:40:37,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:41,143 INFO L225 Difference]: With dead ends: 232502 [2019-12-07 18:40:41,144 INFO L226 Difference]: Without dead ends: 232502 [2019-12-07 18:40:41,144 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 18:40:47,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232502 states. [2019-12-07 18:40:50,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232502 to 230792. [2019-12-07 18:40:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230792 states. [2019-12-07 18:40:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230792 states to 230792 states and 951929 transitions. [2019-12-07 18:40:51,255 INFO L78 Accepts]: Start accepts. Automaton has 230792 states and 951929 transitions. Word has length 18 [2019-12-07 18:40:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:40:51,255 INFO L462 AbstractCegarLoop]: Abstraction has 230792 states and 951929 transitions. [2019-12-07 18:40:51,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:40:51,255 INFO L276 IsEmpty]: Start isEmpty. Operand 230792 states and 951929 transitions. [2019-12-07 18:40:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:40:51,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:40:51,270 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 18:40:51,270 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 18:40:51,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:40:51,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1866087035, now seen corresponding path program 1 times [2019-12-07 18:40:51,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:40:51,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132541776] [2019-12-07 18:40:51,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:40:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:40:51,328 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 18:40:51,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132541776] [2019-12-07 18:40:51,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:40:51,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:40:51,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893343554] [2019-12-07 18:40:51,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:40:51,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:40:51,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:40:51,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:40:51,330 INFO L87 Difference]: Start difference. First operand 230792 states and 951929 transitions. Second operand 5 states. [2019-12-07 18:40:53,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:40:53,645 INFO L93 Difference]: Finished difference Result 335067 states and 1351207 transitions. [2019-12-07 18:40:53,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:40:53,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 18:40:53,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:40:54,472 INFO L225 Difference]: With dead ends: 335067 [2019-12-07 18:40:54,472 INFO L226 Difference]: Without dead ends: 334969 [2019-12-07 18:40:54,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:41:02,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334969 states. [2019-12-07 18:41:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334969 to 247715. [2019-12-07 18:41:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247715 states. [2019-12-07 18:41:07,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247715 states to 247715 states and 1018384 transitions. [2019-12-07 18:41:07,416 INFO L78 Accepts]: Start accepts. Automaton has 247715 states and 1018384 transitions. Word has length 19 [2019-12-07 18:41:07,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:07,416 INFO L462 AbstractCegarLoop]: Abstraction has 247715 states and 1018384 transitions. [2019-12-07 18:41:07,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:07,417 INFO L276 IsEmpty]: Start isEmpty. Operand 247715 states and 1018384 transitions. [2019-12-07 18:41:07,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:41:07,431 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:07,431 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 18:41:07,431 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 18:41:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:07,432 INFO L82 PathProgramCache]: Analyzing trace with hash 206653430, now seen corresponding path program 1 times [2019-12-07 18:41:07,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:07,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517669478] [2019-12-07 18:41:07,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:07,451 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 18:41:07,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517669478] [2019-12-07 18:41:07,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:07,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:07,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890690982] [2019-12-07 18:41:07,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:07,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:07,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:07,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:07,452 INFO L87 Difference]: Start difference. First operand 247715 states and 1018384 transitions. Second operand 3 states. [2019-12-07 18:41:07,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:07,606 INFO L93 Difference]: Finished difference Result 48165 states and 155941 transitions. [2019-12-07 18:41:07,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:07,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:41:07,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:07,678 INFO L225 Difference]: With dead ends: 48165 [2019-12-07 18:41:07,678 INFO L226 Difference]: Without dead ends: 48165 [2019-12-07 18:41:07,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:07,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48165 states. [2019-12-07 18:41:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48165 to 48165. [2019-12-07 18:41:08,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48165 states. [2019-12-07 18:41:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48165 states to 48165 states and 155941 transitions. [2019-12-07 18:41:08,493 INFO L78 Accepts]: Start accepts. Automaton has 48165 states and 155941 transitions. Word has length 19 [2019-12-07 18:41:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:08,493 INFO L462 AbstractCegarLoop]: Abstraction has 48165 states and 155941 transitions. [2019-12-07 18:41:08,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 48165 states and 155941 transitions. [2019-12-07 18:41:08,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:41:08,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:08,500 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 18:41:08,500 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 18:41:08,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:08,500 INFO L82 PathProgramCache]: Analyzing trace with hash -2051800974, now seen corresponding path program 1 times [2019-12-07 18:41:08,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:08,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933180886] [2019-12-07 18:41:08,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:08,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:08,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933180886] [2019-12-07 18:41:08,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:08,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:08,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589084392] [2019-12-07 18:41:08,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:08,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:08,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:08,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:08,547 INFO L87 Difference]: Start difference. First operand 48165 states and 155941 transitions. Second operand 5 states. [2019-12-07 18:41:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:09,392 INFO L93 Difference]: Finished difference Result 64508 states and 204217 transitions. [2019-12-07 18:41:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:41:09,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:41:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:09,486 INFO L225 Difference]: With dead ends: 64508 [2019-12-07 18:41:09,486 INFO L226 Difference]: Without dead ends: 64501 [2019-12-07 18:41:09,486 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 18:41:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64501 states. [2019-12-07 18:41:10,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64501 to 50989. [2019-12-07 18:41:10,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50989 states. [2019-12-07 18:41:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50989 states to 50989 states and 164544 transitions. [2019-12-07 18:41:10,475 INFO L78 Accepts]: Start accepts. Automaton has 50989 states and 164544 transitions. Word has length 22 [2019-12-07 18:41:10,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:10,476 INFO L462 AbstractCegarLoop]: Abstraction has 50989 states and 164544 transitions. [2019-12-07 18:41:10,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 50989 states and 164544 transitions. [2019-12-07 18:41:10,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:41:10,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:10,483 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 18:41:10,483 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 18:41:10,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:10,483 INFO L82 PathProgramCache]: Analyzing trace with hash -2118250218, now seen corresponding path program 1 times [2019-12-07 18:41:10,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:10,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097620796] [2019-12-07 18:41:10,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:10,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 18:41:10,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097620796] [2019-12-07 18:41:10,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:10,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:10,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282488210] [2019-12-07 18:41:10,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:10,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:10,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:10,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:10,539 INFO L87 Difference]: Start difference. First operand 50989 states and 164544 transitions. Second operand 5 states. [2019-12-07 18:41:10,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:10,994 INFO L93 Difference]: Finished difference Result 66393 states and 210775 transitions. [2019-12-07 18:41:10,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:41:10,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 18:41:10,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:11,093 INFO L225 Difference]: With dead ends: 66393 [2019-12-07 18:41:11,093 INFO L226 Difference]: Without dead ends: 66386 [2019-12-07 18:41:11,093 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 18:41:11,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66386 states. [2019-12-07 18:41:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66386 to 49514. [2019-12-07 18:41:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49514 states. [2019-12-07 18:41:12,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49514 states to 49514 states and 160027 transitions. [2019-12-07 18:41:12,486 INFO L78 Accepts]: Start accepts. Automaton has 49514 states and 160027 transitions. Word has length 22 [2019-12-07 18:41:12,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:12,486 INFO L462 AbstractCegarLoop]: Abstraction has 49514 states and 160027 transitions. [2019-12-07 18:41:12,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:12,486 INFO L276 IsEmpty]: Start isEmpty. Operand 49514 states and 160027 transitions. [2019-12-07 18:41:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:41:12,502 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:12,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:12,503 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 18:41:12,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:12,503 INFO L82 PathProgramCache]: Analyzing trace with hash -735951720, now seen corresponding path program 1 times [2019-12-07 18:41:12,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:12,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740953259] [2019-12-07 18:41:12,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:12,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 18:41:12,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740953259] [2019-12-07 18:41:12,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:12,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:12,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503014278] [2019-12-07 18:41:12,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:12,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:12,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:12,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:12,529 INFO L87 Difference]: Start difference. First operand 49514 states and 160027 transitions. Second operand 3 states. [2019-12-07 18:41:12,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:12,716 INFO L93 Difference]: Finished difference Result 63939 states and 198208 transitions. [2019-12-07 18:41:12,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:12,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:41:12,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:12,805 INFO L225 Difference]: With dead ends: 63939 [2019-12-07 18:41:12,806 INFO L226 Difference]: Without dead ends: 63939 [2019-12-07 18:41:12,806 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 18:41:13,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63939 states. [2019-12-07 18:41:13,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63939 to 49038. [2019-12-07 18:41:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49038 states. [2019-12-07 18:41:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49038 states to 49038 states and 151959 transitions. [2019-12-07 18:41:13,738 INFO L78 Accepts]: Start accepts. Automaton has 49038 states and 151959 transitions. Word has length 27 [2019-12-07 18:41:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:13,738 INFO L462 AbstractCegarLoop]: Abstraction has 49038 states and 151959 transitions. [2019-12-07 18:41:13,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 49038 states and 151959 transitions. [2019-12-07 18:41:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:41:13,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:13,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:13,753 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 18:41:13,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:13,753 INFO L82 PathProgramCache]: Analyzing trace with hash -963527987, now seen corresponding path program 1 times [2019-12-07 18:41:13,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:13,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838622160] [2019-12-07 18:41:13,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:13,805 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 18:41:13,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838622160] [2019-12-07 18:41:13,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:13,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:13,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016908263] [2019-12-07 18:41:13,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:13,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:13,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:13,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:13,807 INFO L87 Difference]: Start difference. First operand 49038 states and 151959 transitions. Second operand 5 states. [2019-12-07 18:41:14,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:14,211 INFO L93 Difference]: Finished difference Result 60471 states and 185646 transitions. [2019-12-07 18:41:14,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:41:14,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 18:41:14,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:14,297 INFO L225 Difference]: With dead ends: 60471 [2019-12-07 18:41:14,297 INFO L226 Difference]: Without dead ends: 60450 [2019-12-07 18:41:14,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:41:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60450 states. [2019-12-07 18:41:15,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60450 to 51228. [2019-12-07 18:41:15,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51228 states. [2019-12-07 18:41:16,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51228 states to 51228 states and 158640 transitions. [2019-12-07 18:41:16,019 INFO L78 Accepts]: Start accepts. Automaton has 51228 states and 158640 transitions. Word has length 27 [2019-12-07 18:41:16,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:16,019 INFO L462 AbstractCegarLoop]: Abstraction has 51228 states and 158640 transitions. [2019-12-07 18:41:16,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:16,019 INFO L276 IsEmpty]: Start isEmpty. Operand 51228 states and 158640 transitions. [2019-12-07 18:41:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:41:16,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:16,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:16,033 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 18:41:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:16,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1072867226, now seen corresponding path program 1 times [2019-12-07 18:41:16,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:16,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861843896] [2019-12-07 18:41:16,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:16,090 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 18:41:16,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861843896] [2019-12-07 18:41:16,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:16,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:41:16,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956330943] [2019-12-07 18:41:16,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:16,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:16,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:16,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:16,091 INFO L87 Difference]: Start difference. First operand 51228 states and 158640 transitions. Second operand 5 states. [2019-12-07 18:41:16,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:16,259 INFO L93 Difference]: Finished difference Result 52489 states and 162316 transitions. [2019-12-07 18:41:16,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:41:16,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 18:41:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:16,336 INFO L225 Difference]: With dead ends: 52489 [2019-12-07 18:41:16,336 INFO L226 Difference]: Without dead ends: 52489 [2019-12-07 18:41:16,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:16,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52489 states. [2019-12-07 18:41:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52489 to 52489. [2019-12-07 18:41:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52489 states. [2019-12-07 18:41:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52489 states to 52489 states and 162316 transitions. [2019-12-07 18:41:17,228 INFO L78 Accepts]: Start accepts. Automaton has 52489 states and 162316 transitions. Word has length 28 [2019-12-07 18:41:17,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:17,228 INFO L462 AbstractCegarLoop]: Abstraction has 52489 states and 162316 transitions. [2019-12-07 18:41:17,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 52489 states and 162316 transitions. [2019-12-07 18:41:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:41:17,242 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:17,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:17,242 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 18:41:17,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1702632904, now seen corresponding path program 1 times [2019-12-07 18:41:17,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:17,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034919367] [2019-12-07 18:41:17,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:17,300 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 18:41:17,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034919367] [2019-12-07 18:41:17,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:17,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:17,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111788629] [2019-12-07 18:41:17,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:17,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:17,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:17,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:17,302 INFO L87 Difference]: Start difference. First operand 52489 states and 162316 transitions. Second operand 4 states. [2019-12-07 18:41:17,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:17,461 INFO L93 Difference]: Finished difference Result 52538 states and 162309 transitions. [2019-12-07 18:41:17,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:17,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 18:41:17,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:17,537 INFO L225 Difference]: With dead ends: 52538 [2019-12-07 18:41:17,537 INFO L226 Difference]: Without dead ends: 52538 [2019-12-07 18:41:17,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52538 states. [2019-12-07 18:41:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52538 to 52435. [2019-12-07 18:41:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52435 states. [2019-12-07 18:41:18,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52435 states to 52435 states and 162155 transitions. [2019-12-07 18:41:18,514 INFO L78 Accepts]: Start accepts. Automaton has 52435 states and 162155 transitions. Word has length 29 [2019-12-07 18:41:18,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:18,514 INFO L462 AbstractCegarLoop]: Abstraction has 52435 states and 162155 transitions. [2019-12-07 18:41:18,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:18,514 INFO L276 IsEmpty]: Start isEmpty. Operand 52435 states and 162155 transitions. [2019-12-07 18:41:18,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:41:18,529 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:18,530 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:18,530 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 18:41:18,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:18,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1714199023, now seen corresponding path program 1 times [2019-12-07 18:41:18,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:18,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646086807] [2019-12-07 18:41:18,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:18,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:41:18,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646086807] [2019-12-07 18:41:18,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:18,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:18,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062592617] [2019-12-07 18:41:18,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:18,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:18,579 INFO L87 Difference]: Start difference. First operand 52435 states and 162155 transitions. Second operand 5 states. [2019-12-07 18:41:18,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:18,924 INFO L93 Difference]: Finished difference Result 63386 states and 193751 transitions. [2019-12-07 18:41:18,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:41:18,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 18:41:18,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:19,012 INFO L225 Difference]: With dead ends: 63386 [2019-12-07 18:41:19,013 INFO L226 Difference]: Without dead ends: 63364 [2019-12-07 18:41:19,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:41:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63364 states. [2019-12-07 18:41:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63364 to 52335. [2019-12-07 18:41:19,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52335 states. [2019-12-07 18:41:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52335 states to 52335 states and 161814 transitions. [2019-12-07 18:41:19,968 INFO L78 Accepts]: Start accepts. Automaton has 52335 states and 161814 transitions. Word has length 29 [2019-12-07 18:41:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:19,968 INFO L462 AbstractCegarLoop]: Abstraction has 52335 states and 161814 transitions. [2019-12-07 18:41:19,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 52335 states and 161814 transitions. [2019-12-07 18:41:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 18:41:19,984 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:19,985 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] [2019-12-07 18:41:19,985 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 18:41:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:19,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1781690935, now seen corresponding path program 1 times [2019-12-07 18:41:19,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:19,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228887250] [2019-12-07 18:41:19,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:20,017 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 18:41:20,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228887250] [2019-12-07 18:41:20,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:20,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:41:20,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311737710] [2019-12-07 18:41:20,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:41:20,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:20,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:41:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:20,019 INFO L87 Difference]: Start difference. First operand 52335 states and 161814 transitions. Second operand 4 states. [2019-12-07 18:41:20,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:20,080 INFO L93 Difference]: Finished difference Result 20576 states and 60970 transitions. [2019-12-07 18:41:20,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:41:20,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-07 18:41:20,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:20,105 INFO L225 Difference]: With dead ends: 20576 [2019-12-07 18:41:20,105 INFO L226 Difference]: Without dead ends: 20576 [2019-12-07 18:41:20,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:41:20,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20576 states. [2019-12-07 18:41:20,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20576 to 19379. [2019-12-07 18:41:20,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19379 states. [2019-12-07 18:41:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19379 states to 19379 states and 57494 transitions. [2019-12-07 18:41:20,490 INFO L78 Accepts]: Start accepts. Automaton has 19379 states and 57494 transitions. Word has length 30 [2019-12-07 18:41:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:20,491 INFO L462 AbstractCegarLoop]: Abstraction has 19379 states and 57494 transitions. [2019-12-07 18:41:20,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:41:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19379 states and 57494 transitions. [2019-12-07 18:41:20,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 18:41:20,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:20,506 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 18:41:20,506 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 18:41:20,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:20,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1459957021, now seen corresponding path program 1 times [2019-12-07 18:41:20,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:20,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635043766] [2019-12-07 18:41:20,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:20,570 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 18:41:20,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635043766] [2019-12-07 18:41:20,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:20,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:41:20,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315541030] [2019-12-07 18:41:20,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:41:20,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:20,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:41:20,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:41:20,571 INFO L87 Difference]: Start difference. First operand 19379 states and 57494 transitions. Second operand 6 states. [2019-12-07 18:41:21,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:21,022 INFO L93 Difference]: Finished difference Result 24111 states and 70497 transitions. [2019-12-07 18:41:21,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:41:21,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2019-12-07 18:41:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:21,048 INFO L225 Difference]: With dead ends: 24111 [2019-12-07 18:41:21,048 INFO L226 Difference]: Without dead ends: 24111 [2019-12-07 18:41:21,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:41:21,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24111 states. [2019-12-07 18:41:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24111 to 19520. [2019-12-07 18:41:21,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19520 states. [2019-12-07 18:41:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19520 states to 19520 states and 57905 transitions. [2019-12-07 18:41:21,371 INFO L78 Accepts]: Start accepts. Automaton has 19520 states and 57905 transitions. Word has length 33 [2019-12-07 18:41:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:21,371 INFO L462 AbstractCegarLoop]: Abstraction has 19520 states and 57905 transitions. [2019-12-07 18:41:21,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:41:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 19520 states and 57905 transitions. [2019-12-07 18:41:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:41:21,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:21,386 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] [2019-12-07 18:41:21,386 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 18:41:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -617380767, now seen corresponding path program 1 times [2019-12-07 18:41:21,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:21,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612133300] [2019-12-07 18:41:21,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:21,453 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 18:41:21,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612133300] [2019-12-07 18:41:21,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:21,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:41:21,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851383442] [2019-12-07 18:41:21,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:41:21,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:21,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:41:21,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:41:21,455 INFO L87 Difference]: Start difference. First operand 19520 states and 57905 transitions. Second operand 6 states. [2019-12-07 18:41:22,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:22,009 INFO L93 Difference]: Finished difference Result 23617 states and 69122 transitions. [2019-12-07 18:41:22,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:41:22,009 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2019-12-07 18:41:22,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:22,044 INFO L225 Difference]: With dead ends: 23617 [2019-12-07 18:41:22,044 INFO L226 Difference]: Without dead ends: 23617 [2019-12-07 18:41:22,045 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:41:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23617 states. [2019-12-07 18:41:22,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23617 to 18809. [2019-12-07 18:41:22,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18809 states. [2019-12-07 18:41:22,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18809 states to 18809 states and 55851 transitions. [2019-12-07 18:41:22,356 INFO L78 Accepts]: Start accepts. Automaton has 18809 states and 55851 transitions. Word has length 35 [2019-12-07 18:41:22,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:22,357 INFO L462 AbstractCegarLoop]: Abstraction has 18809 states and 55851 transitions. [2019-12-07 18:41:22,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:41:22,357 INFO L276 IsEmpty]: Start isEmpty. Operand 18809 states and 55851 transitions. [2019-12-07 18:41:22,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 18:41:22,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:22,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:22,373 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 18:41:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:22,374 INFO L82 PathProgramCache]: Analyzing trace with hash 88308807, now seen corresponding path program 1 times [2019-12-07 18:41:22,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:22,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864341137] [2019-12-07 18:41:22,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:22,402 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 18:41:22,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864341137] [2019-12-07 18:41:22,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:22,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:22,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138367113] [2019-12-07 18:41:22,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:22,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:22,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:22,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:22,403 INFO L87 Difference]: Start difference. First operand 18809 states and 55851 transitions. Second operand 3 states. [2019-12-07 18:41:22,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:22,461 INFO L93 Difference]: Finished difference Result 17915 states and 52392 transitions. [2019-12-07 18:41:22,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:22,462 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 18:41:22,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:22,481 INFO L225 Difference]: With dead ends: 17915 [2019-12-07 18:41:22,481 INFO L226 Difference]: Without dead ends: 17915 [2019-12-07 18:41:22,482 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 18:41:22,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17915 states. [2019-12-07 18:41:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17915 to 17641. [2019-12-07 18:41:22,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-07 18:41:22,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 51624 transitions. [2019-12-07 18:41:22,728 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 51624 transitions. Word has length 41 [2019-12-07 18:41:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:22,729 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 51624 transitions. [2019-12-07 18:41:22,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:22,729 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 51624 transitions. [2019-12-07 18:41:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 18:41:22,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:22,743 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] [2019-12-07 18:41:22,743 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 18:41:22,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1030510862, now seen corresponding path program 1 times [2019-12-07 18:41:22,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:22,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790308714] [2019-12-07 18:41:22,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:22,777 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 18:41:22,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790308714] [2019-12-07 18:41:22,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:22,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:41:22,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543626382] [2019-12-07 18:41:22,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:41:22,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:41:22,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:22,779 INFO L87 Difference]: Start difference. First operand 17641 states and 51624 transitions. Second operand 5 states. [2019-12-07 18:41:22,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:22,833 INFO L93 Difference]: Finished difference Result 16227 states and 48616 transitions. [2019-12-07 18:41:22,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:41:22,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 18:41:22,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:22,852 INFO L225 Difference]: With dead ends: 16227 [2019-12-07 18:41:22,852 INFO L226 Difference]: Without dead ends: 16227 [2019-12-07 18:41:22,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:41:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16227 states. [2019-12-07 18:41:23,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16227 to 14708. [2019-12-07 18:41:23,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14708 states. [2019-12-07 18:41:23,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14708 states to 14708 states and 44273 transitions. [2019-12-07 18:41:23,088 INFO L78 Accepts]: Start accepts. Automaton has 14708 states and 44273 transitions. Word has length 42 [2019-12-07 18:41:23,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:23,088 INFO L462 AbstractCegarLoop]: Abstraction has 14708 states and 44273 transitions. [2019-12-07 18:41:23,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:41:23,088 INFO L276 IsEmpty]: Start isEmpty. Operand 14708 states and 44273 transitions. [2019-12-07 18:41:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:41:23,101 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:23,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:23,101 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 18:41:23,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1200274173, now seen corresponding path program 1 times [2019-12-07 18:41:23,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:23,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287502910] [2019-12-07 18:41:23,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:23,140 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 18:41:23,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287502910] [2019-12-07 18:41:23,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:23,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:41:23,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095251780] [2019-12-07 18:41:23,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:41:23,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:23,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:41:23,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:23,142 INFO L87 Difference]: Start difference. First operand 14708 states and 44273 transitions. Second operand 3 states. [2019-12-07 18:41:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:23,208 INFO L93 Difference]: Finished difference Result 17200 states and 51557 transitions. [2019-12-07 18:41:23,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:41:23,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 18:41:23,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:23,252 INFO L225 Difference]: With dead ends: 17200 [2019-12-07 18:41:23,252 INFO L226 Difference]: Without dead ends: 17200 [2019-12-07 18:41:23,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:41:23,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17200 states. [2019-12-07 18:41:23,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17200 to 13469. [2019-12-07 18:41:23,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13469 states. [2019-12-07 18:41:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13469 states to 13469 states and 40657 transitions. [2019-12-07 18:41:23,477 INFO L78 Accepts]: Start accepts. Automaton has 13469 states and 40657 transitions. Word has length 66 [2019-12-07 18:41:23,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:23,477 INFO L462 AbstractCegarLoop]: Abstraction has 13469 states and 40657 transitions. [2019-12-07 18:41:23,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:41:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 13469 states and 40657 transitions. [2019-12-07 18:41:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:41:23,489 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:23,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:23,490 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 18:41:23,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:23,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1509100091, now seen corresponding path program 1 times [2019-12-07 18:41:23,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:23,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990787464] [2019-12-07 18:41:23,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:41:23,600 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 18:41:23,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990787464] [2019-12-07 18:41:23,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:41:23,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 18:41:23,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655221465] [2019-12-07 18:41:23,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:41:23,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:41:23,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:41:23,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:41:23,601 INFO L87 Difference]: Start difference. First operand 13469 states and 40657 transitions. Second operand 11 states. [2019-12-07 18:41:24,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:41:24,487 INFO L93 Difference]: Finished difference Result 42952 states and 128517 transitions. [2019-12-07 18:41:24,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 18:41:24,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 18:41:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:41:24,520 INFO L225 Difference]: With dead ends: 42952 [2019-12-07 18:41:24,520 INFO L226 Difference]: Without dead ends: 28476 [2019-12-07 18:41:24,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=1269, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 18:41:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28476 states. [2019-12-07 18:41:24,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28476 to 15571. [2019-12-07 18:41:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15571 states. [2019-12-07 18:41:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15571 states to 15571 states and 46618 transitions. [2019-12-07 18:41:24,840 INFO L78 Accepts]: Start accepts. Automaton has 15571 states and 46618 transitions. Word has length 67 [2019-12-07 18:41:24,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:41:24,840 INFO L462 AbstractCegarLoop]: Abstraction has 15571 states and 46618 transitions. [2019-12-07 18:41:24,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:41:24,840 INFO L276 IsEmpty]: Start isEmpty. Operand 15571 states and 46618 transitions. [2019-12-07 18:41:24,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 18:41:24,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:41:24,854 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:41:24,855 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 18:41:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:41:24,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1209104993, now seen corresponding path program 2 times [2019-12-07 18:41:24,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:41:24,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810139110] [2019-12-07 18:41:24,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:41:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:41:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:41:24,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:41:24,941 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:41:24,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t919~0.base_30|) 0) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= |v_ULTIMATE.start_main_~#t919~0.offset_22| 0) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t919~0.base_30| 4)) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t919~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= 0 v_~__unbuffered_p0_EAX~0_159) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t919~0.base_30| 1)) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_30|) |v_ULTIMATE.start_main_~#t919~0.offset_22| 0)) |v_#memory_int_19|) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_~#t919~0.offset=|v_ULTIMATE.start_main_~#t919~0.offset_22|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_23|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ULTIMATE.start_main_~#t919~0.base=|v_ULTIMATE.start_main_~#t919~0.base_30|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_17|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_15|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t919~0.offset, ULTIMATE.start_main_~#t921~0.offset, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t920~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t919~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t920~0.offset, ULTIMATE.start_main_~#t921~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 18:41:24,944 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1648207286 0)) (= ~a$r_buff0_thd1~0_In-1648207286 ~a$r_buff1_thd1~0_Out-1648207286) (= ~a$r_buff1_thd3~0_Out-1648207286 ~a$r_buff0_thd3~0_In-1648207286) (= ~x~0_In-1648207286 ~__unbuffered_p0_EAX~0_Out-1648207286) (= ~a$r_buff1_thd2~0_Out-1648207286 ~a$r_buff0_thd2~0_In-1648207286) (= ~a$r_buff0_thd0~0_In-1648207286 ~a$r_buff1_thd0~0_Out-1648207286) (= 1 ~a$r_buff0_thd1~0_Out-1648207286)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1648207286, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1648207286, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1648207286, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1648207286, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1648207286, ~x~0=~x~0_In-1648207286} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1648207286, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1648207286, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1648207286, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1648207286, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1648207286, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1648207286, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1648207286, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1648207286, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1648207286, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1648207286, ~x~0=~x~0_In-1648207286} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:41:24,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t920~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t920~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t920~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11|) |v_ULTIMATE.start_main_~#t920~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t920~0.offset_10|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t920~0.base, #length, ULTIMATE.start_main_~#t920~0.offset] because there is no mapped edge [2019-12-07 18:41:24,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t921~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t921~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t921~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11|) |v_ULTIMATE.start_main_~#t921~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t921~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t921~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t921~0.offset] because there is no mapped edge [2019-12-07 18:41:24,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In207228181 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In207228181 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out207228181| ~a~0_In207228181)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out207228181| ~a$w_buff1~0_In207228181) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In207228181, ~a$w_buff1~0=~a$w_buff1~0_In207228181, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In207228181, ~a$w_buff1_used~0=~a$w_buff1_used~0_In207228181} OutVars{~a~0=~a~0_In207228181, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out207228181|, ~a$w_buff1~0=~a$w_buff1~0_In207228181, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In207228181, ~a$w_buff1_used~0=~a$w_buff1_used~0_In207228181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 18:41:24,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_28| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_28|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_27|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_41|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 18:41:24,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-121895724 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-121895724 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-121895724| ~a$w_buff0_used~0_In-121895724)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-121895724| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-121895724, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-121895724} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-121895724, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-121895724, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-121895724|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 18:41:24,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In39316293 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In39316293 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In39316293 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In39316293 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out39316293| ~a$w_buff1_used~0_In39316293)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out39316293|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In39316293, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In39316293, ~a$w_buff0_used~0=~a$w_buff0_used~0_In39316293, ~a$w_buff1_used~0=~a$w_buff1_used~0_In39316293} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In39316293, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In39316293, ~a$w_buff0_used~0=~a$w_buff0_used~0_In39316293, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out39316293|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In39316293} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 18:41:24,947 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1405999605 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1405999605 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1405999605|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1405999605 |P1Thread1of1ForFork2_#t~ite13_Out-1405999605|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1405999605, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1405999605} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1405999605, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1405999605, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1405999605|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 18:41:24,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1307443379 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1307443379 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1307443379 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1307443379 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1307443379| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-1307443379| ~a$r_buff1_thd2~0_In-1307443379) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1307443379, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1307443379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1307443379, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1307443379} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1307443379, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1307443379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1307443379, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1307443379, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1307443379|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 18:41:24,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_22| v_~a$r_buff1_thd2~0_51) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_22|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_21|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 18:41:24,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1749654929 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1749654929 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1749654929 |P0Thread1of1ForFork1_#t~ite5_Out-1749654929|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1749654929|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1749654929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1749654929} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1749654929|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1749654929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1749654929} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 18:41:24,948 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd1~0_In-1370026616 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1370026616 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1370026616 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1370026616 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1370026616| ~a$w_buff1_used~0_In-1370026616) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1370026616|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1370026616, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370026616, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1370026616, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1370026616} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1370026616|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1370026616, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370026616, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1370026616, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1370026616} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:41:24,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= ~a$r_buff0_thd1~0_Out1329022657 ~a$r_buff0_thd1~0_In1329022657)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1329022657 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1329022657 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~a$r_buff0_thd1~0_Out1329022657 0) (not .cse2) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1329022657, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1329022657} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1329022657|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1329022657, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1329022657} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:41:24,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1679472426 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1679472426 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1679472426 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1679472426 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1679472426| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out-1679472426| ~a$r_buff1_thd1~0_In-1679472426) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1679472426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679472426, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1679472426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679472426} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1679472426|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1679472426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679472426, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1679472426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679472426} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 18:41:24,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:41:24,952 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1164041584 256) 0))) (or (and (not .cse0) (= ~a$w_buff1_used~0_In-1164041584 |P2Thread1of1ForFork0_#t~ite30_Out-1164041584|) (= |P2Thread1of1ForFork0_#t~ite29_In-1164041584| |P2Thread1of1ForFork0_#t~ite29_Out-1164041584|)) (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1164041584 256)))) (or (= (mod ~a$w_buff0_used~0_In-1164041584 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1164041584 256))) (and (= (mod ~a$w_buff1_used~0_In-1164041584 256) 0) .cse1))) (= ~a$w_buff1_used~0_In-1164041584 |P2Thread1of1ForFork0_#t~ite29_Out-1164041584|) (= |P2Thread1of1ForFork0_#t~ite29_Out-1164041584| |P2Thread1of1ForFork0_#t~ite30_Out-1164041584|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1164041584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1164041584, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1164041584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1164041584, ~weak$$choice2~0=~weak$$choice2~0_In-1164041584, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1164041584|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1164041584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1164041584, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1164041584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1164041584, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1164041584|, ~weak$$choice2~0=~weak$$choice2~0_In-1164041584, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1164041584|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:41:24,953 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:41:24,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 18:41:24,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1687069109 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1687069109 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1687069109| ~a~0_In-1687069109)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-1687069109| ~a$w_buff1~0_In-1687069109) (not .cse1)))) InVars {~a~0=~a~0_In-1687069109, ~a$w_buff1~0=~a$w_buff1~0_In-1687069109, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1687069109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1687069109} OutVars{~a~0=~a~0_In-1687069109, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1687069109|, ~a$w_buff1~0=~a$w_buff1~0_In-1687069109, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1687069109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1687069109} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 18:41:24,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 18:41:24,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2145004758 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2145004758 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2145004758 |P2Thread1of1ForFork0_#t~ite40_Out-2145004758|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-2145004758|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145004758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145004758} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2145004758|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145004758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145004758} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 18:41:24,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1973288007 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1973288007 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1973288007 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1973288007 256)))) (or (and (= ~a$w_buff1_used~0_In-1973288007 |P2Thread1of1ForFork0_#t~ite41_Out-1973288007|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1973288007|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1973288007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1973288007, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1973288007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1973288007} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1973288007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1973288007, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1973288007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1973288007, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1973288007|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 18:41:24,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-548638995 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-548638995 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-548638995| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-548638995| ~a$r_buff0_thd3~0_In-548638995)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-548638995, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-548638995} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-548638995, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-548638995, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-548638995|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:41:24,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In1921792433 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1921792433 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1921792433 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1921792433 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In1921792433 |P2Thread1of1ForFork0_#t~ite43_Out1921792433|)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out1921792433| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1921792433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1921792433, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1921792433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1921792433} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1921792433|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1921792433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1921792433, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1921792433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1921792433} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 18:41:24,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:41:24,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:41:24,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out114640151| |ULTIMATE.start_main_#t~ite47_Out114640151|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In114640151 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In114640151 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out114640151| ~a$w_buff1~0_In114640151) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~a~0_In114640151 |ULTIMATE.start_main_#t~ite47_Out114640151|)))) InVars {~a~0=~a~0_In114640151, ~a$w_buff1~0=~a$w_buff1~0_In114640151, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In114640151, ~a$w_buff1_used~0=~a$w_buff1_used~0_In114640151} OutVars{~a~0=~a~0_In114640151, ~a$w_buff1~0=~a$w_buff1~0_In114640151, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out114640151|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In114640151, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out114640151|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In114640151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 18:41:24,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-866595954 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-866595954 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-866595954|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-866595954 |ULTIMATE.start_main_#t~ite49_Out-866595954|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-866595954, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-866595954} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-866595954, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-866595954|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-866595954} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 18:41:24,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In218116382 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In218116382 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In218116382 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In218116382 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out218116382| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out218116382| ~a$w_buff1_used~0_In218116382)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In218116382, ~a$w_buff0_used~0=~a$w_buff0_used~0_In218116382, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In218116382, ~a$w_buff1_used~0=~a$w_buff1_used~0_In218116382} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out218116382|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In218116382, ~a$w_buff0_used~0=~a$w_buff0_used~0_In218116382, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In218116382, ~a$w_buff1_used~0=~a$w_buff1_used~0_In218116382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 18:41:24,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2139516670 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-2139516670 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-2139516670| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-2139516670| ~a$r_buff0_thd0~0_In-2139516670)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2139516670, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2139516670} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2139516670|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2139516670, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2139516670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 18:41:24,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In128051604 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In128051604 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In128051604 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In128051604 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out128051604|)) (and (= ~a$r_buff1_thd0~0_In128051604 |ULTIMATE.start_main_#t~ite52_Out128051604|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In128051604, ~a$w_buff0_used~0=~a$w_buff0_used~0_In128051604, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In128051604, ~a$w_buff1_used~0=~a$w_buff1_used~0_In128051604} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out128051604|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In128051604, ~a$w_buff0_used~0=~a$w_buff0_used~0_In128051604, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In128051604, ~a$w_buff1_used~0=~a$w_buff1_used~0_In128051604} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 18:41:24,958 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= 0 v_~__unbuffered_p0_EAX~0_128))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:41:25,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:41:25 BasicIcfg [2019-12-07 18:41:25,014 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:41:25,015 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:41:25,015 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:41:25,015 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:41:25,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:38:43" (3/4) ... [2019-12-07 18:41:25,017 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:41:25,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] ULTIMATE.startENTRY-->L832: Formula: (let ((.cse0 (store |v_#valid_69| 0 0))) (and (= v_~a$w_buff0~0_303 0) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~__unbuffered_p2_EBX~0_46 0) (= v_~z~0_13 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t919~0.base_30|) 0) (= |v_#NULL.offset_7| 0) (= v_~a~0_199 0) (= 0 v_~a$read_delayed_var~0.base_7) (= 0 v_~a$r_buff0_thd2~0_205) (= |v_ULTIMATE.start_main_~#t919~0.offset_22| 0) (= v_~a$r_buff0_thd3~0_412 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~a$read_delayed~0_7) (= v_~a$read_delayed_var~0.offset_7 0) (= v_~y~0_30 0) (= v_~a$r_buff1_thd3~0_326 0) (= v_~main$tmp_guard0~0_25 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t919~0.base_30| 4)) (= 0 v_~__unbuffered_cnt~0_83) (< 0 |v_#StackHeapBarrier_16|) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t919~0.base_30|) (= 0 v_~a$w_buff1_used~0_450) (= 0 v_~__unbuffered_p0_EAX~0_159) (= |v_#valid_67| (store .cse0 |v_ULTIMATE.start_main_~#t919~0.base_30| 1)) (= v_~a$flush_delayed~0_27 0) (= 0 v_~a$r_buff1_thd2~0_197) (= v_~a$mem_tmp~0_16 0) (= v_~main$tmp_guard1~0_32 0) (= 0 |v_#NULL.base_7|) (= 0 v_~a$r_buff1_thd1~0_190) (= v_~a$r_buff1_thd0~0_208 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_30| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t919~0.base_30|) |v_ULTIMATE.start_main_~#t919~0.offset_22| 0)) |v_#memory_int_19|) (= 0 v_~x~0_153) (= 0 v_~a$w_buff1~0_206) (= 0 v_~a$r_buff0_thd1~0_334) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~a$r_buff0_thd0~0_214 0) (= 0 v_~weak$$choice0~0_13) (= 0 v_~a$w_buff0_used~0_788))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_197, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_53|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_53|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_214, ULTIMATE.start_main_~#t919~0.offset=|v_ULTIMATE.start_main_~#t919~0.offset_22|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_33|, ~a~0=v_~a~0_199, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_64|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_46, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_326, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_788, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_23|, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_334, ULTIMATE.start_main_~#t919~0.base=|v_ULTIMATE.start_main_~#t919~0.base_30|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_7, ~a$w_buff0~0=v_~a$w_buff0~0_303, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_208, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~x~0=v_~x~0_153, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_17|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_15|, ~a$read_delayed~0=v_~a$read_delayed~0_7, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_205, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_79|, ~a$mem_tmp~0=v_~a$mem_tmp~0_16, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ~a$w_buff1~0=v_~a$w_buff1~0_206, ~y~0=v_~y~0_30, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_190, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_412, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, #NULL.base=|v_#NULL.base_7|, ~a$flush_delayed~0=v_~a$flush_delayed~0_27, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_13, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_450, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_7} AuxVars[] AssignedVars[~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_~#t919~0.offset, ULTIMATE.start_main_~#t921~0.offset, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ULTIMATE.start_main_~#t920~0.base, ~a$r_buff0_thd1~0, ULTIMATE.start_main_~#t919~0.base, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t920~0.offset, ULTIMATE.start_main_~#t921~0.base, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-07 18:41:25,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L750: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1648207286 0)) (= ~a$r_buff0_thd1~0_In-1648207286 ~a$r_buff1_thd1~0_Out-1648207286) (= ~a$r_buff1_thd3~0_Out-1648207286 ~a$r_buff0_thd3~0_In-1648207286) (= ~x~0_In-1648207286 ~__unbuffered_p0_EAX~0_Out-1648207286) (= ~a$r_buff1_thd2~0_Out-1648207286 ~a$r_buff0_thd2~0_In-1648207286) (= ~a$r_buff0_thd0~0_In-1648207286 ~a$r_buff1_thd0~0_Out-1648207286) (= 1 ~a$r_buff0_thd1~0_Out-1648207286)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1648207286, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1648207286, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1648207286, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1648207286, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1648207286, ~x~0=~x~0_In-1648207286} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-1648207286, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1648207286, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1648207286, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1648207286, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1648207286, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1648207286, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1648207286, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1648207286, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1648207286, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1648207286, ~x~0=~x~0_In-1648207286} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:41:25,018 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L832-1-->L834: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t920~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t920~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t920~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t920~0.base_11|) |v_ULTIMATE.start_main_~#t920~0.offset_10| 1)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t920~0.offset_10|) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11| 1)) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t920~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t920~0.base=|v_ULTIMATE.start_main_~#t920~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t920~0.offset=|v_ULTIMATE.start_main_~#t920~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t920~0.base, #length, ULTIMATE.start_main_~#t920~0.offset] because there is no mapped edge [2019-12-07 18:41:25,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L834-1-->L836: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t921~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t921~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t921~0.base_11| 0)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t921~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t921~0.base_11|) |v_ULTIMATE.start_main_~#t921~0.offset_10| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t921~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t921~0.base=|v_ULTIMATE.start_main_~#t921~0.base_11|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t921~0.offset=|v_ULTIMATE.start_main_~#t921~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t921~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t921~0.offset] because there is no mapped edge [2019-12-07 18:41:25,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L770-2-->L770-4: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In207228181 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In207228181 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out207228181| ~a~0_In207228181)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out207228181| ~a$w_buff1~0_In207228181) (not .cse0) (not .cse1)))) InVars {~a~0=~a~0_In207228181, ~a$w_buff1~0=~a$w_buff1~0_In207228181, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In207228181, ~a$w_buff1_used~0=~a$w_buff1_used~0_In207228181} OutVars{~a~0=~a~0_In207228181, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out207228181|, ~a$w_buff1~0=~a$w_buff1~0_In207228181, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In207228181, ~a$w_buff1_used~0=~a$w_buff1_used~0_In207228181} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 18:41:25,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L770-4-->L771: Formula: (= |v_P1Thread1of1ForFork2_#t~ite9_28| v_~a~0_66) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_28|} OutVars{~a~0=v_~a~0_66, P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_27|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_41|} AuxVars[] AssignedVars[~a~0, P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 18:41:25,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-121895724 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-121895724 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-121895724| ~a$w_buff0_used~0_In-121895724)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out-121895724| 0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-121895724, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-121895724} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-121895724, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-121895724, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-121895724|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 18:41:25,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In39316293 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In39316293 256))) (.cse2 (= (mod ~a$w_buff0_used~0_In39316293 256) 0)) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In39316293 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite12_Out39316293| ~a$w_buff1_used~0_In39316293)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out39316293|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In39316293, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In39316293, ~a$w_buff0_used~0=~a$w_buff0_used~0_In39316293, ~a$w_buff1_used~0=~a$w_buff1_used~0_In39316293} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In39316293, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In39316293, ~a$w_buff0_used~0=~a$w_buff0_used~0_In39316293, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out39316293|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In39316293} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 18:41:25,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-1405999605 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In-1405999605 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1405999605|)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd2~0_In-1405999605 |P1Thread1of1ForFork2_#t~ite13_Out-1405999605|)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1405999605, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1405999605} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1405999605, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1405999605, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1405999605|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 18:41:25,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L774-->L774-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1307443379 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In-1307443379 256))) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1307443379 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1307443379 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-1307443379| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out-1307443379| ~a$r_buff1_thd2~0_In-1307443379) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1307443379, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1307443379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1307443379, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1307443379} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1307443379, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1307443379, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1307443379, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1307443379, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1307443379|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 18:41:25,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] L774-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_22| v_~a$r_buff1_thd2~0_51) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_22|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_51, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_21|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 18:41:25,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L751-->L751-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In-1749654929 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-1749654929 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1749654929 |P0Thread1of1ForFork1_#t~ite5_Out-1749654929|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-1749654929|) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1749654929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1749654929} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1749654929|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1749654929, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1749654929} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 18:41:25,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd1~0_In-1370026616 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In-1370026616 256) 0)) (.cse3 (= (mod ~a$w_buff0_used~0_In-1370026616 256) 0)) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1370026616 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1370026616| ~a$w_buff1_used~0_In-1370026616) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1370026616|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1370026616, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370026616, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1370026616, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1370026616} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1370026616|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1370026616, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1370026616, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1370026616, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1370026616} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:41:25,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L753-->L754: Formula: (let ((.cse1 (= ~a$r_buff0_thd1~0_Out1329022657 ~a$r_buff0_thd1~0_In1329022657)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In1329022657 256))) (.cse0 (= (mod ~a$r_buff0_thd1~0_In1329022657 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~a$r_buff0_thd1~0_Out1329022657 0) (not .cse2) (not .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1329022657, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1329022657} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1329022657|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1329022657, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1329022657} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:41:25,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L754-->L754-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff0_used~0_In-1679472426 256))) (.cse2 (= 0 (mod ~a$r_buff0_thd1~0_In-1679472426 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1679472426 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-1679472426 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1679472426| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork1_#t~ite8_Out-1679472426| ~a$r_buff1_thd1~0_In-1679472426) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1679472426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679472426, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1679472426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679472426} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1679472426|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1679472426, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1679472426, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1679472426, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1679472426} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 18:41:25,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L754-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_87 |v_P0Thread1of1ForFork1_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_35|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_87, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:41:25,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L801-->L801-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1164041584 256) 0))) (or (and (not .cse0) (= ~a$w_buff1_used~0_In-1164041584 |P2Thread1of1ForFork0_#t~ite30_Out-1164041584|) (= |P2Thread1of1ForFork0_#t~ite29_In-1164041584| |P2Thread1of1ForFork0_#t~ite29_Out-1164041584|)) (and .cse0 (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-1164041584 256)))) (or (= (mod ~a$w_buff0_used~0_In-1164041584 256) 0) (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1164041584 256))) (and (= (mod ~a$w_buff1_used~0_In-1164041584 256) 0) .cse1))) (= ~a$w_buff1_used~0_In-1164041584 |P2Thread1of1ForFork0_#t~ite29_Out-1164041584|) (= |P2Thread1of1ForFork0_#t~ite29_Out-1164041584| |P2Thread1of1ForFork0_#t~ite30_Out-1164041584|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1164041584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1164041584, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1164041584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1164041584, ~weak$$choice2~0=~weak$$choice2~0_In-1164041584, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In-1164041584|} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1164041584, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1164041584, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1164041584, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1164041584, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out-1164041584|, ~weak$$choice2~0=~weak$$choice2~0_In-1164041584, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-1164041584|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 18:41:25,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L802-->L803: Formula: (and (not (= (mod v_~weak$$choice2~0_19 256) 0)) (= v_~a$r_buff0_thd3~0_66 v_~a$r_buff0_thd3~0_65)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_19} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_7|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_65, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_19} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 18:41:25,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L805-->L809: Formula: (and (= v_~a$flush_delayed~0_11 0) (= v_~a~0_48 v_~a$mem_tmp~0_5) (not (= (mod v_~a$flush_delayed~0_12 256) 0))) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_12} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_11|, ~a~0=v_~a~0_48, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_11} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 18:41:25,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L809-2-->L809-4: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In-1687069109 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd3~0_In-1687069109 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-1687069109| ~a~0_In-1687069109)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-1687069109| ~a$w_buff1~0_In-1687069109) (not .cse1)))) InVars {~a~0=~a~0_In-1687069109, ~a$w_buff1~0=~a$w_buff1~0_In-1687069109, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1687069109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1687069109} OutVars{~a~0=~a~0_In-1687069109, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1687069109|, ~a$w_buff1~0=~a$w_buff1~0_In-1687069109, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1687069109, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1687069109} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 18:41:25,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L809-4-->L810: Formula: (= v_~a~0_37 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_37, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_11|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 18:41:25,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2145004758 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-2145004758 256)))) (or (and (or .cse0 .cse1) (= ~a$w_buff0_used~0_In-2145004758 |P2Thread1of1ForFork0_#t~ite40_Out-2145004758|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-2145004758|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145004758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145004758} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-2145004758|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2145004758, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-2145004758} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 18:41:25,027 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-1973288007 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd3~0_In-1973288007 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1973288007 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd3~0_In-1973288007 256)))) (or (and (= ~a$w_buff1_used~0_In-1973288007 |P2Thread1of1ForFork0_#t~ite41_Out-1973288007|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-1973288007|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1973288007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1973288007, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1973288007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1973288007} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1973288007, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1973288007, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1973288007, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1973288007, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1973288007|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 18:41:25,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L812-->L812-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd3~0_In-548638995 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-548638995 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-548638995| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out-548638995| ~a$r_buff0_thd3~0_In-548638995)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-548638995, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-548638995} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-548638995, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-548638995, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-548638995|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 18:41:25,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L813-->L813-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd3~0_In1921792433 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In1921792433 256) 0)) (.cse1 (= (mod ~a$r_buff1_thd3~0_In1921792433 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In1921792433 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$r_buff1_thd3~0_In1921792433 |P2Thread1of1ForFork0_#t~ite43_Out1921792433|)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out1921792433| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1921792433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1921792433, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1921792433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1921792433} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1921792433|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1921792433, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1921792433, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1921792433, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1921792433} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 18:41:25,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L813-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~a$r_buff1_thd3~0_201 |v_P2Thread1of1ForFork0_#t~ite43_32|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_31|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_201, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:41:25,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L836-1-->L842: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:41:25,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [852] [852] L842-2-->L842-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out114640151| |ULTIMATE.start_main_#t~ite47_Out114640151|)) (.cse2 (= (mod ~a$r_buff1_thd0~0_In114640151 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In114640151 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite47_Out114640151| ~a$w_buff1~0_In114640151) (not .cse1) (not .cse2)) (and .cse0 (or .cse2 .cse1) (= ~a~0_In114640151 |ULTIMATE.start_main_#t~ite47_Out114640151|)))) InVars {~a~0=~a~0_In114640151, ~a$w_buff1~0=~a$w_buff1~0_In114640151, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In114640151, ~a$w_buff1_used~0=~a$w_buff1_used~0_In114640151} OutVars{~a~0=~a~0_In114640151, ~a$w_buff1~0=~a$w_buff1~0_In114640151, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out114640151|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In114640151, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out114640151|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In114640151} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 18:41:25,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd0~0_In-866595954 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-866595954 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite49_Out-866595954|) (not .cse0) (not .cse1)) (and (= ~a$w_buff0_used~0_In-866595954 |ULTIMATE.start_main_#t~ite49_Out-866595954|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-866595954, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-866595954} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-866595954, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-866595954|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-866595954} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 18:41:25,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~a$w_buff1_used~0_In218116382 256) 0)) (.cse1 (= 0 (mod ~a$r_buff1_thd0~0_In218116382 256))) (.cse3 (= (mod ~a$r_buff0_thd0~0_In218116382 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In218116382 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out218116382| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out218116382| ~a$w_buff1_used~0_In218116382)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In218116382, ~a$w_buff0_used~0=~a$w_buff0_used~0_In218116382, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In218116382, ~a$w_buff1_used~0=~a$w_buff1_used~0_In218116382} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out218116382|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In218116382, ~a$w_buff0_used~0=~a$w_buff0_used~0_In218116382, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In218116382, ~a$w_buff1_used~0=~a$w_buff1_used~0_In218116382} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 18:41:25,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-2139516670 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd0~0_In-2139516670 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-2139516670| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite51_Out-2139516670| ~a$r_buff0_thd0~0_In-2139516670)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-2139516670, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2139516670} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-2139516670|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2139516670, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2139516670} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 18:41:25,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L846-->L846-2: Formula: (let ((.cse3 (= (mod ~a$r_buff0_thd0~0_In128051604 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In128051604 256))) (.cse1 (= (mod ~a$w_buff1_used~0_In128051604 256) 0)) (.cse0 (= (mod ~a$r_buff1_thd0~0_In128051604 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out128051604|)) (and (= ~a$r_buff1_thd0~0_In128051604 |ULTIMATE.start_main_#t~ite52_Out128051604|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In128051604, ~a$w_buff0_used~0=~a$w_buff0_used~0_In128051604, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In128051604, ~a$w_buff1_used~0=~a$w_buff1_used~0_In128051604} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out128051604|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In128051604, ~a$w_buff0_used~0=~a$w_buff0_used~0_In128051604, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In128051604, ~a$w_buff1_used~0=~a$w_buff1_used~0_In128051604} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 18:41:25,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L846-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_20 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~a$r_buff1_thd0~0_170 |v_ULTIMATE.start_main_#t~ite52_39|) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_21) (= v_~__unbuffered_p2_EBX~0_32 0) (= 1 v_~__unbuffered_p2_EAX~0_21) (= 0 v_~__unbuffered_p0_EAX~0_128))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_128, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_170, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:41:25,083 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4101a352-4c82-4445-9cfd-4d91ce11cf93/bin/uautomizer/witness.graphml [2019-12-07 18:41:25,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:41:25,084 INFO L168 Benchmark]: Toolchain (without parser) took 162432.47 ms. Allocated memory was 1.0 GB in the beginning and 6.0 GB in the end (delta: 4.9 GB). Free memory was 935.5 MB in the beginning and 4.4 GB in the end (delta: -3.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:41:25,084 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:41:25,084 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:25,084 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:25,085 INFO L168 Benchmark]: Boogie Preprocessor took 27.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:41:25,085 INFO L168 Benchmark]: RCFGBuilder took 418.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:25,085 INFO L168 Benchmark]: TraceAbstraction took 161475.22 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 18:41:25,085 INFO L168 Benchmark]: Witness Printer took 68.00 ms. Allocated memory is still 6.0 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:41:25,087 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -157.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.67 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 418.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 161475.22 ms. Allocated memory was 1.2 GB in the beginning and 6.0 GB in the end (delta: 4.8 GB). Free memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: -3.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 68.00 ms. Allocated memory is still 6.0 GB. Free memory was 4.5 GB in the beginning and 4.4 GB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.3s, 178 ProgramPointsBefore, 94 ProgramPointsAfterwards, 215 TransitionsBefore, 104 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 31 ChoiceCompositions, 7408 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 42 SemBasedMoverChecksPositive, 283 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 83880 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L832] FCALL, FORK 0 pthread_create(&t919, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L735] 1 a$w_buff1 = a$w_buff0 [L736] 1 a$w_buff0 = 1 [L737] 1 a$w_buff1_used = a$w_buff0_used [L738] 1 a$w_buff0_used = (_Bool)1 [L750] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L834] FCALL, FORK 0 pthread_create(&t920, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L764] 2 x = 1 [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L750] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L771] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L772] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L773] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L751] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L752] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L836] FCALL, FORK 0 pthread_create(&t921, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 3 y = 1 [L787] 3 z = 1 [L790] 3 __unbuffered_p2_EAX = z [L793] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L794] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L795] 3 a$flush_delayed = weak$$choice2 [L796] 3 a$mem_tmp = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L797] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L798] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L798] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L799] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L800] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L800] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L801] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L803] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L809] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L810] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L811] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L812] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L842] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=1] [L842] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L843] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L844] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L845] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 161.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 29.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4578 SDtfs, 4511 SDslu, 9932 SDs, 0 SdLazy, 4415 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 34 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=247715occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 110.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 369718 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 714 NumberOfCodeBlocks, 714 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 623 ConstructedInterpolants, 0 QuantifiedInterpolants, 103067 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...