./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/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 a3d0efa2af6556ea841df2ccfd8d80c5c94f7027 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:25:04,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:25:04,597 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:25:04,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:25:04,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:25:04,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:25:04,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:25:04,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:25:04,609 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:25:04,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:25:04,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:25:04,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:25:04,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:25:04,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:25:04,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:25:04,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:25:04,614 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:25:04,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:25:04,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:25:04,617 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:25:04,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:25:04,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:25:04,619 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:25:04,620 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:25:04,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:25:04,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:25:04,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:25:04,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:25:04,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:25:04,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:25:04,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:25:04,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:25:04,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:25:04,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:25:04,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:25:04,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:25:04,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:25:04,626 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:25:04,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:25:04,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:25:04,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:25:04,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:25:04,637 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:25:04,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:25:04,638 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:25:04,638 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:25:04,638 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:25:04,638 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:25:04,638 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:25:04,639 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:25:04,639 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:25:04,639 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:25:04,639 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:25:04,639 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:25:04,639 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:25:04,639 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:25:04,640 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:25:04,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:25:04,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:25:04,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:25:04,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:25:04,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:25:04,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:25:04,641 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:25:04,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:25:04,642 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:25:04,643 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_26ed9b45-95af-4e11-902b-01adc7978b43/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 -> a3d0efa2af6556ea841df2ccfd8d80c5c94f7027 [2019-12-07 21:25:04,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:25:04,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:25:04,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:25:04,750 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:25:04,750 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:25:04,750 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix006_power.opt.i [2019-12-07 21:25:04,787 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/data/d8c1fa677/62d33e3881a641508c603e1bde192f80/FLAGcf2c073f5 [2019-12-07 21:25:05,152 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:25:05,153 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/sv-benchmarks/c/pthread-wmm/mix006_power.opt.i [2019-12-07 21:25:05,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/data/d8c1fa677/62d33e3881a641508c603e1bde192f80/FLAGcf2c073f5 [2019-12-07 21:25:05,175 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/data/d8c1fa677/62d33e3881a641508c603e1bde192f80 [2019-12-07 21:25:05,178 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:25:05,179 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:25:05,180 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:25:05,180 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:25:05,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:25:05,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,186 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05, skipping insertion in model container [2019-12-07 21:25:05,186 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:25:05,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:25:05,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:25:05,533 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:25:05,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:25:05,637 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:25:05,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05 WrapperNode [2019-12-07 21:25:05,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:25:05,638 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:25:05,638 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:25:05,638 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:25:05,643 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:25:05" (1/1) ... [2019-12-07 21:25:05,657 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:25:05" (1/1) ... [2019-12-07 21:25:05,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:25:05,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:25:05,678 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:25:05,678 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:25:05,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... [2019-12-07 21:25:05,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:25:05,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:25:05,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:25:05,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:25:05,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/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:25:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:25:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:25:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:25:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:25:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:25:05,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:25:05,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:25:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:25:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:25:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:25:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:25:05,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:25:05,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:25:05,756 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:25:06,147 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:25:06,148 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:25:06,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:25:06 BoogieIcfgContainer [2019-12-07 21:25:06,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:25:06,149 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:25:06,149 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:25:06,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:25:06,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:25:05" (1/3) ... [2019-12-07 21:25:06,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf406ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:25:06, skipping insertion in model container [2019-12-07 21:25:06,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:25:05" (2/3) ... [2019-12-07 21:25:06,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf406ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:25:06, skipping insertion in model container [2019-12-07 21:25:06,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:25:06" (3/3) ... [2019-12-07 21:25:06,153 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.opt.i [2019-12-07 21:25:06,159 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:25:06,159 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:25:06,164 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:25:06,165 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:25:06,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,193 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,194 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,195 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,196 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,197 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,198 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,206 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,207 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,208 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,209 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,210 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,211 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,212 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,213 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,214 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,215 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,216 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,217 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,218 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,219 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:25:06,232 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 21:25:06,244 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:25:06,244 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:25:06,244 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:25:06,244 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:25:06,244 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:25:06,244 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:25:06,244 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:25:06,244 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:25:06,254 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 241 transitions [2019-12-07 21:25:06,255 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 21:25:06,315 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 21:25:06,316 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:25:06,327 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 21:25:06,348 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 195 places, 241 transitions [2019-12-07 21:25:06,382 INFO L134 PetriNetUnfolder]: 56/238 cut-off events. [2019-12-07 21:25:06,382 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:25:06,390 INFO L76 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 238 events. 56/238 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 923 event pairs. 9/189 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-07 21:25:06,413 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-07 21:25:06,414 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:25:09,602 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 21:25:09,705 INFO L206 etLargeBlockEncoding]: Checked pairs total: 128241 [2019-12-07 21:25:09,705 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-07 21:25:09,708 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 133 transitions [2019-12-07 21:25:12,805 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 47186 states. [2019-12-07 21:25:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 47186 states. [2019-12-07 21:25:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:25:12,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:12,812 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:12,812 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:12,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash -137140126, now seen corresponding path program 1 times [2019-12-07 21:25:12,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:12,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741000184] [2019-12-07 21:25:12,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:12,974 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:25:12,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741000184] [2019-12-07 21:25:12,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:12,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:25:12,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25949800] [2019-12-07 21:25:12,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:25:12,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:12,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:25:12,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:25:12,989 INFO L87 Difference]: Start difference. First operand 47186 states. Second operand 3 states. [2019-12-07 21:25:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:13,399 INFO L93 Difference]: Finished difference Result 46894 states and 192684 transitions. [2019-12-07 21:25:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:25:13,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 21:25:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:13,663 INFO L225 Difference]: With dead ends: 46894 [2019-12-07 21:25:13,663 INFO L226 Difference]: Without dead ends: 43674 [2019-12-07 21:25:13,664 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:25:14,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43674 states. [2019-12-07 21:25:15,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43674 to 43674. [2019-12-07 21:25:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43674 states. [2019-12-07 21:25:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43674 states to 43674 states and 179330 transitions. [2019-12-07 21:25:15,241 INFO L78 Accepts]: Start accepts. Automaton has 43674 states and 179330 transitions. Word has length 7 [2019-12-07 21:25:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:15,242 INFO L462 AbstractCegarLoop]: Abstraction has 43674 states and 179330 transitions. [2019-12-07 21:25:15,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:25:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 43674 states and 179330 transitions. [2019-12-07 21:25:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:25:15,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:15,246 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:15,246 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:15,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1070314357, now seen corresponding path program 1 times [2019-12-07 21:25:15,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:15,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347128024] [2019-12-07 21:25:15,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:15,308 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:25:15,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347128024] [2019-12-07 21:25:15,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:15,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:25:15,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099896475] [2019-12-07 21:25:15,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:25:15,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:25:15,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:25:15,310 INFO L87 Difference]: Start difference. First operand 43674 states and 179330 transitions. Second operand 4 states. [2019-12-07 21:25:15,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:15,839 INFO L93 Difference]: Finished difference Result 69642 states and 274292 transitions. [2019-12-07 21:25:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:25:15,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 21:25:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:16,147 INFO L225 Difference]: With dead ends: 69642 [2019-12-07 21:25:16,147 INFO L226 Difference]: Without dead ends: 69610 [2019-12-07 21:25:16,148 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:25:17,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69610 states. [2019-12-07 21:25:17,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69610 to 67954. [2019-12-07 21:25:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67954 states. [2019-12-07 21:25:18,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67954 states to 67954 states and 269064 transitions. [2019-12-07 21:25:18,162 INFO L78 Accepts]: Start accepts. Automaton has 67954 states and 269064 transitions. Word has length 13 [2019-12-07 21:25:18,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:18,163 INFO L462 AbstractCegarLoop]: Abstraction has 67954 states and 269064 transitions. [2019-12-07 21:25:18,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:25:18,163 INFO L276 IsEmpty]: Start isEmpty. Operand 67954 states and 269064 transitions. [2019-12-07 21:25:18,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 21:25:18,168 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:18,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:18,168 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:18,168 INFO L82 PathProgramCache]: Analyzing trace with hash 484016506, now seen corresponding path program 1 times [2019-12-07 21:25:18,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:18,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579959410] [2019-12-07 21:25:18,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:18,215 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:25:18,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579959410] [2019-12-07 21:25:18,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:18,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:25:18,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933972537] [2019-12-07 21:25:18,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:25:18,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:18,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:25:18,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:25:18,217 INFO L87 Difference]: Start difference. First operand 67954 states and 269064 transitions. Second operand 4 states. [2019-12-07 21:25:18,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:18,747 INFO L93 Difference]: Finished difference Result 86818 states and 338660 transitions. [2019-12-07 21:25:18,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:25:18,747 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 21:25:18,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:18,941 INFO L225 Difference]: With dead ends: 86818 [2019-12-07 21:25:18,941 INFO L226 Difference]: Without dead ends: 86790 [2019-12-07 21:25:18,942 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:25:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86790 states. [2019-12-07 21:25:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86790 to 77804. [2019-12-07 21:25:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77804 states. [2019-12-07 21:25:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77804 states to 77804 states and 306271 transitions. [2019-12-07 21:25:22,190 INFO L78 Accepts]: Start accepts. Automaton has 77804 states and 306271 transitions. Word has length 16 [2019-12-07 21:25:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:22,190 INFO L462 AbstractCegarLoop]: Abstraction has 77804 states and 306271 transitions. [2019-12-07 21:25:22,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:25:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 77804 states and 306271 transitions. [2019-12-07 21:25:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 21:25:22,195 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:22,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:22,195 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:22,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:22,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2119638279, now seen corresponding path program 1 times [2019-12-07 21:25:22,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:22,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047348785] [2019-12-07 21:25:22,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:22,223 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:25:22,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047348785] [2019-12-07 21:25:22,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:22,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:25:22,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995813062] [2019-12-07 21:25:22,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:25:22,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:25:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:25:22,224 INFO L87 Difference]: Start difference. First operand 77804 states and 306271 transitions. Second operand 3 states. [2019-12-07 21:25:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:22,826 INFO L93 Difference]: Finished difference Result 129752 states and 490387 transitions. [2019-12-07 21:25:22,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:25:22,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-07 21:25:22,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:23,142 INFO L225 Difference]: With dead ends: 129752 [2019-12-07 21:25:23,142 INFO L226 Difference]: Without dead ends: 129752 [2019-12-07 21:25:23,142 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:25:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129752 states. [2019-12-07 21:25:25,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129752 to 115674. [2019-12-07 21:25:25,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115674 states. [2019-12-07 21:25:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115674 states to 115674 states and 443292 transitions. [2019-12-07 21:25:26,619 INFO L78 Accepts]: Start accepts. Automaton has 115674 states and 443292 transitions. Word has length 17 [2019-12-07 21:25:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:26,619 INFO L462 AbstractCegarLoop]: Abstraction has 115674 states and 443292 transitions. [2019-12-07 21:25:26,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:25:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 115674 states and 443292 transitions. [2019-12-07 21:25:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:25:26,633 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:26,633 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:26,633 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:26,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1223807206, now seen corresponding path program 1 times [2019-12-07 21:25:26,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:26,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475919894] [2019-12-07 21:25:26,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:26,686 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:25:26,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475919894] [2019-12-07 21:25:26,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:26,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:25:26,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010517345] [2019-12-07 21:25:26,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:25:26,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:26,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:25:26,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:25:26,687 INFO L87 Difference]: Start difference. First operand 115674 states and 443292 transitions. Second operand 3 states. [2019-12-07 21:25:27,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:27,189 INFO L93 Difference]: Finished difference Result 115674 states and 437844 transitions. [2019-12-07 21:25:27,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:25:27,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 21:25:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:27,464 INFO L225 Difference]: With dead ends: 115674 [2019-12-07 21:25:27,464 INFO L226 Difference]: Without dead ends: 115674 [2019-12-07 21:25:27,464 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:25:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115674 states. [2019-12-07 21:25:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115674 to 114698. [2019-12-07 21:25:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114698 states. [2019-12-07 21:25:31,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114698 states to 114698 states and 434576 transitions. [2019-12-07 21:25:31,579 INFO L78 Accepts]: Start accepts. Automaton has 114698 states and 434576 transitions. Word has length 18 [2019-12-07 21:25:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:31,579 INFO L462 AbstractCegarLoop]: Abstraction has 114698 states and 434576 transitions. [2019-12-07 21:25:31,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:25:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 114698 states and 434576 transitions. [2019-12-07 21:25:31,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:25:31,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:31,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:31,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:31,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:31,586 INFO L82 PathProgramCache]: Analyzing trace with hash -738098229, now seen corresponding path program 1 times [2019-12-07 21:25:31,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:31,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846954104] [2019-12-07 21:25:31,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:31,638 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:25:31,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846954104] [2019-12-07 21:25:31,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:31,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:25:31,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542928699] [2019-12-07 21:25:31,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:25:31,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:31,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:25:31,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:25:31,640 INFO L87 Difference]: Start difference. First operand 114698 states and 434576 transitions. Second operand 3 states. [2019-12-07 21:25:32,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:32,331 INFO L93 Difference]: Finished difference Result 171097 states and 615347 transitions. [2019-12-07 21:25:32,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:25:32,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 21:25:32,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:32,703 INFO L225 Difference]: With dead ends: 171097 [2019-12-07 21:25:32,703 INFO L226 Difference]: Without dead ends: 170623 [2019-12-07 21:25:32,703 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:25:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170623 states. [2019-12-07 21:25:36,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170623 to 165777. [2019-12-07 21:25:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165777 states. [2019-12-07 21:25:37,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165777 states to 165777 states and 602300 transitions. [2019-12-07 21:25:37,285 INFO L78 Accepts]: Start accepts. Automaton has 165777 states and 602300 transitions. Word has length 18 [2019-12-07 21:25:37,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:37,286 INFO L462 AbstractCegarLoop]: Abstraction has 165777 states and 602300 transitions. [2019-12-07 21:25:37,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:25:37,286 INFO L276 IsEmpty]: Start isEmpty. Operand 165777 states and 602300 transitions. [2019-12-07 21:25:37,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:25:37,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:37,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:37,296 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:37,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:37,296 INFO L82 PathProgramCache]: Analyzing trace with hash -249657895, now seen corresponding path program 1 times [2019-12-07 21:25:37,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:37,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861271384] [2019-12-07 21:25:37,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:25:37,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861271384] [2019-12-07 21:25:37,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:37,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:25:37,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304111620] [2019-12-07 21:25:37,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:25:37,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:37,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:25:37,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:25:37,330 INFO L87 Difference]: Start difference. First operand 165777 states and 602300 transitions. Second operand 4 states. [2019-12-07 21:25:38,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:38,402 INFO L93 Difference]: Finished difference Result 205212 states and 736423 transitions. [2019-12-07 21:25:38,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:25:38,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 21:25:38,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:38,893 INFO L225 Difference]: With dead ends: 205212 [2019-12-07 21:25:38,894 INFO L226 Difference]: Without dead ends: 205178 [2019-12-07 21:25:38,894 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:25:40,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205178 states. [2019-12-07 21:25:44,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205178 to 168072. [2019-12-07 21:25:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168072 states. [2019-12-07 21:25:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168072 states to 168072 states and 610506 transitions. [2019-12-07 21:25:45,007 INFO L78 Accepts]: Start accepts. Automaton has 168072 states and 610506 transitions. Word has length 19 [2019-12-07 21:25:45,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:45,007 INFO L462 AbstractCegarLoop]: Abstraction has 168072 states and 610506 transitions. [2019-12-07 21:25:45,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:25:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 168072 states and 610506 transitions. [2019-12-07 21:25:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:25:45,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:45,017 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:25:45,018 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1744778382, now seen corresponding path program 1 times [2019-12-07 21:25:45,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:45,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413543696] [2019-12-07 21:25:45,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:45,072 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:25:45,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413543696] [2019-12-07 21:25:45,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:45,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:25:45,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932167505] [2019-12-07 21:25:45,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:25:45,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:45,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:25:45,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:25:45,073 INFO L87 Difference]: Start difference. First operand 168072 states and 610506 transitions. Second operand 4 states. [2019-12-07 21:25:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:45,751 INFO L93 Difference]: Finished difference Result 162880 states and 587680 transitions. [2019-12-07 21:25:45,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:25:45,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-07 21:25:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:46,101 INFO L225 Difference]: With dead ends: 162880 [2019-12-07 21:25:46,101 INFO L226 Difference]: Without dead ends: 162880 [2019-12-07 21:25:46,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:25:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162880 states. [2019-12-07 21:25:49,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162880 to 125059. [2019-12-07 21:25:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125059 states. [2019-12-07 21:25:49,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125059 states to 125059 states and 462728 transitions. [2019-12-07 21:25:49,746 INFO L78 Accepts]: Start accepts. Automaton has 125059 states and 462728 transitions. Word has length 19 [2019-12-07 21:25:49,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:49,746 INFO L462 AbstractCegarLoop]: Abstraction has 125059 states and 462728 transitions. [2019-12-07 21:25:49,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:25:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 125059 states and 462728 transitions. [2019-12-07 21:25:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:25:49,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:49,762 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:25:49,762 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:49,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:49,762 INFO L82 PathProgramCache]: Analyzing trace with hash 2096047185, now seen corresponding path program 1 times [2019-12-07 21:25:49,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:49,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845629074] [2019-12-07 21:25:49,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:49,810 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:25:49,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845629074] [2019-12-07 21:25:49,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:49,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:25:49,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821008104] [2019-12-07 21:25:49,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:25:49,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:49,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:25:49,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:25:49,811 INFO L87 Difference]: Start difference. First operand 125059 states and 462728 transitions. Second operand 5 states. [2019-12-07 21:25:50,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:50,916 INFO L93 Difference]: Finished difference Result 178132 states and 645781 transitions. [2019-12-07 21:25:50,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:25:50,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 21:25:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:51,307 INFO L225 Difference]: With dead ends: 178132 [2019-12-07 21:25:51,307 INFO L226 Difference]: Without dead ends: 178104 [2019-12-07 21:25:51,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:25:52,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178104 states. [2019-12-07 21:25:54,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178104 to 135158. [2019-12-07 21:25:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135158 states. [2019-12-07 21:25:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135158 states to 135158 states and 498909 transitions. [2019-12-07 21:25:55,282 INFO L78 Accepts]: Start accepts. Automaton has 135158 states and 498909 transitions. Word has length 22 [2019-12-07 21:25:55,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:25:55,282 INFO L462 AbstractCegarLoop]: Abstraction has 135158 states and 498909 transitions. [2019-12-07 21:25:55,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:25:55,282 INFO L276 IsEmpty]: Start isEmpty. Operand 135158 states and 498909 transitions. [2019-12-07 21:25:55,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:25:55,316 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:25:55,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] [2019-12-07 21:25:55,317 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:25:55,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:25:55,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1504772464, now seen corresponding path program 1 times [2019-12-07 21:25:55,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:25:55,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957856218] [2019-12-07 21:25:55,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:25:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:25:55,361 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:25:55,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957856218] [2019-12-07 21:25:55,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:25:55,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:25:55,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300082790] [2019-12-07 21:25:55,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:25:55,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:25:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:25:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:25:55,362 INFO L87 Difference]: Start difference. First operand 135158 states and 498909 transitions. Second operand 5 states. [2019-12-07 21:25:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:25:56,747 INFO L93 Difference]: Finished difference Result 186257 states and 674787 transitions. [2019-12-07 21:25:56,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:25:56,747 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 21:25:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:25:57,168 INFO L225 Difference]: With dead ends: 186257 [2019-12-07 21:25:57,168 INFO L226 Difference]: Without dead ends: 186201 [2019-12-07 21:25:57,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:25:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186201 states. [2019-12-07 21:26:02,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186201 to 127391. [2019-12-07 21:26:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127391 states. [2019-12-07 21:26:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127391 states to 127391 states and 470408 transitions. [2019-12-07 21:26:02,841 INFO L78 Accepts]: Start accepts. Automaton has 127391 states and 470408 transitions. Word has length 25 [2019-12-07 21:26:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:02,842 INFO L462 AbstractCegarLoop]: Abstraction has 127391 states and 470408 transitions. [2019-12-07 21:26:02,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:26:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 127391 states and 470408 transitions. [2019-12-07 21:26:02,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:26:02,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:02,932 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:26:02,932 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:02,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:02,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1567123768, now seen corresponding path program 1 times [2019-12-07 21:26:02,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:02,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571973159] [2019-12-07 21:26:02,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:02,995 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:26:02,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571973159] [2019-12-07 21:26:02,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:02,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:26:02,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673074998] [2019-12-07 21:26:02,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:26:02,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:26:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:26:02,996 INFO L87 Difference]: Start difference. First operand 127391 states and 470408 transitions. Second operand 5 states. [2019-12-07 21:26:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:04,037 INFO L93 Difference]: Finished difference Result 221850 states and 810444 transitions. [2019-12-07 21:26:04,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:26:04,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-07 21:26:04,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:04,556 INFO L225 Difference]: With dead ends: 221850 [2019-12-07 21:26:04,556 INFO L226 Difference]: Without dead ends: 221850 [2019-12-07 21:26:04,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:26:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221850 states. [2019-12-07 21:26:08,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221850 to 161439. [2019-12-07 21:26:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161439 states. [2019-12-07 21:26:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161439 states to 161439 states and 607260 transitions. [2019-12-07 21:26:09,034 INFO L78 Accepts]: Start accepts. Automaton has 161439 states and 607260 transitions. Word has length 33 [2019-12-07 21:26:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:09,034 INFO L462 AbstractCegarLoop]: Abstraction has 161439 states and 607260 transitions. [2019-12-07 21:26:09,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:26:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 161439 states and 607260 transitions. [2019-12-07 21:26:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 21:26:09,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:09,164 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:26:09,164 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:09,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:09,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1911326436, now seen corresponding path program 2 times [2019-12-07 21:26:09,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:09,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140736071] [2019-12-07 21:26:09,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:09,200 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:26:09,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140736071] [2019-12-07 21:26:09,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:09,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:26:09,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2668957] [2019-12-07 21:26:09,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:26:09,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:26:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:26:09,201 INFO L87 Difference]: Start difference. First operand 161439 states and 607260 transitions. Second operand 3 states. [2019-12-07 21:26:09,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:09,520 INFO L93 Difference]: Finished difference Result 92760 states and 307074 transitions. [2019-12-07 21:26:09,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:26:09,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 21:26:09,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:09,679 INFO L225 Difference]: With dead ends: 92760 [2019-12-07 21:26:09,679 INFO L226 Difference]: Without dead ends: 92760 [2019-12-07 21:26:09,679 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:26:10,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92760 states. [2019-12-07 21:26:11,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92760 to 92648. [2019-12-07 21:26:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92648 states. [2019-12-07 21:26:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92648 states to 92648 states and 306700 transitions. [2019-12-07 21:26:11,761 INFO L78 Accepts]: Start accepts. Automaton has 92648 states and 306700 transitions. Word has length 33 [2019-12-07 21:26:11,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:11,761 INFO L462 AbstractCegarLoop]: Abstraction has 92648 states and 306700 transitions. [2019-12-07 21:26:11,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:26:11,762 INFO L276 IsEmpty]: Start isEmpty. Operand 92648 states and 306700 transitions. [2019-12-07 21:26:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:26:11,814 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:11,814 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:26:11,814 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:11,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:11,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1598001629, now seen corresponding path program 1 times [2019-12-07 21:26:11,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:11,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954849858] [2019-12-07 21:26:11,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:11,905 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:26:11,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954849858] [2019-12-07 21:26:11,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:11,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:26:11,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482358817] [2019-12-07 21:26:11,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:26:11,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:11,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:26:11,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:26:11,906 INFO L87 Difference]: Start difference. First operand 92648 states and 306700 transitions. Second operand 8 states. [2019-12-07 21:26:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:13,556 INFO L93 Difference]: Finished difference Result 240740 states and 806731 transitions. [2019-12-07 21:26:13,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 21:26:13,557 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 21:26:13,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:14,060 INFO L225 Difference]: With dead ends: 240740 [2019-12-07 21:26:14,061 INFO L226 Difference]: Without dead ends: 240740 [2019-12-07 21:26:14,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-12-07 21:26:15,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240740 states. [2019-12-07 21:26:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240740 to 103445. [2019-12-07 21:26:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103445 states. [2019-12-07 21:26:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103445 states to 103445 states and 342281 transitions. [2019-12-07 21:26:17,550 INFO L78 Accepts]: Start accepts. Automaton has 103445 states and 342281 transitions. Word has length 34 [2019-12-07 21:26:17,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:17,550 INFO L462 AbstractCegarLoop]: Abstraction has 103445 states and 342281 transitions. [2019-12-07 21:26:17,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:26:17,550 INFO L276 IsEmpty]: Start isEmpty. Operand 103445 states and 342281 transitions. [2019-12-07 21:26:17,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 21:26:17,619 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:17,619 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:26:17,619 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:17,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:17,620 INFO L82 PathProgramCache]: Analyzing trace with hash 255793039, now seen corresponding path program 2 times [2019-12-07 21:26:17,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:17,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698630377] [2019-12-07 21:26:17,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:17,647 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:26:17,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698630377] [2019-12-07 21:26:17,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:17,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:26:17,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837974294] [2019-12-07 21:26:17,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:26:17,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:26:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:26:17,649 INFO L87 Difference]: Start difference. First operand 103445 states and 342281 transitions. Second operand 4 states. [2019-12-07 21:26:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:17,700 INFO L93 Difference]: Finished difference Result 14572 states and 39759 transitions. [2019-12-07 21:26:17,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:26:17,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-07 21:26:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:17,717 INFO L225 Difference]: With dead ends: 14572 [2019-12-07 21:26:17,717 INFO L226 Difference]: Without dead ends: 14572 [2019-12-07 21:26:17,717 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:26:17,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14572 states. [2019-12-07 21:26:17,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14572 to 14114. [2019-12-07 21:26:17,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14114 states. [2019-12-07 21:26:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14114 states to 14114 states and 38480 transitions. [2019-12-07 21:26:17,886 INFO L78 Accepts]: Start accepts. Automaton has 14114 states and 38480 transitions. Word has length 34 [2019-12-07 21:26:17,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:17,887 INFO L462 AbstractCegarLoop]: Abstraction has 14114 states and 38480 transitions. [2019-12-07 21:26:17,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:26:17,887 INFO L276 IsEmpty]: Start isEmpty. Operand 14114 states and 38480 transitions. [2019-12-07 21:26:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-07 21:26:17,898 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:17,898 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26:17,898 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -540828894, now seen corresponding path program 1 times [2019-12-07 21:26:17,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:17,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625543495] [2019-12-07 21:26:17,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:17,949 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:26:17,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625543495] [2019-12-07 21:26:17,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:17,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:26:17,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839950195] [2019-12-07 21:26:17,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:26:17,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:26:17,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:26:17,950 INFO L87 Difference]: Start difference. First operand 14114 states and 38480 transitions. Second operand 5 states. [2019-12-07 21:26:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:17,992 INFO L93 Difference]: Finished difference Result 10583 states and 30468 transitions. [2019-12-07 21:26:17,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:26:17,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-07 21:26:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:18,004 INFO L225 Difference]: With dead ends: 10583 [2019-12-07 21:26:18,004 INFO L226 Difference]: Without dead ends: 10544 [2019-12-07 21:26:18,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:26:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10544 states. [2019-12-07 21:26:18,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10544 to 6989. [2019-12-07 21:26:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6989 states. [2019-12-07 21:26:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6989 states to 6989 states and 20254 transitions. [2019-12-07 21:26:18,102 INFO L78 Accepts]: Start accepts. Automaton has 6989 states and 20254 transitions. Word has length 45 [2019-12-07 21:26:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:18,102 INFO L462 AbstractCegarLoop]: Abstraction has 6989 states and 20254 transitions. [2019-12-07 21:26:18,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:26:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 6989 states and 20254 transitions. [2019-12-07 21:26:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 21:26:18,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:18,108 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] [2019-12-07 21:26:18,109 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1468892539, now seen corresponding path program 1 times [2019-12-07 21:26:18,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:18,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792719604] [2019-12-07 21:26:18,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:18,220 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:26:18,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792719604] [2019-12-07 21:26:18,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:18,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:26:18,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583615305] [2019-12-07 21:26:18,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:26:18,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:18,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:26:18,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:26:18,221 INFO L87 Difference]: Start difference. First operand 6989 states and 20254 transitions. Second operand 4 states. [2019-12-07 21:26:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:18,404 INFO L93 Difference]: Finished difference Result 7797 states and 22304 transitions. [2019-12-07 21:26:18,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:26:18,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 21:26:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:18,413 INFO L225 Difference]: With dead ends: 7797 [2019-12-07 21:26:18,413 INFO L226 Difference]: Without dead ends: 7797 [2019-12-07 21:26:18,413 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:26:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7797 states. [2019-12-07 21:26:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7797 to 7445. [2019-12-07 21:26:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7445 states. [2019-12-07 21:26:18,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7445 states to 7445 states and 21400 transitions. [2019-12-07 21:26:18,503 INFO L78 Accepts]: Start accepts. Automaton has 7445 states and 21400 transitions. Word has length 62 [2019-12-07 21:26:18,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:18,503 INFO L462 AbstractCegarLoop]: Abstraction has 7445 states and 21400 transitions. [2019-12-07 21:26:18,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:26:18,504 INFO L276 IsEmpty]: Start isEmpty. Operand 7445 states and 21400 transitions. [2019-12-07 21:26:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 21:26:18,509 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:18,509 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] [2019-12-07 21:26:18,509 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:18,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:18,510 INFO L82 PathProgramCache]: Analyzing trace with hash 788537191, now seen corresponding path program 2 times [2019-12-07 21:26:18,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:18,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460786579] [2019-12-07 21:26:18,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:18,735 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:26:18,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460786579] [2019-12-07 21:26:18,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:18,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:26:18,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836869336] [2019-12-07 21:26:18,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 21:26:18,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:18,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 21:26:18,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:26:18,736 INFO L87 Difference]: Start difference. First operand 7445 states and 21400 transitions. Second operand 9 states. [2019-12-07 21:26:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:19,689 INFO L93 Difference]: Finished difference Result 18495 states and 47600 transitions. [2019-12-07 21:26:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 21:26:19,690 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2019-12-07 21:26:19,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:19,705 INFO L225 Difference]: With dead ends: 18495 [2019-12-07 21:26:19,705 INFO L226 Difference]: Without dead ends: 16635 [2019-12-07 21:26:19,705 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2019-12-07 21:26:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16635 states. [2019-12-07 21:26:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16635 to 10036. [2019-12-07 21:26:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10036 states. [2019-12-07 21:26:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10036 states to 10036 states and 28105 transitions. [2019-12-07 21:26:19,864 INFO L78 Accepts]: Start accepts. Automaton has 10036 states and 28105 transitions. Word has length 62 [2019-12-07 21:26:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:19,864 INFO L462 AbstractCegarLoop]: Abstraction has 10036 states and 28105 transitions. [2019-12-07 21:26:19,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 21:26:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 10036 states and 28105 transitions. [2019-12-07 21:26:19,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 21:26:19,873 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:19,873 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] [2019-12-07 21:26:19,873 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:19,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:19,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1066134383, now seen corresponding path program 3 times [2019-12-07 21:26:19,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:19,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050612101] [2019-12-07 21:26:19,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:20,139 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:26:20,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050612101] [2019-12-07 21:26:20,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:20,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 21:26:20,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331590551] [2019-12-07 21:26:20,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 21:26:20,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:20,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 21:26:20,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-07 21:26:20,140 INFO L87 Difference]: Start difference. First operand 10036 states and 28105 transitions. Second operand 12 states. [2019-12-07 21:26:22,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:22,981 INFO L93 Difference]: Finished difference Result 27852 states and 74994 transitions. [2019-12-07 21:26:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 21:26:22,982 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 62 [2019-12-07 21:26:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:23,026 INFO L225 Difference]: With dead ends: 27852 [2019-12-07 21:26:23,027 INFO L226 Difference]: Without dead ends: 26822 [2019-12-07 21:26:23,027 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 21:26:23,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26822 states. [2019-12-07 21:26:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26822 to 12766. [2019-12-07 21:26:23,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12766 states. [2019-12-07 21:26:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12766 states to 12766 states and 35821 transitions. [2019-12-07 21:26:23,272 INFO L78 Accepts]: Start accepts. Automaton has 12766 states and 35821 transitions. Word has length 62 [2019-12-07 21:26:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:23,273 INFO L462 AbstractCegarLoop]: Abstraction has 12766 states and 35821 transitions. [2019-12-07 21:26:23,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 21:26:23,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12766 states and 35821 transitions. [2019-12-07 21:26:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 21:26:23,285 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:23,286 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] [2019-12-07 21:26:23,286 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:23,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1844822754, now seen corresponding path program 1 times [2019-12-07 21:26:23,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:23,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290081431] [2019-12-07 21:26:23,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:23,350 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:26:23,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290081431] [2019-12-07 21:26:23,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:23,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:26:23,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431912533] [2019-12-07 21:26:23,351 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:26:23,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:23,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:26:23,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:26:23,351 INFO L87 Difference]: Start difference. First operand 12766 states and 35821 transitions. Second operand 5 states. [2019-12-07 21:26:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:23,420 INFO L93 Difference]: Finished difference Result 16782 states and 45172 transitions. [2019-12-07 21:26:23,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:26:23,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-12-07 21:26:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:23,428 INFO L225 Difference]: With dead ends: 16782 [2019-12-07 21:26:23,428 INFO L226 Difference]: Without dead ends: 6119 [2019-12-07 21:26:23,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:26:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6119 states. [2019-12-07 21:26:23,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6119 to 5646. [2019-12-07 21:26:23,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5646 states. [2019-12-07 21:26:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5646 states to 5646 states and 14344 transitions. [2019-12-07 21:26:23,490 INFO L78 Accepts]: Start accepts. Automaton has 5646 states and 14344 transitions. Word has length 63 [2019-12-07 21:26:23,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:23,490 INFO L462 AbstractCegarLoop]: Abstraction has 5646 states and 14344 transitions. [2019-12-07 21:26:23,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:26:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5646 states and 14344 transitions. [2019-12-07 21:26:23,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 21:26:23,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:23,494 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] [2019-12-07 21:26:23,495 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:23,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:23,495 INFO L82 PathProgramCache]: Analyzing trace with hash -942471944, now seen corresponding path program 2 times [2019-12-07 21:26:23,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:23,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637304819] [2019-12-07 21:26:23,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:23,550 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:26:23,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637304819] [2019-12-07 21:26:23,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:23,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:26:23,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660388027] [2019-12-07 21:26:23,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:26:23,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:23,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:26:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:26:23,551 INFO L87 Difference]: Start difference. First operand 5646 states and 14344 transitions. Second operand 4 states. [2019-12-07 21:26:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:23,576 INFO L93 Difference]: Finished difference Result 6112 states and 15371 transitions. [2019-12-07 21:26:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:26:23,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-07 21:26:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:23,577 INFO L225 Difference]: With dead ends: 6112 [2019-12-07 21:26:23,577 INFO L226 Difference]: Without dead ends: 562 [2019-12-07 21:26:23,578 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:26:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-12-07 21:26:23,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-12-07 21:26:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-12-07 21:26:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1219 transitions. [2019-12-07 21:26:23,582 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1219 transitions. Word has length 63 [2019-12-07 21:26:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:23,582 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 1219 transitions. [2019-12-07 21:26:23,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:26:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1219 transitions. [2019-12-07 21:26:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 21:26:23,583 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:23,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:26:23,583 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 424994232, now seen corresponding path program 3 times [2019-12-07 21:26:23,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:23,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684727433] [2019-12-07 21:26:23,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:26:23,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:26:23,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684727433] [2019-12-07 21:26:23,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:26:23,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:26:23,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973337806] [2019-12-07 21:26:23,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:26:23,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:26:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:26:23,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:26:23,647 INFO L87 Difference]: Start difference. First operand 562 states and 1219 transitions. Second operand 7 states. [2019-12-07 21:26:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:26:23,802 INFO L93 Difference]: Finished difference Result 1098 states and 2356 transitions. [2019-12-07 21:26:23,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:26:23,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-07 21:26:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:26:23,804 INFO L225 Difference]: With dead ends: 1098 [2019-12-07 21:26:23,804 INFO L226 Difference]: Without dead ends: 791 [2019-12-07 21:26:23,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:26:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2019-12-07 21:26:23,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 621. [2019-12-07 21:26:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-12-07 21:26:23,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1319 transitions. [2019-12-07 21:26:23,809 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1319 transitions. Word has length 63 [2019-12-07 21:26:23,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:26:23,810 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 1319 transitions. [2019-12-07 21:26:23,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:26:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1319 transitions. [2019-12-07 21:26:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 21:26:23,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:26:23,811 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] [2019-12-07 21:26:23,811 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:26:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:26:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 279364820, now seen corresponding path program 4 times [2019-12-07 21:26:23,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:26:23,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646134170] [2019-12-07 21:26:23,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:26:23,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:26:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:26:23,892 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:26:23,893 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:26:23,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25|)) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= v_~y$w_buff0_used~0_960 0) (= |v_ULTIMATE.start_main_~#t156~0.offset_18| 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t156~0.base_25| 4) |v_#length_23|) (= v_~y~0_332 0) (= v_~main$tmp_guard0~0_26 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25|) |v_ULTIMATE.start_main_~#t156~0.offset_18| 0))) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t156~0.base_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ULTIMATE.start_main_~#t156~0.offset=|v_ULTIMATE.start_main_~#t156~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~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_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_22|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t156~0.base=|v_ULTIMATE.start_main_~#t156~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t157~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t156~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t158~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t158~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t156~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:26:23,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t157~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13|) |v_ULTIMATE.start_main_~#t157~0.offset_11| 1)) |v_#memory_int_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13| 1) |v_#valid_34|) (= |v_ULTIMATE.start_main_~#t157~0.offset_11| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t157~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t157~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t157~0.offset, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:26:23,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t158~0.base_12| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12|) |v_ULTIMATE.start_main_~#t158~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t158~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t158~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t158~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t158~0.base, ULTIMATE.start_main_~#t158~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 21:26:23,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 21:26:23,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1182280660 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1182280660 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff1~0_In1182280660) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff0~0_In1182280660) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1182280660|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 21:26:23,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 21:26:23,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 21:26:23,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-443459144 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-443459144| ~y$mem_tmp~0_In-443459144) (not .cse0)) (and .cse0 (= ~y~0_In-443459144 |P2Thread1of1ForFork0_#t~ite48_Out-443459144|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-443459144|, ~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 21:26:23,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 21:26:23,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1344740600 256)))) (or (and (= ~y~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) .cse0) (and (= ~y$mem_tmp~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1344740600|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 21:26:23,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 21:26:23,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1447649185 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1447649185 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1447649185 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1447649185|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 21:26:23,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1835832860 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1835832860 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1835832860 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1835832860 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| ~y$w_buff1_used~0_In1835832860) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1835832860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 21:26:23,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_Out-738514053 ~y$r_buff0_thd3~0_In-738514053)) (.cse2 (= (mod ~y$w_buff0_used~0_In-738514053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-738514053 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd3~0_Out-738514053 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-738514053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-738514053, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-738514053|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 21:26:23,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In831583246 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In831583246 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In831583246 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In831583246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| ~y$r_buff1_thd3~0_In831583246) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out831583246|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 21:26:23,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 21:26:23,908 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:26:23,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out167082366| |ULTIMATE.start_main_#t~ite58_Out167082366|)) (.cse2 (= (mod ~y$w_buff1_used~0_In167082366 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In167082366 256) 0))) (or (and (= ~y$w_buff1~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~y~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In167082366, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} OutVars{~y$w_buff1~0=~y$w_buff1~0_In167082366, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out167082366|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out167082366|, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:26:23,909 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-990102393 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-990102393 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-990102393 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-990102393|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 21:26:23,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1975282977 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1975282977 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1975282977 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1975282977 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1975282977 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1975282977|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:26:23,910 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In445612598 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In445612598 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out445612598| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out445612598| ~y$r_buff0_thd0~0_In445612598)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out445612598|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:26:23,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-101907614 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-101907614 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-101907614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-101907614 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-101907614|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-101907614 |ULTIMATE.start_main_#t~ite63_Out-101907614|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-101907614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:26:23,911 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:26:23,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:26:23 BasicIcfg [2019-12-07 21:26:23,973 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:26:23,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:26:23,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:26:23,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:26:23,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:25:06" (3/4) ... [2019-12-07 21:26:23,976 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:26:23,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~__unbuffered_cnt~0_191 0) (= v_~y$r_buff0_thd0~0_148 0) (= v_~y$r_buff1_thd0~0_211 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$mem_tmp~0_192 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25|)) (= 0 v_~y$r_buff0_thd3~0_503) (= v_~main$tmp_guard1~0_31 0) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd1~0_145 0) (= v_~__unbuffered_p1_EBX~0_40 0) (= v_~x~0_69 0) (= v_~y$w_buff0_used~0_960 0) (= |v_ULTIMATE.start_main_~#t156~0.offset_18| 0) (= 0 v_~__unbuffered_p1_EAX~0_58) (= 0 v_~y$r_buff0_thd2~0_341) (= v_~y$w_buff1~0_320 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~y$r_buff0_thd1~0_76 0) (= 0 v_~y$r_buff1_thd2~0_299) (= 0 |v_#NULL.base_6|) (= v_~__unbuffered_p2_EBX~0_33 0) (= v_~y$flush_delayed~0_267 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t156~0.base_25| 1) |v_#valid_62|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~z~0_25 0) (= 0 v_~weak$$choice0~0_179) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t156~0.base_25| 4) |v_#length_23|) (= v_~y~0_332 0) (= v_~main$tmp_guard0~0_26 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t156~0.base_25|) |v_ULTIMATE.start_main_~#t156~0.offset_18| 0))) (= 0 v_~y$w_buff0~0_491) (= v_~weak$$choice2~0_259 0) (= v_~y$w_buff1_used~0_583 0) (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~y$r_buff1_thd3~0_336) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t156~0.base_25|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_24|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, #NULL.offset=|v_#NULL.offset_6|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_19|, ~y$mem_tmp~0=v_~y$mem_tmp~0_192, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_336, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_58, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_76, ~y$flush_delayed~0=v_~y$flush_delayed~0_267, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ULTIMATE.start_main_~#t156~0.offset=|v_ULTIMATE.start_main_~#t156~0.offset_18|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_33, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_68|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_56|, ~weak$$choice0~0=v_~weak$$choice0~0_179, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_144|, ~y$w_buff1~0=v_~y$w_buff1~0_320, ~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_341, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_191, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_211, ~x~0=v_~x~0_69, ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_22|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_960, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_31, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_145, ~y$w_buff0~0=v_~y$w_buff0~0_491, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_503, ~y~0=v_~y~0_332, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_108|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_~#t156~0.base=|v_ULTIMATE.start_main_~#t156~0.base_25|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_32|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_299, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_46|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_26|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_148, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_25, ~weak$$choice2~0=v_~weak$$choice2~0_259, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_583} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, #NULL.offset, ~y$read_delayed~0, ULTIMATE.start_main_~#t157~0.offset, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t156~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t158~0.base, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t158~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t156~0.base, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 21:26:23,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L833-1-->L835: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t157~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t157~0.base_13|) |v_ULTIMATE.start_main_~#t157~0.offset_11| 1)) |v_#memory_int_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13| 1) |v_#valid_34|) (= |v_ULTIMATE.start_main_~#t157~0.offset_11| 0) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t157~0.base_13|)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t157~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t157~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t157~0.offset=|v_ULTIMATE.start_main_~#t157~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t157~0.base=|v_ULTIMATE.start_main_~#t157~0.base_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t157~0.offset, ULTIMATE.start_main_~#t157~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:26:23,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t158~0.base_12| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t158~0.base_12|) |v_ULTIMATE.start_main_~#t158~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t158~0.base_12| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t158~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t158~0.base_12|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t158~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t158~0.base=|v_ULTIMATE.start_main_~#t158~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t158~0.offset=|v_ULTIMATE.start_main_~#t158~0.offset_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t158~0.base, ULTIMATE.start_main_~#t158~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 21:26:23,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] L4-->L795: Formula: (and (= v_~y~0_46 v_~y$mem_tmp~0_31) (= |v_P2Thread1of1ForFork0_#t~nondet27_32| v_~weak$$choice2~0_67) (= v_~y$r_buff0_thd0~0_28 v_~y$r_buff1_thd0~0_28) (= 1 v_~y$r_buff0_thd3~0_110) (= v_~y$r_buff0_thd1~0_17 v_~y$r_buff1_thd1~0_17) (= |v_P2Thread1of1ForFork0_#t~nondet26_32| v_~weak$$choice0~0_28) (= v_~y$r_buff0_thd3~0_111 v_~y$r_buff1_thd3~0_58) (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44)) (= v_~y$r_buff0_thd2~0_91 v_~y$r_buff1_thd2~0_43) (= v_~weak$$choice2~0_67 v_~y$flush_delayed~0_40)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_111, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_32|, ~y~0=v_~y~0_46, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_32|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44} OutVars{P2Thread1of1ForFork0_#t~nondet27=|v_P2Thread1of1ForFork0_#t~nondet27_31|, P2Thread1of1ForFork0_#t~nondet26=|v_P2Thread1of1ForFork0_#t~nondet26_31|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_44, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, ~weak$$choice0~0=v_~weak$$choice0~0_28, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_17, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_58, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_28, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_91, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_17, ~y$flush_delayed~0=v_~y$flush_delayed~0_40, ~y~0=v_~y~0_46, ~weak$$choice2~0=v_~weak$$choice2~0_67, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_28} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~nondet27, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P2Thread1of1ForFork0_#t~nondet26] because there is no mapped edge [2019-12-07 21:26:23,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L795-2-->L795-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1182280660 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1182280660 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff1~0_In1182280660) (or .cse0 .cse1)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite28_Out1182280660| ~y$w_buff0~0_In1182280660) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1182280660|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1182280660, ~y$w_buff1~0=~y$w_buff1~0_In1182280660, ~y$w_buff0~0=~y$w_buff0~0_In1182280660, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1182280660} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 21:26:23,978 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L795-4-->L796: Formula: (= v_~y~0_60 |v_P2Thread1of1ForFork0_#t~ite28_10|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_10|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_9|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_5|, ~y~0=v_~y~0_60} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-07 21:26:23,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [900] [900] L800-->L801: Formula: (and (= v_~y$r_buff0_thd3~0_109 v_~y$r_buff0_thd3~0_108) (not (= (mod v_~weak$$choice2~0_66 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_66} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_108, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_6|, ~weak$$choice2~0=v_~weak$$choice2~0_66} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 21:26:23,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-443459144 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out-443459144| ~y$mem_tmp~0_In-443459144) (not .cse0)) (and .cse0 (= ~y~0_In-443459144 |P2Thread1of1ForFork0_#t~ite48_Out-443459144|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-443459144|, ~y$mem_tmp~0=~y$mem_tmp~0_In-443459144, ~y$flush_delayed~0=~y$flush_delayed~0_In-443459144, ~y~0=~y~0_In-443459144} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-07 21:26:23,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= v_~z~0_12 1) (= v_P0Thread1of1ForFork1_~arg.base_7 |v_P0Thread1of1ForFork1_#in~arg.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_7 |v_P0Thread1of1ForFork1_#in~arg.offset_9|) (= v_~x~0_40 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_9|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_12, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_9|, ~x~0=v_~x~0_40, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_7} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 21:26:23,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L766-->L766-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1344740600 256)))) (or (and (= ~y~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) .cse0) (and (= ~y$mem_tmp~0_In-1344740600 |P1Thread1of1ForFork2_#t~ite25_Out-1344740600|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1344740600, ~y$flush_delayed~0=~y$flush_delayed~0_In-1344740600, ~y~0=~y~0_In-1344740600, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out-1344740600|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 21:26:23,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~y$flush_delayed~0_118 0) (= v_~y~0_147 |v_P1Thread1of1ForFork2_#t~ite25_66|) (= (+ v_~__unbuffered_cnt~0_90 1) v_~__unbuffered_cnt~0_89)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_66|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_118, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89, ~y~0=v_~y~0_147, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_65|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 21:26:23,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [944] [944] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1447649185 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1447649185 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1447649185 |P2Thread1of1ForFork0_#t~ite51_Out1447649185|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1447649185, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1447649185, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1447649185|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-07 21:26:23,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1835832860 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1835832860 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In1835832860 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1835832860 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| ~y$w_buff1_used~0_In1835832860) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite52_Out1835832860| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1835832860, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1835832860, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1835832860, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out1835832860|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1835832860} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-07 21:26:23,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L813-->L814: Formula: (let ((.cse0 (= ~y$r_buff0_thd3~0_Out-738514053 ~y$r_buff0_thd3~0_In-738514053)) (.cse2 (= (mod ~y$w_buff0_used~0_In-738514053 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-738514053 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (not .cse2) (not .cse1) (= ~y$r_buff0_thd3~0_Out-738514053 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-738514053} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-738514053, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-738514053, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-738514053|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-07 21:26:23,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In831583246 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In831583246 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In831583246 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In831583246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork0_#t~ite54_Out831583246| ~y$r_buff1_thd3~0_In831583246) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In831583246, ~y$w_buff0_used~0=~y$w_buff0_used~0_In831583246, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out831583246|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In831583246, ~y$w_buff1_used~0=~y$w_buff1_used~0_In831583246} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-07 21:26:23,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L814-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= v_~__unbuffered_cnt~0_158 (+ v_~__unbuffered_cnt~0_159 1)) (= v_~y$r_buff1_thd3~0_276 |v_P2Thread1of1ForFork0_#t~ite54_34|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_159} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_276, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_158, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 21:26:23,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [889] [889] L837-1-->L843: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_18) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 21:26:23,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L843-2-->L843-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite59_Out167082366| |ULTIMATE.start_main_#t~ite58_Out167082366|)) (.cse2 (= (mod ~y$w_buff1_used~0_In167082366 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In167082366 256) 0))) (or (and (= ~y$w_buff1~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= ~y~0_In167082366 |ULTIMATE.start_main_#t~ite58_Out167082366|) (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In167082366, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} OutVars{~y$w_buff1~0=~y$w_buff1~0_In167082366, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out167082366|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out167082366|, ~y~0=~y~0_In167082366, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In167082366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In167082366} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:26:23,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L844-->L844-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-990102393 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-990102393 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-990102393 |ULTIMATE.start_main_#t~ite60_Out-990102393|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-990102393|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-990102393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-990102393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 21:26:23,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L845-->L845-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1975282977 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1975282977 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1975282977 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1975282977 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In-1975282977 |ULTIMATE.start_main_#t~ite61_Out-1975282977|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1975282977|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1975282977, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1975282977, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1975282977, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1975282977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:26:23,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [945] [945] L846-->L846-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In445612598 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In445612598 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite62_Out445612598| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out445612598| ~y$r_buff0_thd0~0_In445612598)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out445612598|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In445612598, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In445612598} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:26:23,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-101907614 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-101907614 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-101907614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-101907614 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite63_Out-101907614|)) (and (or .cse1 .cse0) (= ~y$r_buff1_thd0~0_In-101907614 |ULTIMATE.start_main_#t~ite63_Out-101907614|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-101907614|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-101907614, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-101907614, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-101907614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-101907614} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:26:23,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_~y$r_buff1_thd0~0_206 |v_ULTIMATE.start_main_#t~ite63_48|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_25 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_25 (ite (= (ite (not (and (= 2 v_~__unbuffered_p1_EAX~0_53) (= v_~x~0_64 2) (= v_~__unbuffered_p2_EBX~0_28 0) (= 1 v_~__unbuffered_p2_EAX~0_42) (= v_~__unbuffered_p1_EBX~0_35 0))) 1 0) 0) 0 1))) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_48|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_35, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_28, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_53, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_42, ~x~0=v_~x~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_206, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:26:24,049 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_26ed9b45-95af-4e11-902b-01adc7978b43/bin/utaipan/witness.graphml [2019-12-07 21:26:24,049 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:26:24,050 INFO L168 Benchmark]: Toolchain (without parser) took 78871.40 ms. Allocated memory was 1.0 GB in the beginning and 6.8 GB in the end (delta: 5.8 GB). Free memory was 936.2 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2019-12-07 21:26:24,050 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:26:24,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:26:24,051 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:26:24,051 INFO L168 Benchmark]: Boogie Preprocessor took 27.25 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:26:24,051 INFO L168 Benchmark]: RCFGBuilder took 443.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:26:24,051 INFO L168 Benchmark]: TraceAbstraction took 77824.53 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. [2019-12-07 21:26:24,052 INFO L168 Benchmark]: Witness Printer took 75.20 ms. Allocated memory is still 6.8 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:26:24,053 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 957.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 936.2 MB in the beginning and 1.1 GB in the end (delta: -142.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.76 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 443.34 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 77824.53 ms. Allocated memory was 1.1 GB in the beginning and 6.8 GB in the end (delta: 5.7 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.7 GB). Peak memory consumption was 3.0 GB. Max. memory is 11.5 GB. * Witness Printer took 75.20 ms. Allocated memory is still 6.8 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 55.5 MB). Peak memory consumption was 55.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 195 ProgramPointsBefore, 110 ProgramPointsAfterwards, 241 TransitionsBefore, 133 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 27 ChoiceCompositions, 9977 VarBasedMoverChecksPositive, 318 VarBasedMoverChecksNegative, 79 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 128241 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t156, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L835] FCALL, FORK 0 pthread_create(&t157, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t158, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] 3 y$w_buff1 = y$w_buff0 [L780] 3 y$w_buff0 = 1 [L781] 3 y$w_buff1_used = y$w_buff0_used [L782] 3 y$w_buff0_used = (_Bool)1 [L795] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L797] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L798] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y = y$flush_delayed ? y$mem_tmp : y [L804] 3 y$flush_delayed = (_Bool)0 [L807] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 2 x = 2 [L751] 2 __unbuffered_p1_EAX = x [L754] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 2 y$flush_delayed = weak$$choice2 [L757] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L759] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L760] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L761] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L761] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L763] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L764] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, 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))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L811] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L812] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L843] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L844] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L845] 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 [L846] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 186 locations, 2 error locations. Result: UNSAFE, OverallTime: 77.6s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5766 SDtfs, 6177 SDslu, 11917 SDs, 0 SdLazy, 6349 SolverSat, 322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 167 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=168072occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 49.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 430706 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 791 NumberOfCodeBlocks, 791 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 707 ConstructedInterpolants, 0 QuantifiedInterpolants, 239002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...