./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_tso.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_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8cd42fdc0e6d134624cee6776755ac675531487 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 21:22:45,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:22:45,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:22:45,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:22:45,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:22:45,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:22:45,096 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:22:45,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:22:45,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:22:45,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:22:45,099 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:22:45,100 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:22:45,100 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:22:45,101 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:22:45,102 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:22:45,102 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:22:45,103 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:22:45,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:22:45,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:22:45,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:22:45,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:22:45,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:22:45,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:22:45,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:22:45,112 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:22:45,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:22:45,113 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:22:45,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:22:45,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:22:45,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:22:45,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:22:45,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:22:45,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:22:45,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:22:45,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:22:45,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:22:45,117 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:22:45,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:22:45,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:22:45,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:22:45,119 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:22:45,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:22:45,133 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:22:45,133 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:22:45,134 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:22:45,134 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:22:45,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:22:45,134 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:22:45,134 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:22:45,135 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:22:45,135 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:22:45,135 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:22:45,135 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:22:45,135 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:22:45,136 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:22:45,136 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:22:45,136 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:22:45,137 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:22:45,137 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:22:45,137 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:22:45,137 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:22:45,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:22:45,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:22:45,138 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:22:45,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:22:45,138 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:22:45,138 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:22:45,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:22:45,138 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:22:45,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:22:45,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:22:45,139 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:22:45,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:22:45,139 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:22:45,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:22:45,140 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:22:45,140 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:22:45,140 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:22:45,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:22:45,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:22:45,141 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:22:45,141 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:22:45,141 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan 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 -> Taipan 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 -> a8cd42fdc0e6d134624cee6776755ac675531487 [2019-12-07 21:22:45,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:22:45,252 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:22:45,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:22:45,255 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:22:45,255 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:22:45,256 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_tso.oepc.i [2019-12-07 21:22:45,292 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/data/8655a92dd/0dd84e4c70994871a3c1621c95f6c89b/FLAG428b38efa [2019-12-07 21:22:45,755 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:22:45,755 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/sv-benchmarks/c/pthread-wmm/rfi003_tso.oepc.i [2019-12-07 21:22:45,766 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/data/8655a92dd/0dd84e4c70994871a3c1621c95f6c89b/FLAG428b38efa [2019-12-07 21:22:46,276 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/data/8655a92dd/0dd84e4c70994871a3c1621c95f6c89b [2019-12-07 21:22:46,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:22:46,280 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:22:46,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:22:46,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:22:46,283 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:22:46,284 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@227d51b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46, skipping insertion in model container [2019-12-07 21:22:46,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,291 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:22:46,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:22:46,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:22:46,586 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:22:46,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:22:46,686 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:22:46,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46 WrapperNode [2019-12-07 21:22:46,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:22:46,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:22:46,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:22:46,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:22:46,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,707 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,733 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:22:46,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:22:46,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:22:46,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:22:46,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,743 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,743 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,756 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,760 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... [2019-12-07 21:22:46,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:22:46,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:22:46,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:22:46,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:22:46,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/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 21:22:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:22:46,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:22:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:22:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:22:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:22:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:22:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:22:46,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:22:46,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:22:46,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:22:46,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:22:46,817 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:22:47,329 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:22:47,329 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:22:47,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:47 BoogieIcfgContainer [2019-12-07 21:22:47,330 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:22:47,331 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:22:47,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:22:47,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:22:47,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:22:46" (1/3) ... [2019-12-07 21:22:47,333 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618239b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:22:47, skipping insertion in model container [2019-12-07 21:22:47,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:22:46" (2/3) ... [2019-12-07 21:22:47,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618239b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:22:47, skipping insertion in model container [2019-12-07 21:22:47,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:47" (3/3) ... [2019-12-07 21:22:47,335 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.oepc.i [2019-12-07 21:22:47,341 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:22:47,342 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:22:47,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:22:47,347 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:22:47,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,378 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,381 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,382 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,383 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,388 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,389 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,393 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,394 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,395 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,396 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,397 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,398 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,399 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,400 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,401 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:22:47,416 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 21:22:47,429 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:22:47,429 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:22:47,429 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:22:47,429 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:22:47,429 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:22:47,429 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:22:47,429 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:22:47,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:22:47,441 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-07 21:22:47,442 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-07 21:22:47,527 INFO L134 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-07 21:22:47,528 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:22:47,548 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1350 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-07 21:22:47,594 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-07 21:22:47,653 INFO L134 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-07 21:22:47,653 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:22:47,669 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1350 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-07 21:22:47,704 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-07 21:22:47,705 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:22:51,595 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 21:22:51,756 INFO L206 etLargeBlockEncoding]: Checked pairs total: 282427 [2019-12-07 21:22:51,756 INFO L214 etLargeBlockEncoding]: Total number of compositions: 142 [2019-12-07 21:22:51,758 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155 places, 192 transitions [2019-12-07 21:22:58,962 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86906 states. [2019-12-07 21:22:58,964 INFO L276 IsEmpty]: Start isEmpty. Operand 86906 states. [2019-12-07 21:22:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 21:22:58,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:58,968 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 21:22:58,968 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:22:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:58,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1352240646, now seen corresponding path program 1 times [2019-12-07 21:22:58,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:58,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607843083] [2019-12-07 21:22:58,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:59,114 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 21:22:59,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607843083] [2019-12-07 21:22:59,115 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:59,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:22:59,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634909161] [2019-12-07 21:22:59,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:22:59,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:59,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:22:59,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:22:59,129 INFO L87 Difference]: Start difference. First operand 86906 states. Second operand 3 states. [2019-12-07 21:22:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:59,801 INFO L93 Difference]: Finished difference Result 86858 states and 312643 transitions. [2019-12-07 21:22:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:22:59,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 21:22:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:00,202 INFO L225 Difference]: With dead ends: 86858 [2019-12-07 21:23:00,202 INFO L226 Difference]: Without dead ends: 85058 [2019-12-07 21:23:00,203 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 21:23:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85058 states. [2019-12-07 21:23:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85058 to 85058. [2019-12-07 21:23:03,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85058 states. [2019-12-07 21:23:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85058 states to 85058 states and 306544 transitions. [2019-12-07 21:23:04,062 INFO L78 Accepts]: Start accepts. Automaton has 85058 states and 306544 transitions. Word has length 5 [2019-12-07 21:23:04,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:04,062 INFO L462 AbstractCegarLoop]: Abstraction has 85058 states and 306544 transitions. [2019-12-07 21:23:04,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 85058 states and 306544 transitions. [2019-12-07 21:23:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:23:04,064 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:04,064 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:04,065 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:04,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:04,065 INFO L82 PathProgramCache]: Analyzing trace with hash -2045261550, now seen corresponding path program 1 times [2019-12-07 21:23:04,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:04,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877885344] [2019-12-07 21:23:04,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:04,129 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 21:23:04,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877885344] [2019-12-07 21:23:04,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:04,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:04,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177519169] [2019-12-07 21:23:04,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:04,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:04,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:04,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:04,131 INFO L87 Difference]: Start difference. First operand 85058 states and 306544 transitions. Second operand 4 states. [2019-12-07 21:23:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:04,830 INFO L93 Difference]: Finished difference Result 127330 states and 444666 transitions. [2019-12-07 21:23:04,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:23:04,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:23:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:05,090 INFO L225 Difference]: With dead ends: 127330 [2019-12-07 21:23:05,090 INFO L226 Difference]: Without dead ends: 127330 [2019-12-07 21:23:05,091 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 21:23:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127330 states. [2019-12-07 21:23:10,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127330 to 126190. [2019-12-07 21:23:10,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126190 states. [2019-12-07 21:23:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126190 states to 126190 states and 441366 transitions. [2019-12-07 21:23:11,001 INFO L78 Accepts]: Start accepts. Automaton has 126190 states and 441366 transitions. Word has length 11 [2019-12-07 21:23:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:11,001 INFO L462 AbstractCegarLoop]: Abstraction has 126190 states and 441366 transitions. [2019-12-07 21:23:11,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 126190 states and 441366 transitions. [2019-12-07 21:23:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:23:11,003 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:11,004 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:11,004 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:11,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash 216920818, now seen corresponding path program 1 times [2019-12-07 21:23:11,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:11,004 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971887301] [2019-12-07 21:23:11,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:11,040 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 21:23:11,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971887301] [2019-12-07 21:23:11,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:11,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:11,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692013431] [2019-12-07 21:23:11,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:11,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:11,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:11,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:11,042 INFO L87 Difference]: Start difference. First operand 126190 states and 441366 transitions. Second operand 3 states. [2019-12-07 21:23:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:11,062 INFO L93 Difference]: Finished difference Result 7755 states and 18817 transitions. [2019-12-07 21:23:11,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:11,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 21:23:11,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:11,069 INFO L225 Difference]: With dead ends: 7755 [2019-12-07 21:23:11,069 INFO L226 Difference]: Without dead ends: 7755 [2019-12-07 21:23:11,070 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 21:23:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7755 states. [2019-12-07 21:23:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7755 to 7715. [2019-12-07 21:23:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7715 states. [2019-12-07 21:23:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7715 states to 7715 states and 18737 transitions. [2019-12-07 21:23:11,155 INFO L78 Accepts]: Start accepts. Automaton has 7715 states and 18737 transitions. Word has length 11 [2019-12-07 21:23:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:11,155 INFO L462 AbstractCegarLoop]: Abstraction has 7715 states and 18737 transitions. [2019-12-07 21:23:11,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 7715 states and 18737 transitions. [2019-12-07 21:23:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:23:11,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:11,158 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 21:23:11,158 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash -468341505, now seen corresponding path program 1 times [2019-12-07 21:23:11,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:11,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993216609] [2019-12-07 21:23:11,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:11,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:11,261 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 21:23:11,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993216609] [2019-12-07 21:23:11,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:11,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:11,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987440335] [2019-12-07 21:23:11,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:11,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:11,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:11,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:11,263 INFO L87 Difference]: Start difference. First operand 7715 states and 18737 transitions. Second operand 7 states. [2019-12-07 21:23:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:11,822 INFO L93 Difference]: Finished difference Result 9139 states and 21753 transitions. [2019-12-07 21:23:11,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:23:11,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-07 21:23:11,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:11,829 INFO L225 Difference]: With dead ends: 9139 [2019-12-07 21:23:11,829 INFO L226 Difference]: Without dead ends: 9139 [2019-12-07 21:23:11,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:23:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-12-07 21:23:11,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 8897. [2019-12-07 21:23:11,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8897 states. [2019-12-07 21:23:11,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8897 states to 8897 states and 21286 transitions. [2019-12-07 21:23:11,920 INFO L78 Accepts]: Start accepts. Automaton has 8897 states and 21286 transitions. Word has length 22 [2019-12-07 21:23:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:11,920 INFO L462 AbstractCegarLoop]: Abstraction has 8897 states and 21286 transitions. [2019-12-07 21:23:11,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8897 states and 21286 transitions. [2019-12-07 21:23:11,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:23:11,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:11,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:11,923 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:11,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:11,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1753070628, now seen corresponding path program 1 times [2019-12-07 21:23:11,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:11,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903155914] [2019-12-07 21:23:11,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:12,038 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 21:23:12,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903155914] [2019-12-07 21:23:12,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:12,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:23:12,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196829776] [2019-12-07 21:23:12,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:23:12,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:12,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:23:12,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:12,040 INFO L87 Difference]: Start difference. First operand 8897 states and 21286 transitions. Second operand 8 states. [2019-12-07 21:23:12,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:12,708 INFO L93 Difference]: Finished difference Result 10822 states and 25610 transitions. [2019-12-07 21:23:12,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:23:12,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 21:23:12,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:12,717 INFO L225 Difference]: With dead ends: 10822 [2019-12-07 21:23:12,717 INFO L226 Difference]: Without dead ends: 10822 [2019-12-07 21:23:12,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:23:12,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10822 states. [2019-12-07 21:23:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10822 to 10278. [2019-12-07 21:23:12,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10278 states. [2019-12-07 21:23:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10278 states to 10278 states and 24484 transitions. [2019-12-07 21:23:13,006 INFO L78 Accepts]: Start accepts. Automaton has 10278 states and 24484 transitions. Word has length 34 [2019-12-07 21:23:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:13,006 INFO L462 AbstractCegarLoop]: Abstraction has 10278 states and 24484 transitions. [2019-12-07 21:23:13,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:23:13,006 INFO L276 IsEmpty]: Start isEmpty. Operand 10278 states and 24484 transitions. [2019-12-07 21:23:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 21:23:13,013 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:13,013 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] [2019-12-07 21:23:13,013 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:13,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1451730190, now seen corresponding path program 1 times [2019-12-07 21:23:13,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:13,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870672416] [2019-12-07 21:23:13,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:13,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:13,075 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 21:23:13,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870672416] [2019-12-07 21:23:13,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:13,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:13,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879779057] [2019-12-07 21:23:13,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:13,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:13,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:13,077 INFO L87 Difference]: Start difference. First operand 10278 states and 24484 transitions. Second operand 4 states. [2019-12-07 21:23:13,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:13,091 INFO L93 Difference]: Finished difference Result 3430 states and 7653 transitions. [2019-12-07 21:23:13,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:13,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 21:23:13,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:13,095 INFO L225 Difference]: With dead ends: 3430 [2019-12-07 21:23:13,095 INFO L226 Difference]: Without dead ends: 3430 [2019-12-07 21:23:13,096 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 21:23:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2019-12-07 21:23:13,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3354. [2019-12-07 21:23:13,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3354 states. [2019-12-07 21:23:13,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 7512 transitions. [2019-12-07 21:23:13,137 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 7512 transitions. Word has length 48 [2019-12-07 21:23:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:13,137 INFO L462 AbstractCegarLoop]: Abstraction has 3354 states and 7512 transitions. [2019-12-07 21:23:13,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 7512 transitions. [2019-12-07 21:23:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 21:23:13,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:13,143 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:13,143 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1776556996, now seen corresponding path program 1 times [2019-12-07 21:23:13,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:13,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823033871] [2019-12-07 21:23:13,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:13,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:13,216 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 21:23:13,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823033871] [2019-12-07 21:23:13,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:13,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:13,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962540290] [2019-12-07 21:23:13,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:13,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:13,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:13,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:13,217 INFO L87 Difference]: Start difference. First operand 3354 states and 7512 transitions. Second operand 3 states. [2019-12-07 21:23:13,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:13,240 INFO L93 Difference]: Finished difference Result 3354 states and 7437 transitions. [2019-12-07 21:23:13,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:13,240 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-12-07 21:23:13,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:13,243 INFO L225 Difference]: With dead ends: 3354 [2019-12-07 21:23:13,243 INFO L226 Difference]: Without dead ends: 3354 [2019-12-07 21:23:13,243 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 21:23:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2019-12-07 21:23:13,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3354. [2019-12-07 21:23:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3354 states. [2019-12-07 21:23:13,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3354 states to 3354 states and 7437 transitions. [2019-12-07 21:23:13,275 INFO L78 Accepts]: Start accepts. Automaton has 3354 states and 7437 transitions. Word has length 93 [2019-12-07 21:23:13,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:13,275 INFO L462 AbstractCegarLoop]: Abstraction has 3354 states and 7437 transitions. [2019-12-07 21:23:13,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 3354 states and 7437 transitions. [2019-12-07 21:23:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:23:13,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:13,280 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:13,280 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1261390719, now seen corresponding path program 1 times [2019-12-07 21:23:13,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:13,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989804347] [2019-12-07 21:23:13,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:13,360 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 21:23:13,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989804347] [2019-12-07 21:23:13,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:13,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:13,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596719969] [2019-12-07 21:23:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:13,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:13,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:13,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:13,361 INFO L87 Difference]: Start difference. First operand 3354 states and 7437 transitions. Second operand 7 states. [2019-12-07 21:23:13,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:13,991 INFO L93 Difference]: Finished difference Result 4179 states and 9176 transitions. [2019-12-07 21:23:13,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 21:23:13,992 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-07 21:23:13,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:13,995 INFO L225 Difference]: With dead ends: 4179 [2019-12-07 21:23:13,995 INFO L226 Difference]: Without dead ends: 4179 [2019-12-07 21:23:13,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:23:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4179 states. [2019-12-07 21:23:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4179 to 3937. [2019-12-07 21:23:14,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-12-07 21:23:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 8683 transitions. [2019-12-07 21:23:14,029 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 8683 transitions. Word has length 94 [2019-12-07 21:23:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:14,029 INFO L462 AbstractCegarLoop]: Abstraction has 3937 states and 8683 transitions. [2019-12-07 21:23:14,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 8683 transitions. [2019-12-07 21:23:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:23:14,033 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:14,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:14,033 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash 870783717, now seen corresponding path program 2 times [2019-12-07 21:23:14,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:14,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252990070] [2019-12-07 21:23:14,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:14,117 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 21:23:14,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252990070] [2019-12-07 21:23:14,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:14,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:23:14,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941890134] [2019-12-07 21:23:14,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:23:14,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:14,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:23:14,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:14,118 INFO L87 Difference]: Start difference. First operand 3937 states and 8683 transitions. Second operand 6 states. [2019-12-07 21:23:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:14,653 INFO L93 Difference]: Finished difference Result 4383 states and 9590 transitions. [2019-12-07 21:23:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:23:14,653 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-07 21:23:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:14,657 INFO L225 Difference]: With dead ends: 4383 [2019-12-07 21:23:14,657 INFO L226 Difference]: Without dead ends: 4383 [2019-12-07 21:23:14,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-07 21:23:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 4063. [2019-12-07 21:23:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4063 states. [2019-12-07 21:23:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4063 states to 4063 states and 8938 transitions. [2019-12-07 21:23:14,691 INFO L78 Accepts]: Start accepts. Automaton has 4063 states and 8938 transitions. Word has length 94 [2019-12-07 21:23:14,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:14,691 INFO L462 AbstractCegarLoop]: Abstraction has 4063 states and 8938 transitions. [2019-12-07 21:23:14,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:23:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 4063 states and 8938 transitions. [2019-12-07 21:23:14,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:23:14,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:14,695 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:14,695 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:14,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:14,695 INFO L82 PathProgramCache]: Analyzing trace with hash -75332823, now seen corresponding path program 3 times [2019-12-07 21:23:14,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:14,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915904091] [2019-12-07 21:23:14,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:14,769 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 21:23:14,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915904091] [2019-12-07 21:23:14,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:14,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:14,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733626576] [2019-12-07 21:23:14,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:14,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:14,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:14,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:14,770 INFO L87 Difference]: Start difference. First operand 4063 states and 8938 transitions. Second operand 5 states. [2019-12-07 21:23:14,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:14,980 INFO L93 Difference]: Finished difference Result 4349 states and 9473 transitions. [2019-12-07 21:23:14,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:23:14,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-07 21:23:14,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:14,984 INFO L225 Difference]: With dead ends: 4349 [2019-12-07 21:23:14,984 INFO L226 Difference]: Without dead ends: 4349 [2019-12-07 21:23:14,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:14,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4349 states. [2019-12-07 21:23:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4349 to 4181. [2019-12-07 21:23:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4181 states. [2019-12-07 21:23:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4181 states to 4181 states and 9170 transitions. [2019-12-07 21:23:15,019 INFO L78 Accepts]: Start accepts. Automaton has 4181 states and 9170 transitions. Word has length 94 [2019-12-07 21:23:15,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:15,019 INFO L462 AbstractCegarLoop]: Abstraction has 4181 states and 9170 transitions. [2019-12-07 21:23:15,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 4181 states and 9170 transitions. [2019-12-07 21:23:15,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:23:15,024 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:15,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:15,024 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:15,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:15,024 INFO L82 PathProgramCache]: Analyzing trace with hash -391108213, now seen corresponding path program 4 times [2019-12-07 21:23:15,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:15,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498981909] [2019-12-07 21:23:15,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:15,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498981909] [2019-12-07 21:23:15,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:15,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 21:23:15,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082398086] [2019-12-07 21:23:15,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:23:15,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:15,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:23:15,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:23:15,168 INFO L87 Difference]: Start difference. First operand 4181 states and 9170 transitions. Second operand 10 states. [2019-12-07 21:23:16,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:16,104 INFO L93 Difference]: Finished difference Result 5958 states and 13002 transitions. [2019-12-07 21:23:16,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:23:16,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2019-12-07 21:23:16,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:16,108 INFO L225 Difference]: With dead ends: 5958 [2019-12-07 21:23:16,108 INFO L226 Difference]: Without dead ends: 5958 [2019-12-07 21:23:16,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:23:16,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2019-12-07 21:23:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 4402. [2019-12-07 21:23:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4402 states. [2019-12-07 21:23:16,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4402 states to 4402 states and 9717 transitions. [2019-12-07 21:23:16,152 INFO L78 Accepts]: Start accepts. Automaton has 4402 states and 9717 transitions. Word has length 94 [2019-12-07 21:23:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:16,152 INFO L462 AbstractCegarLoop]: Abstraction has 4402 states and 9717 transitions. [2019-12-07 21:23:16,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:23:16,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4402 states and 9717 transitions. [2019-12-07 21:23:16,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:23:16,157 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:16,157 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:16,157 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:16,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1966199233, now seen corresponding path program 5 times [2019-12-07 21:23:16,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:16,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375582772] [2019-12-07 21:23:16,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:16,236 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 21:23:16,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375582772] [2019-12-07 21:23:16,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:16,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:16,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17344536] [2019-12-07 21:23:16,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:16,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:16,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:16,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:16,237 INFO L87 Difference]: Start difference. First operand 4402 states and 9717 transitions. Second operand 7 states. [2019-12-07 21:23:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:16,818 INFO L93 Difference]: Finished difference Result 6324 states and 13798 transitions. [2019-12-07 21:23:16,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:23:16,818 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-07 21:23:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:16,823 INFO L225 Difference]: With dead ends: 6324 [2019-12-07 21:23:16,823 INFO L226 Difference]: Without dead ends: 6324 [2019-12-07 21:23:16,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:23:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2019-12-07 21:23:16,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 4537. [2019-12-07 21:23:16,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-12-07 21:23:16,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 10044 transitions. [2019-12-07 21:23:16,866 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 10044 transitions. Word has length 94 [2019-12-07 21:23:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:16,867 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 10044 transitions. [2019-12-07 21:23:16,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:16,867 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 10044 transitions. [2019-12-07 21:23:16,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:23:16,871 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:16,871 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:16,871 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:16,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:16,872 INFO L82 PathProgramCache]: Analyzing trace with hash -518893889, now seen corresponding path program 6 times [2019-12-07 21:23:16,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:16,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961497322] [2019-12-07 21:23:16,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:16,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:16,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961497322] [2019-12-07 21:23:16,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:16,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:16,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17267467] [2019-12-07 21:23:16,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:16,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:16,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:16,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:16,938 INFO L87 Difference]: Start difference. First operand 4537 states and 10044 transitions. Second operand 7 states. [2019-12-07 21:23:18,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:18,466 INFO L93 Difference]: Finished difference Result 6419 states and 14109 transitions. [2019-12-07 21:23:18,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:23:18,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2019-12-07 21:23:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:18,475 INFO L225 Difference]: With dead ends: 6419 [2019-12-07 21:23:18,475 INFO L226 Difference]: Without dead ends: 6419 [2019-12-07 21:23:18,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:23:18,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6419 states. [2019-12-07 21:23:18,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6419 to 4508. [2019-12-07 21:23:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2019-12-07 21:23:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 9986 transitions. [2019-12-07 21:23:18,539 INFO L78 Accepts]: Start accepts. Automaton has 4508 states and 9986 transitions. Word has length 94 [2019-12-07 21:23:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:18,540 INFO L462 AbstractCegarLoop]: Abstraction has 4508 states and 9986 transitions. [2019-12-07 21:23:18,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:18,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4508 states and 9986 transitions. [2019-12-07 21:23:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 21:23:18,545 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:18,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:18,546 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:18,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:18,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1405936377, now seen corresponding path program 7 times [2019-12-07 21:23:18,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:18,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758668736] [2019-12-07 21:23:18,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:18,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758668736] [2019-12-07 21:23:18,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:18,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:18,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760783982] [2019-12-07 21:23:18,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:18,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:18,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:18,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:18,657 INFO L87 Difference]: Start difference. First operand 4508 states and 9986 transitions. Second operand 4 states. [2019-12-07 21:23:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:18,694 INFO L93 Difference]: Finished difference Result 3632 states and 7937 transitions. [2019-12-07 21:23:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:18,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 21:23:18,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:18,697 INFO L225 Difference]: With dead ends: 3632 [2019-12-07 21:23:18,698 INFO L226 Difference]: Without dead ends: 3632 [2019-12-07 21:23:18,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 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 21:23:18,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2019-12-07 21:23:18,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3485. [2019-12-07 21:23:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3485 states. [2019-12-07 21:23:18,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3485 states to 3485 states and 7608 transitions. [2019-12-07 21:23:18,741 INFO L78 Accepts]: Start accepts. Automaton has 3485 states and 7608 transitions. Word has length 94 [2019-12-07 21:23:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:18,741 INFO L462 AbstractCegarLoop]: Abstraction has 3485 states and 7608 transitions. [2019-12-07 21:23:18,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:18,741 INFO L276 IsEmpty]: Start isEmpty. Operand 3485 states and 7608 transitions. [2019-12-07 21:23:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 21:23:18,746 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:18,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:18,746 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:18,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:18,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1088828116, now seen corresponding path program 1 times [2019-12-07 21:23:18,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:18,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071368139] [2019-12-07 21:23:18,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:18,910 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 21:23:18,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071368139] [2019-12-07 21:23:18,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:18,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:23:18,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713386129] [2019-12-07 21:23:18,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:23:18,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:18,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:23:18,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:23:18,912 INFO L87 Difference]: Start difference. First operand 3485 states and 7608 transitions. Second operand 9 states. [2019-12-07 21:23:19,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:19,849 INFO L93 Difference]: Finished difference Result 5364 states and 11556 transitions. [2019-12-07 21:23:19,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:23:19,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-07 21:23:19,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:19,853 INFO L225 Difference]: With dead ends: 5364 [2019-12-07 21:23:19,853 INFO L226 Difference]: Without dead ends: 5364 [2019-12-07 21:23:19,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-07 21:23:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5364 states. [2019-12-07 21:23:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5364 to 4485. [2019-12-07 21:23:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4485 states. [2019-12-07 21:23:19,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 9778 transitions. [2019-12-07 21:23:19,899 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 9778 transitions. Word has length 95 [2019-12-07 21:23:19,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:19,899 INFO L462 AbstractCegarLoop]: Abstraction has 4485 states and 9778 transitions. [2019-12-07 21:23:19,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:23:19,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 9778 transitions. [2019-12-07 21:23:19,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 21:23:19,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:19,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:19,904 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:19,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:19,904 INFO L82 PathProgramCache]: Analyzing trace with hash 143948102, now seen corresponding path program 2 times [2019-12-07 21:23:19,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:19,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924784944] [2019-12-07 21:23:19,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:20,003 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 21:23:20,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924784944] [2019-12-07 21:23:20,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:20,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:20,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457315194] [2019-12-07 21:23:20,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:23:20,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:20,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:23:20,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:20,004 INFO L87 Difference]: Start difference. First operand 4485 states and 9778 transitions. Second operand 8 states. [2019-12-07 21:23:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:20,630 INFO L93 Difference]: Finished difference Result 4920 states and 10633 transitions. [2019-12-07 21:23:20,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 21:23:20,631 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-12-07 21:23:20,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:20,634 INFO L225 Difference]: With dead ends: 4920 [2019-12-07 21:23:20,634 INFO L226 Difference]: Without dead ends: 4920 [2019-12-07 21:23:20,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:23:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2019-12-07 21:23:20,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 4499. [2019-12-07 21:23:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4499 states. [2019-12-07 21:23:20,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4499 states to 4499 states and 9790 transitions. [2019-12-07 21:23:20,672 INFO L78 Accepts]: Start accepts. Automaton has 4499 states and 9790 transitions. Word has length 95 [2019-12-07 21:23:20,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:20,672 INFO L462 AbstractCegarLoop]: Abstraction has 4499 states and 9790 transitions. [2019-12-07 21:23:20,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:23:20,672 INFO L276 IsEmpty]: Start isEmpty. Operand 4499 states and 9790 transitions. [2019-12-07 21:23:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 21:23:20,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:20,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:20,676 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1117943828, now seen corresponding path program 3 times [2019-12-07 21:23:20,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:20,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203287270] [2019-12-07 21:23:20,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:20,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:20,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203287270] [2019-12-07 21:23:20,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:20,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:23:20,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280027849] [2019-12-07 21:23:20,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:23:20,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:20,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:23:20,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:23:20,780 INFO L87 Difference]: Start difference. First operand 4499 states and 9790 transitions. Second operand 9 states. [2019-12-07 21:23:21,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:21,271 INFO L93 Difference]: Finished difference Result 5574 states and 12027 transitions. [2019-12-07 21:23:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 21:23:21,272 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-12-07 21:23:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:21,275 INFO L225 Difference]: With dead ends: 5574 [2019-12-07 21:23:21,275 INFO L226 Difference]: Without dead ends: 5574 [2019-12-07 21:23:21,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:23:21,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5574 states. [2019-12-07 21:23:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5574 to 4865. [2019-12-07 21:23:21,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4865 states. [2019-12-07 21:23:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4865 states to 4865 states and 10605 transitions. [2019-12-07 21:23:21,318 INFO L78 Accepts]: Start accepts. Automaton has 4865 states and 10605 transitions. Word has length 95 [2019-12-07 21:23:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:21,318 INFO L462 AbstractCegarLoop]: Abstraction has 4865 states and 10605 transitions. [2019-12-07 21:23:21,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:23:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4865 states and 10605 transitions. [2019-12-07 21:23:21,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 21:23:21,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:21,323 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:21,323 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1601932448, now seen corresponding path program 4 times [2019-12-07 21:23:21,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:21,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527052553] [2019-12-07 21:23:21,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:21,433 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 21:23:21,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527052553] [2019-12-07 21:23:21,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:21,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 21:23:21,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171641715] [2019-12-07 21:23:21,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:23:21,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:21,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:23:21,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:23:21,434 INFO L87 Difference]: Start difference. First operand 4865 states and 10605 transitions. Second operand 10 states. [2019-12-07 21:23:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:22,613 INFO L93 Difference]: Finished difference Result 5676 states and 12234 transitions. [2019-12-07 21:23:22,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:23:22,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-07 21:23:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:22,620 INFO L225 Difference]: With dead ends: 5676 [2019-12-07 21:23:22,621 INFO L226 Difference]: Without dead ends: 5676 [2019-12-07 21:23:22,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:23:22,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5676 states. [2019-12-07 21:23:22,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5676 to 5189. [2019-12-07 21:23:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5189 states. [2019-12-07 21:23:22,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 11301 transitions. [2019-12-07 21:23:22,678 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 11301 transitions. Word has length 95 [2019-12-07 21:23:22,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:22,678 INFO L462 AbstractCegarLoop]: Abstraction has 5189 states and 11301 transitions. [2019-12-07 21:23:22,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:23:22,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 11301 transitions. [2019-12-07 21:23:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 21:23:22,684 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:22,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:22,684 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:22,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:22,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2076598612, now seen corresponding path program 5 times [2019-12-07 21:23:22,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:22,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372450446] [2019-12-07 21:23:22,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:22,886 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 21:23:22,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372450446] [2019-12-07 21:23:22,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:22,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 21:23:22,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721830865] [2019-12-07 21:23:22,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 21:23:22,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:22,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 21:23:22,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:23:22,887 INFO L87 Difference]: Start difference. First operand 5189 states and 11301 transitions. Second operand 13 states. [2019-12-07 21:23:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:25,230 INFO L93 Difference]: Finished difference Result 9454 states and 20591 transitions. [2019-12-07 21:23:25,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 21:23:25,231 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-07 21:23:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:25,240 INFO L225 Difference]: With dead ends: 9454 [2019-12-07 21:23:25,240 INFO L226 Difference]: Without dead ends: 9454 [2019-12-07 21:23:25,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 418 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=293, Invalid=1347, Unknown=0, NotChecked=0, Total=1640 [2019-12-07 21:23:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9454 states. [2019-12-07 21:23:25,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9454 to 5512. [2019-12-07 21:23:25,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5512 states. [2019-12-07 21:23:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5512 states to 5512 states and 12083 transitions. [2019-12-07 21:23:25,313 INFO L78 Accepts]: Start accepts. Automaton has 5512 states and 12083 transitions. Word has length 95 [2019-12-07 21:23:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:25,313 INFO L462 AbstractCegarLoop]: Abstraction has 5512 states and 12083 transitions. [2019-12-07 21:23:25,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 21:23:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 5512 states and 12083 transitions. [2019-12-07 21:23:25,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 21:23:25,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:25,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:25,317 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:25,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1825327703, now seen corresponding path program 1 times [2019-12-07 21:23:25,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:25,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326570546] [2019-12-07 21:23:25,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:25,390 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 21:23:25,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326570546] [2019-12-07 21:23:25,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:25,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:25,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118756239] [2019-12-07 21:23:25,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:23:25,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:25,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:23:25,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:25,391 INFO L87 Difference]: Start difference. First operand 5512 states and 12083 transitions. Second operand 6 states. [2019-12-07 21:23:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:25,473 INFO L93 Difference]: Finished difference Result 8091 states and 17599 transitions. [2019-12-07 21:23:25,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:23:25,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-07 21:23:25,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:25,475 INFO L225 Difference]: With dead ends: 8091 [2019-12-07 21:23:25,475 INFO L226 Difference]: Without dead ends: 2639 [2019-12-07 21:23:25,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:23:25,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2639 states. [2019-12-07 21:23:25,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2639 to 2603. [2019-12-07 21:23:25,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2603 states. [2019-12-07 21:23:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2603 states to 2603 states and 5551 transitions. [2019-12-07 21:23:25,495 INFO L78 Accepts]: Start accepts. Automaton has 2603 states and 5551 transitions. Word has length 96 [2019-12-07 21:23:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:25,495 INFO L462 AbstractCegarLoop]: Abstraction has 2603 states and 5551 transitions. [2019-12-07 21:23:25,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:23:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 2603 states and 5551 transitions. [2019-12-07 21:23:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 21:23:25,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:25,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:25,497 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:25,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:25,497 INFO L82 PathProgramCache]: Analyzing trace with hash -917542930, now seen corresponding path program 1 times [2019-12-07 21:23:25,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:25,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578339310] [2019-12-07 21:23:25,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:25,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:25,693 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 21:23:25,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578339310] [2019-12-07 21:23:25,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:25,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 21:23:25,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767353545] [2019-12-07 21:23:25,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:23:25,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:25,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:23:25,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:23:25,695 INFO L87 Difference]: Start difference. First operand 2603 states and 5551 transitions. Second operand 12 states. [2019-12-07 21:23:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:27,270 INFO L93 Difference]: Finished difference Result 5899 states and 12653 transitions. [2019-12-07 21:23:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 21:23:27,270 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-07 21:23:27,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:27,274 INFO L225 Difference]: With dead ends: 5899 [2019-12-07 21:23:27,274 INFO L226 Difference]: Without dead ends: 5899 [2019-12-07 21:23:27,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-07 21:23:27,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5899 states. [2019-12-07 21:23:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5899 to 3436. [2019-12-07 21:23:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2019-12-07 21:23:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 7432 transitions. [2019-12-07 21:23:27,313 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 7432 transitions. Word has length 96 [2019-12-07 21:23:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:27,314 INFO L462 AbstractCegarLoop]: Abstraction has 3436 states and 7432 transitions. [2019-12-07 21:23:27,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:23:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 7432 transitions. [2019-12-07 21:23:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 21:23:27,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:27,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:27,316 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:27,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1283222994, now seen corresponding path program 1 times [2019-12-07 21:23:27,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:27,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978536608] [2019-12-07 21:23:27,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:27,513 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 21:23:27,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978536608] [2019-12-07 21:23:27,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:27,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 21:23:27,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514827953] [2019-12-07 21:23:27,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 21:23:27,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:27,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 21:23:27,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:23:27,514 INFO L87 Difference]: Start difference. First operand 3436 states and 7432 transitions. Second operand 11 states. [2019-12-07 21:23:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:29,539 INFO L93 Difference]: Finished difference Result 6243 states and 13397 transitions. [2019-12-07 21:23:29,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-07 21:23:29,540 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-07 21:23:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:29,544 INFO L225 Difference]: With dead ends: 6243 [2019-12-07 21:23:29,544 INFO L226 Difference]: Without dead ends: 6243 [2019-12-07 21:23:29,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 7 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=779, Unknown=0, NotChecked=0, Total=992 [2019-12-07 21:23:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6243 states. [2019-12-07 21:23:29,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6243 to 3915. [2019-12-07 21:23:29,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3915 states. [2019-12-07 21:23:29,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3915 states to 3915 states and 8525 transitions. [2019-12-07 21:23:29,587 INFO L78 Accepts]: Start accepts. Automaton has 3915 states and 8525 transitions. Word has length 96 [2019-12-07 21:23:29,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:29,587 INFO L462 AbstractCegarLoop]: Abstraction has 3915 states and 8525 transitions. [2019-12-07 21:23:29,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 21:23:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3915 states and 8525 transitions. [2019-12-07 21:23:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 21:23:29,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:29,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:29,589 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:29,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:29,590 INFO L82 PathProgramCache]: Analyzing trace with hash 822787398, now seen corresponding path program 1 times [2019-12-07 21:23:29,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:29,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075523563] [2019-12-07 21:23:29,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:29,743 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 21:23:29,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075523563] [2019-12-07 21:23:29,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:29,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 21:23:29,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458945925] [2019-12-07 21:23:29,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:23:29,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:29,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:23:29,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:23:29,745 INFO L87 Difference]: Start difference. First operand 3915 states and 8525 transitions. Second operand 12 states. [2019-12-07 21:23:30,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:30,262 INFO L93 Difference]: Finished difference Result 8634 states and 18845 transitions. [2019-12-07 21:23:30,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 21:23:30,262 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-07 21:23:30,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:30,266 INFO L225 Difference]: With dead ends: 8634 [2019-12-07 21:23:30,266 INFO L226 Difference]: Without dead ends: 5673 [2019-12-07 21:23:30,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-07 21:23:30,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5673 states. [2019-12-07 21:23:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5673 to 3907. [2019-12-07 21:23:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3907 states. [2019-12-07 21:23:30,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3907 states to 3907 states and 8472 transitions. [2019-12-07 21:23:30,303 INFO L78 Accepts]: Start accepts. Automaton has 3907 states and 8472 transitions. Word has length 97 [2019-12-07 21:23:30,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:30,303 INFO L462 AbstractCegarLoop]: Abstraction has 3907 states and 8472 transitions. [2019-12-07 21:23:30,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:23:30,303 INFO L276 IsEmpty]: Start isEmpty. Operand 3907 states and 8472 transitions. [2019-12-07 21:23:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 21:23:30,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:30,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:30,305 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:30,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:30,306 INFO L82 PathProgramCache]: Analyzing trace with hash -460798055, now seen corresponding path program 1 times [2019-12-07 21:23:30,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:30,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525122415] [2019-12-07 21:23:30,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:30,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:30,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:30,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525122415] [2019-12-07 21:23:30,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:30,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:30,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560825466] [2019-12-07 21:23:30,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:30,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:30,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:30,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:30,341 INFO L87 Difference]: Start difference. First operand 3907 states and 8472 transitions. Second operand 3 states. [2019-12-07 21:23:30,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:30,368 INFO L93 Difference]: Finished difference Result 3906 states and 8470 transitions. [2019-12-07 21:23:30,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:30,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-12-07 21:23:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:30,371 INFO L225 Difference]: With dead ends: 3906 [2019-12-07 21:23:30,371 INFO L226 Difference]: Without dead ends: 3906 [2019-12-07 21:23:30,372 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 21:23:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3906 states. [2019-12-07 21:23:30,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3906 to 3377. [2019-12-07 21:23:30,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3377 states. [2019-12-07 21:23:30,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3377 states to 3377 states and 7334 transitions. [2019-12-07 21:23:30,400 INFO L78 Accepts]: Start accepts. Automaton has 3377 states and 7334 transitions. Word has length 97 [2019-12-07 21:23:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:30,400 INFO L462 AbstractCegarLoop]: Abstraction has 3377 states and 7334 transitions. [2019-12-07 21:23:30,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3377 states and 7334 transitions. [2019-12-07 21:23:30,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 21:23:30,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:30,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:30,403 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1298850401, now seen corresponding path program 1 times [2019-12-07 21:23:30,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:30,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754628110] [2019-12-07 21:23:30,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:30,450 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 21:23:30,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754628110] [2019-12-07 21:23:30,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:30,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:30,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018310109] [2019-12-07 21:23:30,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:30,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:30,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:30,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:30,451 INFO L87 Difference]: Start difference. First operand 3377 states and 7334 transitions. Second operand 5 states. [2019-12-07 21:23:30,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:30,643 INFO L93 Difference]: Finished difference Result 3902 states and 8399 transitions. [2019-12-07 21:23:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:23:30,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-07 21:23:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:30,646 INFO L225 Difference]: With dead ends: 3902 [2019-12-07 21:23:30,646 INFO L226 Difference]: Without dead ends: 3902 [2019-12-07 21:23:30,646 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3902 states. [2019-12-07 21:23:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3902 to 3255. [2019-12-07 21:23:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2019-12-07 21:23:30,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 7008 transitions. [2019-12-07 21:23:30,673 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 7008 transitions. Word has length 97 [2019-12-07 21:23:30,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:30,674 INFO L462 AbstractCegarLoop]: Abstraction has 3255 states and 7008 transitions. [2019-12-07 21:23:30,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 7008 transitions. [2019-12-07 21:23:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 21:23:30,675 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:30,676 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:30,676 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash 171429113, now seen corresponding path program 1 times [2019-12-07 21:23:30,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:30,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196351999] [2019-12-07 21:23:30,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:30,907 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 21:23:30,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196351999] [2019-12-07 21:23:30,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:30,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 21:23:30,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423219301] [2019-12-07 21:23:30,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 21:23:30,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:30,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 21:23:30,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-12-07 21:23:30,908 INFO L87 Difference]: Start difference. First operand 3255 states and 7008 transitions. Second operand 17 states. [2019-12-07 21:23:31,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:31,758 INFO L93 Difference]: Finished difference Result 5892 states and 12607 transitions. [2019-12-07 21:23:31,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 21:23:31,758 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-12-07 21:23:31,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:31,762 INFO L225 Difference]: With dead ends: 5892 [2019-12-07 21:23:31,762 INFO L226 Difference]: Without dead ends: 5794 [2019-12-07 21:23:31,762 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=645, Unknown=0, NotChecked=0, Total=756 [2019-12-07 21:23:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2019-12-07 21:23:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4351. [2019-12-07 21:23:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4351 states. [2019-12-07 21:23:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 9402 transitions. [2019-12-07 21:23:31,803 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 9402 transitions. Word has length 98 [2019-12-07 21:23:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:31,803 INFO L462 AbstractCegarLoop]: Abstraction has 4351 states and 9402 transitions. [2019-12-07 21:23:31,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 21:23:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 9402 transitions. [2019-12-07 21:23:31,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 21:23:31,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:31,806 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:31,806 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:31,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:31,806 INFO L82 PathProgramCache]: Analyzing trace with hash -974856596, now seen corresponding path program 1 times [2019-12-07 21:23:31,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:31,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026103976] [2019-12-07 21:23:31,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:31,829 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 21:23:31,829 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026103976] [2019-12-07 21:23:31,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:31,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:31,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428252529] [2019-12-07 21:23:31,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:31,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:31,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:31,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:31,830 INFO L87 Difference]: Start difference. First operand 4351 states and 9402 transitions. Second operand 3 states. [2019-12-07 21:23:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:31,880 INFO L93 Difference]: Finished difference Result 5217 states and 10770 transitions. [2019-12-07 21:23:31,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:31,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-07 21:23:31,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:31,884 INFO L225 Difference]: With dead ends: 5217 [2019-12-07 21:23:31,884 INFO L226 Difference]: Without dead ends: 5217 [2019-12-07 21:23:31,884 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 21:23:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5217 states. [2019-12-07 21:23:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5217 to 4141. [2019-12-07 21:23:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4141 states. [2019-12-07 21:23:31,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4141 states to 4141 states and 8741 transitions. [2019-12-07 21:23:31,921 INFO L78 Accepts]: Start accepts. Automaton has 4141 states and 8741 transitions. Word has length 98 [2019-12-07 21:23:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:31,921 INFO L462 AbstractCegarLoop]: Abstraction has 4141 states and 8741 transitions. [2019-12-07 21:23:31,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 4141 states and 8741 transitions. [2019-12-07 21:23:31,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 21:23:31,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:31,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:31,923 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:31,924 INFO L82 PathProgramCache]: Analyzing trace with hash 992928948, now seen corresponding path program 1 times [2019-12-07 21:23:31,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:31,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650512357] [2019-12-07 21:23:31,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:32,084 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 21:23:32,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650512357] [2019-12-07 21:23:32,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:32,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 21:23:32,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358375062] [2019-12-07 21:23:32,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 21:23:32,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:32,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 21:23:32,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:23:32,085 INFO L87 Difference]: Start difference. First operand 4141 states and 8741 transitions. Second operand 14 states. [2019-12-07 21:23:32,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:32,527 INFO L93 Difference]: Finished difference Result 6179 states and 12951 transitions. [2019-12-07 21:23:32,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 21:23:32,527 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-07 21:23:32,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:32,532 INFO L225 Difference]: With dead ends: 6179 [2019-12-07 21:23:32,532 INFO L226 Difference]: Without dead ends: 6072 [2019-12-07 21:23:32,532 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2019-12-07 21:23:32,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2019-12-07 21:23:32,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 5254. [2019-12-07 21:23:32,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5254 states. [2019-12-07 21:23:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 11290 transitions. [2019-12-07 21:23:32,581 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 11290 transitions. Word has length 98 [2019-12-07 21:23:32,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:32,582 INFO L462 AbstractCegarLoop]: Abstraction has 5254 states and 11290 transitions. [2019-12-07 21:23:32,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 21:23:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 11290 transitions. [2019-12-07 21:23:32,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 21:23:32,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:32,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:32,585 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:32,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:32,585 INFO L82 PathProgramCache]: Analyzing trace with hash 741591247, now seen corresponding path program 2 times [2019-12-07 21:23:32,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:32,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542761824] [2019-12-07 21:23:32,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:32,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542761824] [2019-12-07 21:23:32,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:32,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 21:23:32,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539792051] [2019-12-07 21:23:32,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 21:23:32,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 21:23:32,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:23:32,877 INFO L87 Difference]: Start difference. First operand 5254 states and 11290 transitions. Second operand 14 states. [2019-12-07 21:23:34,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:34,836 INFO L93 Difference]: Finished difference Result 8229 states and 17454 transitions. [2019-12-07 21:23:34,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 21:23:34,837 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-07 21:23:34,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:34,843 INFO L225 Difference]: With dead ends: 8229 [2019-12-07 21:23:34,843 INFO L226 Difference]: Without dead ends: 8229 [2019-12-07 21:23:34,843 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2019-12-07 21:23:34,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2019-12-07 21:23:34,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 6225. [2019-12-07 21:23:34,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6225 states. [2019-12-07 21:23:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6225 states to 6225 states and 13350 transitions. [2019-12-07 21:23:34,906 INFO L78 Accepts]: Start accepts. Automaton has 6225 states and 13350 transitions. Word has length 98 [2019-12-07 21:23:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:34,906 INFO L462 AbstractCegarLoop]: Abstraction has 6225 states and 13350 transitions. [2019-12-07 21:23:34,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 21:23:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6225 states and 13350 transitions. [2019-12-07 21:23:34,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 21:23:34,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:34,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:23:34,911 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:23:34,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:34,911 INFO L82 PathProgramCache]: Analyzing trace with hash 402744400, now seen corresponding path program 2 times [2019-12-07 21:23:34,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:34,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836644709] [2019-12-07 21:23:34,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:23:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:23:34,997 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:23:34,997 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:23:35,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19|) |v_ULTIMATE.start_main_~#t1645~0.offset_15| 0)) |v_#memory_int_9|) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff1_thd1~0_311 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1645~0.base_19| 4)) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1645~0.base_19|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 |v_ULTIMATE.start_main_~#t1645~0.offset_15|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19| 1) |v_#valid_46|) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1645~0.base=|v_ULTIMATE.start_main_~#t1645~0.base_19|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_~#t1645~0.offset=|v_ULTIMATE.start_main_~#t1645~0.offset_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_17|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1645~0.base, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t1645~0.offset, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t1646~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_~#t1646~0.base, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:23:35,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1646~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1646~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1646~0.base_11| 4)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11|) |v_ULTIMATE.start_main_~#t1646~0.offset_10| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t1646~0.offset, #length, ULTIMATE.start_main_~#t1646~0.base] because there is no mapped edge [2019-12-07 21:23:35,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In846591479 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In846591479 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out846591479| |P0Thread1of1ForFork0_#t~ite3_Out846591479|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In846591479 |P0Thread1of1ForFork0_#t~ite3_Out846591479|) .cse2) (and (= ~y~0_In846591479 |P0Thread1of1ForFork0_#t~ite3_Out846591479|) (or .cse1 .cse0) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In846591479, ~y$w_buff1~0=~y$w_buff1~0_In846591479, ~y~0=~y~0_In846591479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846591479} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In846591479, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out846591479|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out846591479|, ~y$w_buff1~0=~y$w_buff1~0_In846591479, ~y~0=~y~0_In846591479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846591479} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 21:23:35,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1130201730 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1130201730 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1130201730| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1130201730| ~y$w_buff0_used~0_In1130201730)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1130201730, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1130201730} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1130201730|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1130201730, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1130201730} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 21:23:35,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-752158 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-752158 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-752158 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-752158 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-752158|)) (and (= ~y$w_buff1_used~0_In-752158 |P0Thread1of1ForFork0_#t~ite6_Out-752158|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-752158, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-752158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752158} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-752158|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-752158, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-752158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 21:23:35,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1052638247 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1052638247 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1052638247|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In1052638247 |P0Thread1of1ForFork0_#t~ite7_Out1052638247|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1052638247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1052638247} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1052638247, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1052638247|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1052638247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 21:23:35,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-71703666 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-71703666 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-71703666 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-71703666 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-71703666 |P0Thread1of1ForFork0_#t~ite8_Out-71703666|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-71703666|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-71703666, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-71703666, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-71703666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71703666} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-71703666, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-71703666, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-71703666|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-71703666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71703666} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 21:23:35,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1834433298 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1834433298 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite9_Out1834433298| |P0Thread1of1ForFork0_#t~ite10_Out1834433298|))) (or (and (= ~y~0_In1834433298 |P0Thread1of1ForFork0_#t~ite9_Out1834433298|) .cse0 (or .cse1 .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out1834433298| ~y$w_buff1~0_In1834433298) (not .cse1) (not .cse2) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1834433298, ~y$w_buff1~0=~y$w_buff1~0_In1834433298, ~y~0=~y~0_In1834433298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1834433298} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out1834433298|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1834433298, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1834433298|, ~y$w_buff1~0=~y$w_buff1~0_In1834433298, ~y~0=~y~0_In1834433298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1834433298} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 21:23:35,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_217 256) 0)) (not (= (mod v_~y$w_buff0_used~0_458 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_P1Thread1of1ForFork1_~arg.base_29 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_~y$w_buff0_used~0_458 1) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31)) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_29) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_29, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_29, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:23:35,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1894124585 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1894124585 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In1894124585 |P1Thread1of1ForFork1_#t~ite17_Out1894124585|)) (and (= ~y$w_buff1~0_In1894124585 |P1Thread1of1ForFork1_#t~ite17_Out1894124585|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1894124585, ~y$w_buff1~0=~y$w_buff1~0_In1894124585, ~y$w_buff0~0=~y$w_buff0~0_In1894124585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1894124585} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1894124585, ~y$w_buff1~0=~y$w_buff1~0_In1894124585, ~y$w_buff0~0=~y$w_buff0~0_In1894124585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1894124585, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1894124585|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 21:23:35,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_8|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_8|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_11|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 21:23:35,006 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_12|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_8|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 21:23:35,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1665253792 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1665253792| ~y$mem_tmp~0_In-1665253792) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1665253792| ~y~0_In-1665253792) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1665253792, ~y$flush_delayed~0=~y$flush_delayed~0_In-1665253792, ~y~0=~y~0_In-1665253792} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1665253792, ~y$flush_delayed~0=~y$flush_delayed~0_In-1665253792, ~y~0=~y~0_In-1665253792, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1665253792|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 21:23:35,008 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1105133151 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite41_Out-1105133151| |P1Thread1of1ForFork1_#t~ite40_Out-1105133151|)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1105133151 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y$w_buff1~0_In-1105133151 |P1Thread1of1ForFork1_#t~ite40_Out-1105133151|)) (and (not .cse1) .cse2 (not .cse0) (= |P1Thread1of1ForFork1_#t~ite40_Out-1105133151| ~y$w_buff0~0_In-1105133151)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1105133151, ~y$w_buff1~0=~y$w_buff1~0_In-1105133151, ~y$w_buff0~0=~y$w_buff0~0_In-1105133151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1105133151} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1105133151, ~y$w_buff1~0=~y$w_buff1~0_In-1105133151, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out-1105133151|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out-1105133151|, ~y$w_buff0~0=~y$w_buff0~0_In-1105133151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1105133151} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 21:23:35,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_9|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_9|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_12|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 21:23:35,011 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In40224403 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out40224403| ~y~0_In40224403) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite60_Out40224403| ~y$mem_tmp~0_In40224403) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In40224403, ~y$flush_delayed~0=~y$flush_delayed~0_In40224403, ~y~0=~y~0_In40224403} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In40224403, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out40224403|, ~y$flush_delayed~0=~y$flush_delayed~0_In40224403, ~y~0=~y~0_In40224403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 21:23:35,012 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1392644148 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1392644148 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite63_Out-1392644148| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite63_Out-1392644148| ~y$w_buff0_used~0_In-1392644148) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1392644148, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1392644148} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out-1392644148|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1392644148, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1392644148} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-07 21:23:35,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1389724499 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1389724499 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_Out-1389724499| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite11_Out-1389724499| ~y$w_buff0_used~0_In-1389724499) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1389724499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1389724499} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1389724499|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1389724499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1389724499} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 21:23:35,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1191343658 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1191343658 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1191343658 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1191343658 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite64_Out1191343658|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1191343658 |P1Thread1of1ForFork1_#t~ite64_Out1191343658|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1191343658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1191343658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1191343658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191343658} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1191343658, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out1191343658|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1191343658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1191343658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191343658} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-07 21:23:35,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1043933349 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-1043933349 ~y$r_buff0_thd2~0_Out-1043933349)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1043933349 256)))) (or (and (= 0 ~y$r_buff0_thd2~0_Out-1043933349) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043933349, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1043933349} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043933349, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1043933349, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out-1043933349|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-07 21:23:35,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In8334439 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In8334439 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In8334439 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In8334439 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite66_Out8334439| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite66_Out8334439| ~y$r_buff1_thd2~0_In8334439) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In8334439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In8334439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In8334439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In8334439} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In8334439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In8334439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In8334439, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out8334439|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In8334439} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-07 21:23:35,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 21:23:35,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-483834640 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-483834640 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-483834640 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-483834640 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-483834640| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-483834640 |P0Thread1of1ForFork0_#t~ite12_Out-483834640|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-483834640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-483834640, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-483834640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-483834640} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-483834640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-483834640, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-483834640, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-483834640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-483834640} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 21:23:35,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-52130683 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-52130683 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite13_Out-52130683| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite13_Out-52130683| ~y$r_buff0_thd1~0_In-52130683) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-52130683, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52130683} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-52130683, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52130683, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-52130683|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 21:23:35,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-975777097 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-975777097 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-975777097 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-975777097 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-975777097 |P0Thread1of1ForFork0_#t~ite14_Out-975777097|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite14_Out-975777097|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975777097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-975777097, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-975777097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975777097} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975777097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-975777097, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-975777097, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-975777097|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975777097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 21:23:35,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_26|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_25|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 21:23:35,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_26) 1 0) 0) 0 1) v_~main$tmp_guard0~0_9)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:23:35,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-641999572 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-641999572 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite69_Out-641999572| ~y$w_buff1~0_In-641999572) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite69_Out-641999572| ~y~0_In-641999572)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-641999572, ~y~0=~y~0_In-641999572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641999572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641999572} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-641999572, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-641999572|, ~y~0=~y~0_In-641999572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641999572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641999572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 21:23:35,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-07 21:23:35,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1703659052 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1703659052 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite71_Out1703659052|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1703659052 |ULTIMATE.start_main_#t~ite71_Out1703659052|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1703659052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1703659052} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1703659052|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1703659052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1703659052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-07 21:23:35,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1884766457 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1884766457 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1884766457 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1884766457 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite72_Out-1884766457|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1884766457 |ULTIMATE.start_main_#t~ite72_Out-1884766457|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1884766457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1884766457, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1884766457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884766457} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1884766457|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1884766457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1884766457, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1884766457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884766457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 21:23:35,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1735150132 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1735150132 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite73_Out1735150132| ~y$r_buff0_thd0~0_In1735150132) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite73_Out1735150132| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1735150132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735150132} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1735150132|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1735150132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735150132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 21:23:35,016 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In26193510 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In26193510 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In26193510 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In26193510 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In26193510 |ULTIMATE.start_main_#t~ite74_Out26193510|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite74_Out26193510|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In26193510, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26193510, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In26193510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In26193510} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out26193510|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In26193510, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26193510, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In26193510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In26193510} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 21:23:35,020 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In2121821291 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In2121821291 |ULTIMATE.start_main_#t~ite97_Out2121821291|)) (and (= |ULTIMATE.start_main_#t~ite97_Out2121821291| ~y~0_In2121821291) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In2121821291, ~y$flush_delayed~0=~y$flush_delayed~0_In2121821291, ~y~0=~y~0_In2121821291} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In2121821291, ~y$flush_delayed~0=~y$flush_delayed~0_In2121821291, ~y~0=~y~0_In2121821291, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out2121821291|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 21:23:35,021 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 21:23:35,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:23:35 BasicIcfg [2019-12-07 21:23:35,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:23:35,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:23:35,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:23:35,089 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:23:35,089 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:22:47" (3/4) ... [2019-12-07 21:23:35,091 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:23:35,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1393] [1393] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_754) (= 0 v_~y$w_buff0~0_354) (= v_~y$r_buff1_thd0~0_369 0) (= 0 v_~__unbuffered_cnt~0_79) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_364 0) (= |v_#NULL.offset_7| 0) (= 0 v_~x~0_107) (= v_~y$w_buff1_used~0_638 0) (= v_~y$r_buff0_thd0~0_393 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_1402 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1645~0.base_19|) |v_ULTIMATE.start_main_~#t1645~0.offset_15| 0)) |v_#memory_int_9|) (= v_~main$tmp_guard0~0_23 0) (= v_~y$r_buff1_thd1~0_311 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1645~0.base_19| 4)) (= v_~main$tmp_guard1~0_29 0) (= v_~weak$$choice2~0_312 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1645~0.base_19|) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 |v_#NULL.base_7|) (= v_~y$w_buff1~0_285 0) (= v_~y$mem_tmp~0_229 0) (= v_~__unbuffered_p1_EBX~0_24 0) (= 0 |v_ULTIMATE.start_main_~#t1645~0.offset_15|) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store .cse0 |v_ULTIMATE.start_main_~#t1645~0.base_19| 1) |v_#valid_46|) (= v_~y$flush_delayed~0_258 0) (= 0 v_~weak$$choice0~0_214) (< 0 |v_#StackHeapBarrier_13|) (= 0 v_~y$r_buff1_thd2~0_431) (= v_~y$r_buff0_thd1~0_259 0) (= 0 v_~__unbuffered_p0_EAX~0_38))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_83|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_50|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_57|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_25|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_33|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_55|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_59|, ~y$mem_tmp~0=v_~y$mem_tmp~0_229, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_38, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_31|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ULTIMATE.start_main_~#t1645~0.base=|v_ULTIMATE.start_main_~#t1645~0.base_19|, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_25|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_259, ~y$flush_delayed~0=v_~y$flush_delayed~0_258, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_21|, ULTIMATE.start_main_~#t1645~0.offset=|v_ULTIMATE.start_main_~#t1645~0.offset_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_44|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_25|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_56|, ~weak$$choice0~0=v_~weak$$choice0~0_214, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_37|, ~y$w_buff1~0=v_~y$w_buff1~0_285, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_54|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_754, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_369, ~x~0=v_~x~0_107, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_83|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1402, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_33|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_49|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_17|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_45|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_95|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_60|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_311, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_31|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_29|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_27|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~y$w_buff0~0=v_~y$w_buff0~0_354, ~y~0=v_~y~0_364, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_24, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_23|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_49|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_52|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_431, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_38|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_62|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_393, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_312, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1645~0.base, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_~#t1645~0.offset, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t1646~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_~#t1646~0.base, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:23:35,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1352] [1352] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1646~0.offset_10|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1646~0.base_11|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1646~0.base_11| 4)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1646~0.base_11|) |v_ULTIMATE.start_main_~#t1646~0.offset_10| 1)) |v_#memory_int_5|) (not (= 0 |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11|)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1646~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#t1646~0.offset=|v_ULTIMATE.start_main_~#t1646~0.offset_10|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1646~0.base=|v_ULTIMATE.start_main_~#t1646~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, ULTIMATE.start_main_~#t1646~0.offset, #length, ULTIMATE.start_main_~#t1646~0.base] because there is no mapped edge [2019-12-07 21:23:35,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In846591479 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In846591479 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out846591479| |P0Thread1of1ForFork0_#t~ite3_Out846591479|))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In846591479 |P0Thread1of1ForFork0_#t~ite3_Out846591479|) .cse2) (and (= ~y~0_In846591479 |P0Thread1of1ForFork0_#t~ite3_Out846591479|) (or .cse1 .cse0) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In846591479, ~y$w_buff1~0=~y$w_buff1~0_In846591479, ~y~0=~y~0_In846591479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846591479} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In846591479, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out846591479|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out846591479|, ~y$w_buff1~0=~y$w_buff1~0_In846591479, ~y~0=~y~0_In846591479, ~y$w_buff1_used~0=~y$w_buff1_used~0_In846591479} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-07 21:23:35,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1130201730 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1130201730 256)))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out1130201730| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out1130201730| ~y$w_buff0_used~0_In1130201730)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1130201730, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1130201730} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1130201730|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1130201730, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1130201730} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 21:23:35,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-752158 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-752158 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-752158 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-752158 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-752158|)) (and (= ~y$w_buff1_used~0_In-752158 |P0Thread1of1ForFork0_#t~ite6_Out-752158|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-752158, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-752158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752158} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-752158|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-752158, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-752158, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-752158, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-752158} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 21:23:35,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1052638247 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In1052638247 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite7_Out1052638247|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In1052638247 |P0Thread1of1ForFork0_#t~ite7_Out1052638247|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1052638247, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1052638247} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1052638247, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1052638247|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1052638247} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-07 21:23:35,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-71703666 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-71703666 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-71703666 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-71703666 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-71703666 |P0Thread1of1ForFork0_#t~ite8_Out-71703666|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-71703666|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-71703666, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-71703666, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-71703666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71703666} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-71703666, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-71703666, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-71703666|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-71703666, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-71703666} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 21:23:35,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In1834433298 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1834433298 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite9_Out1834433298| |P0Thread1of1ForFork0_#t~ite10_Out1834433298|))) (or (and (= ~y~0_In1834433298 |P0Thread1of1ForFork0_#t~ite9_Out1834433298|) .cse0 (or .cse1 .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out1834433298| ~y$w_buff1~0_In1834433298) (not .cse1) (not .cse2) .cse0))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1834433298, ~y$w_buff1~0=~y$w_buff1~0_In1834433298, ~y~0=~y~0_In1834433298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1834433298} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out1834433298|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1834433298, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out1834433298|, ~y$w_buff1~0=~y$w_buff1~0_In1834433298, ~y~0=~y~0_In1834433298, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1834433298} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 21:23:35,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= (ite (not (and (not (= (mod v_~y$w_buff1_used~0_217 256) 0)) (not (= (mod v_~y$w_buff0_used~0_458 256) 0)))) 1 0) |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_P1Thread1of1ForFork1_~arg.base_29 |v_P1Thread1of1ForFork1_#in~arg.base_31|) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|) (= v_~y$w_buff0_used~0_458 1) (= v_~y$w_buff0_used~0_459 v_~y$w_buff1_used~0_217) (= v_~x~0_34 1) (not (= 0 v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31)) (= v_~y$w_buff1~0_88 v_~y$w_buff0~0_113) (= |v_P1Thread1of1ForFork1_#in~arg.offset_31| v_P1Thread1of1ForFork1_~arg.offset_29) (= 1 v_~y$w_buff0~0_112)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_459, ~y$w_buff0~0=v_~y$w_buff0~0_113, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_29, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_458, ~y$w_buff1~0=v_~y$w_buff1~0_88, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_29|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_29, ~y$w_buff0~0=v_~y$w_buff0~0_112, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_31|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_31|, ~x~0=v_~x~0_34, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_217} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:23:35,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1894124585 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1894124585 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff0~0_In1894124585 |P1Thread1of1ForFork1_#t~ite17_Out1894124585|)) (and (= ~y$w_buff1~0_In1894124585 |P1Thread1of1ForFork1_#t~ite17_Out1894124585|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1894124585, ~y$w_buff1~0=~y$w_buff1~0_In1894124585, ~y$w_buff0~0=~y$w_buff0~0_In1894124585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1894124585} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1894124585, ~y$w_buff1~0=~y$w_buff1~0_In1894124585, ~y$w_buff0~0=~y$w_buff0~0_In1894124585, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1894124585, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1894124585|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 21:23:35,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_57 |v_P1Thread1of1ForFork1_#t~ite17_8|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_8|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_11|, ~y~0=v_~y~0_57, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-07 21:23:35,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_153 256))) (= v_~y$r_buff0_thd2~0_342 v_~y$r_buff0_thd2~0_341)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_342, ~weak$$choice2~0=v_~weak$$choice2~0_153} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_341, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_12|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_8|, ~weak$$choice2~0=v_~weak$$choice2~0_153} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 21:23:35,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1665253792 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1665253792| ~y$mem_tmp~0_In-1665253792) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1665253792| ~y~0_In-1665253792) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1665253792, ~y$flush_delayed~0=~y$flush_delayed~0_In-1665253792, ~y~0=~y~0_In-1665253792} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1665253792, ~y$flush_delayed~0=~y$flush_delayed~0_In-1665253792, ~y~0=~y~0_In-1665253792, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1665253792|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-07 21:23:35,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1105133151 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite41_Out-1105133151| |P1Thread1of1ForFork1_#t~ite40_Out-1105133151|)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1105133151 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y$w_buff1~0_In-1105133151 |P1Thread1of1ForFork1_#t~ite40_Out-1105133151|)) (and (not .cse1) .cse2 (not .cse0) (= |P1Thread1of1ForFork1_#t~ite40_Out-1105133151| ~y$w_buff0~0_In-1105133151)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1105133151, ~y$w_buff1~0=~y$w_buff1~0_In-1105133151, ~y$w_buff0~0=~y$w_buff0~0_In-1105133151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1105133151} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1105133151, ~y$w_buff1~0=~y$w_buff1~0_In-1105133151, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out-1105133151|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out-1105133151|, ~y$w_buff0~0=~y$w_buff0~0_In-1105133151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1105133151} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 21:23:35,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~y$r_buff0_thd2~0_127 v_~y$r_buff0_thd2~0_126)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_9|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_9|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_12|, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 21:23:35,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In40224403 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out40224403| ~y~0_In40224403) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite60_Out40224403| ~y$mem_tmp~0_In40224403) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In40224403, ~y$flush_delayed~0=~y$flush_delayed~0_In40224403, ~y~0=~y~0_In40224403} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In40224403, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out40224403|, ~y$flush_delayed~0=~y$flush_delayed~0_In40224403, ~y~0=~y~0_In40224403} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-07 21:23:35,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1392644148 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1392644148 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite63_Out-1392644148| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite63_Out-1392644148| ~y$w_buff0_used~0_In-1392644148) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1392644148, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1392644148} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out-1392644148|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1392644148, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1392644148} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-07 21:23:35,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1389724499 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1389724499 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite11_Out-1389724499| 0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite11_Out-1389724499| ~y$w_buff0_used~0_In-1389724499) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1389724499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1389724499} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out-1389724499|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1389724499, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1389724499} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 21:23:35,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1191343658 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1191343658 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1191343658 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1191343658 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite64_Out1191343658|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1191343658 |P1Thread1of1ForFork1_#t~ite64_Out1191343658|) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1191343658, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1191343658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1191343658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191343658} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1191343658, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out1191343658|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1191343658, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1191343658, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1191343658} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-07 21:23:35,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1043933349 256) 0)) (.cse2 (= ~y$r_buff0_thd2~0_In-1043933349 ~y$r_buff0_thd2~0_Out-1043933349)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1043933349 256)))) (or (and (= 0 ~y$r_buff0_thd2~0_Out-1043933349) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043933349, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1043933349} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1043933349, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1043933349, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out-1043933349|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-07 21:23:35,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In8334439 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In8334439 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In8334439 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In8334439 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite66_Out8334439| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite66_Out8334439| ~y$r_buff1_thd2~0_In8334439) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In8334439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In8334439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In8334439, ~y$w_buff1_used~0=~y$w_buff1_used~0_In8334439} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In8334439, ~y$w_buff0_used~0=~y$w_buff0_used~0_In8334439, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In8334439, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out8334439|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In8334439} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-07 21:23:35,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1357] [1357] L803-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_224 |v_P1Thread1of1ForFork1_#t~ite66_32|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_32|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_224, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 21:23:35,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-483834640 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In-483834640 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-483834640 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-483834640 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite12_Out-483834640| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-483834640 |P0Thread1of1ForFork0_#t~ite12_Out-483834640|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-483834640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-483834640, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-483834640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-483834640} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-483834640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-483834640, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-483834640, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out-483834640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-483834640} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 21:23:35,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-52130683 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-52130683 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite13_Out-52130683| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite13_Out-52130683| ~y$r_buff0_thd1~0_In-52130683) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-52130683, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52130683} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-52130683, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-52130683, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-52130683|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 21:23:35,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-975777097 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-975777097 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-975777097 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-975777097 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd1~0_In-975777097 |P0Thread1of1ForFork0_#t~ite14_Out-975777097|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite14_Out-975777097|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975777097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-975777097, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-975777097, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975777097} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-975777097, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-975777097, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-975777097, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-975777097|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-975777097} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 21:23:35,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (= v_~y$r_buff1_thd1~0_117 |v_P0Thread1of1ForFork0_#t~ite14_26|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_26|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_117, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_25|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 21:23:35,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= (ite (= (ite (= 2 v_~__unbuffered_cnt~0_26) 1 0) 0) 0 1) v_~main$tmp_guard0~0_9)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:23:35,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-641999572 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-641999572 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite69_Out-641999572| ~y$w_buff1~0_In-641999572) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite69_Out-641999572| ~y~0_In-641999572)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-641999572, ~y~0=~y~0_In-641999572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641999572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641999572} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-641999572, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-641999572|, ~y~0=~y~0_In-641999572, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-641999572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-641999572} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 21:23:35,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_92 |v_ULTIMATE.start_main_#t~ite69_10|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_10|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_9|, ~y~0=v_~y~0_92} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-07 21:23:35,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1703659052 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1703659052 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite71_Out1703659052|) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1703659052 |ULTIMATE.start_main_#t~ite71_Out1703659052|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1703659052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1703659052} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out1703659052|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1703659052, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1703659052} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-07 21:23:35,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1884766457 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1884766457 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1884766457 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1884766457 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite72_Out-1884766457|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1884766457 |ULTIMATE.start_main_#t~ite72_Out-1884766457|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1884766457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1884766457, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1884766457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884766457} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-1884766457|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1884766457, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1884766457, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1884766457, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1884766457} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 21:23:35,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1735150132 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1735150132 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite73_Out1735150132| ~y$r_buff0_thd0~0_In1735150132) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite73_Out1735150132| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1735150132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735150132} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1735150132|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1735150132, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1735150132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 21:23:35,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In26193510 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In26193510 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In26193510 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In26193510 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In26193510 |ULTIMATE.start_main_#t~ite74_Out26193510|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite74_Out26193510|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In26193510, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26193510, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In26193510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In26193510} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out26193510|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In26193510, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In26193510, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In26193510, ~y$w_buff1_used~0=~y$w_buff1_used~0_In26193510} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 21:23:35,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In2121821291 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In2121821291 |ULTIMATE.start_main_#t~ite97_Out2121821291|)) (and (= |ULTIMATE.start_main_#t~ite97_Out2121821291| ~y~0_In2121821291) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In2121821291, ~y$flush_delayed~0=~y$flush_delayed~0_In2121821291, ~y~0=~y~0_In2121821291} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In2121821291, ~y$flush_delayed~0=~y$flush_delayed~0_In2121821291, ~y~0=~y~0_In2121821291, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out2121821291|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 21:23:35,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1388] [1388] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_26 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y~0_361 |v_ULTIMATE.start_main_#t~ite97_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$flush_delayed~0_254 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~y~0=v_~y~0_361, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_45|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-07 21:23:35,176 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3dfd1dbb-0582-4ad2-ad92-39e4df921e3f/bin/utaipan/witness.graphml [2019-12-07 21:23:35,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:23:35,178 INFO L168 Benchmark]: Toolchain (without parser) took 48898.13 ms. Allocated memory was 1.0 GB in the beginning and 4.5 GB in the end (delta: 3.5 GB). Free memory was 942.5 MB in the beginning and 1.6 GB in the end (delta: -662.7 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,178 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:35,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 405.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,178 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,178 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:35,179 INFO L168 Benchmark]: RCFGBuilder took 565.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 978.3 MB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,179 INFO L168 Benchmark]: TraceAbstraction took 47758.14 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 978.3 MB in the beginning and 1.7 GB in the end (delta: -684.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,179 INFO L168 Benchmark]: Witness Printer took 87.67 ms. Allocated memory is still 4.5 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,180 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 405.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 565.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 978.3 MB in the end (delta: 75.6 MB). Peak memory consumption was 75.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 47758.14 ms. Allocated memory was 1.1 GB in the beginning and 4.5 GB in the end (delta: 3.4 GB). Free memory was 978.3 MB in the beginning and 1.7 GB in the end (delta: -684.1 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 87.67 ms. Allocated memory is still 4.5 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 57.3 MB). Peak memory consumption was 57.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 244 ProgramPointsBefore, 155 ProgramPointsAfterwards, 326 TransitionsBefore, 192 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 78 ConcurrentYvCompositions, 48 ChoiceCompositions, 16023 VarBasedMoverChecksPositive, 415 VarBasedMoverChecksNegative, 104 SemBasedMoverChecksPositive, 452 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 282427 CheckedPairsTotal, 142 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1645, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1646, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L771] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L788] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L788] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L789] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L789] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L790] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L791] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L791] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L793] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L842] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L843] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L844] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.5s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 21.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10296 SDtfs, 12081 SDslu, 38572 SDs, 0 SdLazy, 21347 SolverSat, 910 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 469 GetRequests, 87 SyntacticMatches, 51 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126190occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 11.2s AutomataMinimizationTime, 29 MinimizatonAttempts, 27721 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2426 NumberOfCodeBlocks, 2426 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2299 ConstructedInterpolants, 0 QuantifiedInterpolants, 885245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...