./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013_rmo.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_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/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 f50c7460610f7cc3f06e5c51e85d1b848cb1ed58 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 12:05:21,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 12:05:21,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 12:05:21,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 12:05:21,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 12:05:21,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 12:05:21,649 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 12:05:21,651 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 12:05:21,652 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 12:05:21,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 12:05:21,653 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 12:05:21,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 12:05:21,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 12:05:21,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 12:05:21,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 12:05:21,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 12:05:21,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 12:05:21,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 12:05:21,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 12:05:21,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 12:05:21,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 12:05:21,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 12:05:21,664 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 12:05:21,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 12:05:21,666 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 12:05:21,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 12:05:21,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 12:05:21,667 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 12:05:21,667 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 12:05:21,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 12:05:21,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 12:05:21,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 12:05:21,669 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 12:05:21,670 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 12:05:21,671 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 12:05:21,671 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 12:05:21,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 12:05:21,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 12:05:21,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 12:05:21,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 12:05:21,673 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 12:05:21,674 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 12:05:21,687 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 12:05:21,687 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 12:05:21,688 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 12:05:21,688 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 12:05:21,688 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 12:05:21,688 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 12:05:21,688 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 12:05:21,689 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 12:05:21,689 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 12:05:21,689 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 12:05:21,689 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 12:05:21,689 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 12:05:21,689 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 12:05:21,689 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 12:05:21,689 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 12:05:21,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 12:05:21,690 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 12:05:21,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 12:05:21,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 12:05:21,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 12:05:21,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 12:05:21,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 12:05:21,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 12:05:21,691 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 12:05:21,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 12:05:21,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 12:05:21,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 12:05:21,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 12:05:21,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 12:05:21,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 12:05:21,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 12:05:21,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 12:05:21,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 12:05:21,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 12:05:21,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 12:05:21,692 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 12:05:21,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 12:05:21,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 12:05:21,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 12:05:21,693 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 12:05:21,693 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_64767261-f988-4eba-9381-34ae827cce3e/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 -> f50c7460610f7cc3f06e5c51e85d1b848cb1ed58 [2019-12-07 12:05:21,792 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 12:05:21,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 12:05:21,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 12:05:21,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 12:05:21,804 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 12:05:21,805 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix013_rmo.opt.i [2019-12-07 12:05:21,843 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/data/59aaca5d9/1095676bbf784e5e9852ca046db67300/FLAGc002ab4cc [2019-12-07 12:05:22,217 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 12:05:22,217 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/sv-benchmarks/c/pthread-wmm/mix013_rmo.opt.i [2019-12-07 12:05:22,230 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/data/59aaca5d9/1095676bbf784e5e9852ca046db67300/FLAGc002ab4cc [2019-12-07 12:05:22,239 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/data/59aaca5d9/1095676bbf784e5e9852ca046db67300 [2019-12-07 12:05:22,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 12:05:22,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 12:05:22,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 12:05:22,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 12:05:22,244 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 12:05:22,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,246 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 12:05:22, skipping insertion in model container [2019-12-07 12:05:22,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 12:05:22,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 12:05:22,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:05:22,551 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 12:05:22,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 12:05:22,642 INFO L208 MainTranslator]: Completed translation [2019-12-07 12:05:22,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22 WrapperNode [2019-12-07 12:05:22,643 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 12:05:22,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 12:05:22,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 12:05:22,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 12:05:22,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,663 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,683 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 12:05:22,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 12:05:22,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 12:05:22,684 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 12:05:22,690 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,690 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,708 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... [2019-12-07 12:05:22,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 12:05:22,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 12:05:22,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 12:05:22,712 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 12:05:22,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/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 12:05:22,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 12:05:22,754 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 12:05:22,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 12:05:22,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 12:05:22,754 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 12:05:22,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 12:05:22,754 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 12:05:22,754 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 12:05:22,754 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 12:05:22,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 12:05:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 12:05:22,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 12:05:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 12:05:22,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 12:05:22,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 12:05:22,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 12:05:23,171 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 12:05:23,171 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 12:05:23,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:05:23 BoogieIcfgContainer [2019-12-07 12:05:23,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 12:05:23,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 12:05:23,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 12:05:23,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 12:05:23,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:05:22" (1/3) ... [2019-12-07 12:05:23,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477db663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:05:23, skipping insertion in model container [2019-12-07 12:05:23,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:05:22" (2/3) ... [2019-12-07 12:05:23,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477db663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:05:23, skipping insertion in model container [2019-12-07 12:05:23,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:05:23" (3/3) ... [2019-12-07 12:05:23,177 INFO L109 eAbstractionObserver]: Analyzing ICFG mix013_rmo.opt.i [2019-12-07 12:05:23,183 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 12:05:23,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 12:05:23,188 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 12:05:23,188 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 12:05:23,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,218 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,219 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,220 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,221 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,222 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,223 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,224 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,225 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,226 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,227 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,228 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,229 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,230 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,231 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,232 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,233 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,234 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,235 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,237 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,237 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,237 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,237 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,237 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,237 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,238 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,238 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,238 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,239 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,240 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,241 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,241 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,241 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,241 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,241 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,241 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,242 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,243 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,244 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,245 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,246 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,247 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,248 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,249 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,250 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,251 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,251 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,251 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,251 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,251 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,251 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,251 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,252 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,252 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,252 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,252 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,252 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,252 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,252 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,253 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,253 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,253 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,253 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,253 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,253 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,253 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,254 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,254 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,254 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,254 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,254 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,254 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,255 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,255 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,255 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,255 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,255 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 12:05:23,268 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 12:05:23,281 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 12:05:23,281 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 12:05:23,281 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 12:05:23,281 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 12:05:23,281 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 12:05:23,281 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 12:05:23,281 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 12:05:23,281 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 12:05:23,293 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 256 transitions [2019-12-07 12:05:23,294 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 12:05:23,375 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 12:05:23,375 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:05:23,389 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:05:23,412 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 12:05:23,458 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 12:05:23,458 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 12:05:23,467 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 12:05:23,494 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 12:05:23,495 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 12:05:27,379 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 12:05:27,720 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-07 12:05:27,753 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131114 [2019-12-07 12:05:27,753 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 12:05:27,755 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 12:05:37,308 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97990 states. [2019-12-07 12:05:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 97990 states. [2019-12-07 12:05:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 12:05:37,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:37,316 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:37,316 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:37,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash -904171455, now seen corresponding path program 1 times [2019-12-07 12:05:37,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:05:37,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112065255] [2019-12-07 12:05:37,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:37,500 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 12:05:37,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112065255] [2019-12-07 12:05:37,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:37,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:05:37,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189995442] [2019-12-07 12:05:37,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:37,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:05:37,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:37,515 INFO L87 Difference]: Start difference. First operand 97990 states. Second operand 3 states. [2019-12-07 12:05:38,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:38,353 INFO L93 Difference]: Finished difference Result 97126 states and 446136 transitions. [2019-12-07 12:05:38,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:38,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 12:05:38,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:38,891 INFO L225 Difference]: With dead ends: 97126 [2019-12-07 12:05:38,892 INFO L226 Difference]: Without dead ends: 90910 [2019-12-07 12:05:38,893 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 12:05:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90910 states. [2019-12-07 12:05:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90910 to 90910. [2019-12-07 12:05:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90910 states. [2019-12-07 12:05:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90910 states to 90910 states and 417332 transitions. [2019-12-07 12:05:42,318 INFO L78 Accepts]: Start accepts. Automaton has 90910 states and 417332 transitions. Word has length 9 [2019-12-07 12:05:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:42,319 INFO L462 AbstractCegarLoop]: Abstraction has 90910 states and 417332 transitions. [2019-12-07 12:05:42,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:05:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 90910 states and 417332 transitions. [2019-12-07 12:05:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 12:05:42,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:42,326 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:42,326 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1686431172, now seen corresponding path program 1 times [2019-12-07 12:05:42,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:05:42,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727567060] [2019-12-07 12:05:42,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:42,385 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 12:05:42,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727567060] [2019-12-07 12:05:42,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:42,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:05:42,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942221012] [2019-12-07 12:05:42,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:05:42,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:05:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:05:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:05:42,387 INFO L87 Difference]: Start difference. First operand 90910 states and 417332 transitions. Second operand 4 states. [2019-12-07 12:05:45,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:45,074 INFO L93 Difference]: Finished difference Result 140998 states and 625524 transitions. [2019-12-07 12:05:45,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:05:45,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 12:05:45,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:45,503 INFO L225 Difference]: With dead ends: 140998 [2019-12-07 12:05:45,503 INFO L226 Difference]: Without dead ends: 140930 [2019-12-07 12:05:45,504 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 12:05:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140930 states. [2019-12-07 12:05:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140930 to 137862. [2019-12-07 12:05:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137862 states. [2019-12-07 12:05:49,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137862 states to 137862 states and 614280 transitions. [2019-12-07 12:05:49,964 INFO L78 Accepts]: Start accepts. Automaton has 137862 states and 614280 transitions. Word has length 15 [2019-12-07 12:05:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:49,964 INFO L462 AbstractCegarLoop]: Abstraction has 137862 states and 614280 transitions. [2019-12-07 12:05:49,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:05:49,965 INFO L276 IsEmpty]: Start isEmpty. Operand 137862 states and 614280 transitions. [2019-12-07 12:05:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 12:05:49,971 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:49,971 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 12:05:49,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:49,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -806058920, now seen corresponding path program 1 times [2019-12-07 12:05:49,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:05:49,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752782913] [2019-12-07 12:05:49,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:50,018 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 12:05:50,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752782913] [2019-12-07 12:05:50,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:50,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:05:50,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120443736] [2019-12-07 12:05:50,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:05:50,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:05:50,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:05:50,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:05:50,019 INFO L87 Difference]: Start difference. First operand 137862 states and 614280 transitions. Second operand 4 states. [2019-12-07 12:05:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:51,422 INFO L93 Difference]: Finished difference Result 175654 states and 773028 transitions. [2019-12-07 12:05:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:05:51,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 12:05:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:05:51,909 INFO L225 Difference]: With dead ends: 175654 [2019-12-07 12:05:51,909 INFO L226 Difference]: Without dead ends: 175594 [2019-12-07 12:05:51,909 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 12:05:53,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175594 states. [2019-12-07 12:05:58,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175594 to 157746. [2019-12-07 12:05:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157746 states. [2019-12-07 12:05:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157746 states to 157746 states and 699816 transitions. [2019-12-07 12:05:59,008 INFO L78 Accepts]: Start accepts. Automaton has 157746 states and 699816 transitions. Word has length 18 [2019-12-07 12:05:59,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:05:59,008 INFO L462 AbstractCegarLoop]: Abstraction has 157746 states and 699816 transitions. [2019-12-07 12:05:59,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:05:59,008 INFO L276 IsEmpty]: Start isEmpty. Operand 157746 states and 699816 transitions. [2019-12-07 12:05:59,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 12:05:59,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:05:59,024 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:05:59,024 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:05:59,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:05:59,024 INFO L82 PathProgramCache]: Analyzing trace with hash 363406382, now seen corresponding path program 1 times [2019-12-07 12:05:59,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:05:59,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660853771] [2019-12-07 12:05:59,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:05:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:05:59,113 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 12:05:59,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660853771] [2019-12-07 12:05:59,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:05:59,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 12:05:59,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931538050] [2019-12-07 12:05:59,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:05:59,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:05:59,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:05:59,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:05:59,114 INFO L87 Difference]: Start difference. First operand 157746 states and 699816 transitions. Second operand 3 states. [2019-12-07 12:05:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:05:59,848 INFO L93 Difference]: Finished difference Result 155822 states and 688606 transitions. [2019-12-07 12:05:59,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:05:59,848 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 12:05:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:00,287 INFO L225 Difference]: With dead ends: 155822 [2019-12-07 12:06:00,287 INFO L226 Difference]: Without dead ends: 155822 [2019-12-07 12:06:00,287 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 12:06:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155822 states. [2019-12-07 12:06:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155822 to 155675. [2019-12-07 12:06:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155675 states. [2019-12-07 12:06:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155675 states to 155675 states and 688262 transitions. [2019-12-07 12:06:08,386 INFO L78 Accepts]: Start accepts. Automaton has 155675 states and 688262 transitions. Word has length 20 [2019-12-07 12:06:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:08,386 INFO L462 AbstractCegarLoop]: Abstraction has 155675 states and 688262 transitions. [2019-12-07 12:06:08,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 155675 states and 688262 transitions. [2019-12-07 12:06:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:06:08,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:08,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:08,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash 811087671, now seen corresponding path program 1 times [2019-12-07 12:06:08,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:08,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088486856] [2019-12-07 12:06:08,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:08,480 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 12:06:08,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088486856] [2019-12-07 12:06:08,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:08,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:08,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758181039] [2019-12-07 12:06:08,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:08,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:08,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:08,481 INFO L87 Difference]: Start difference. First operand 155675 states and 688262 transitions. Second operand 4 states. [2019-12-07 12:06:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:09,200 INFO L93 Difference]: Finished difference Result 151548 states and 668911 transitions. [2019-12-07 12:06:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:06:09,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:06:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:09,613 INFO L225 Difference]: With dead ends: 151548 [2019-12-07 12:06:09,613 INFO L226 Difference]: Without dead ends: 151548 [2019-12-07 12:06:09,614 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 12:06:11,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151548 states. [2019-12-07 12:06:13,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151548 to 151454. [2019-12-07 12:06:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151454 states. [2019-12-07 12:06:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151454 states to 151454 states and 668710 transitions. [2019-12-07 12:06:14,227 INFO L78 Accepts]: Start accepts. Automaton has 151454 states and 668710 transitions. Word has length 21 [2019-12-07 12:06:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:14,228 INFO L462 AbstractCegarLoop]: Abstraction has 151454 states and 668710 transitions. [2019-12-07 12:06:14,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 151454 states and 668710 transitions. [2019-12-07 12:06:14,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 12:06:14,245 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:14,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:14,246 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:14,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:14,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1655339094, now seen corresponding path program 1 times [2019-12-07 12:06:14,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:14,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474488921] [2019-12-07 12:06:14,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:14,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:14,310 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 12:06:14,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474488921] [2019-12-07 12:06:14,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:14,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:14,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863520507] [2019-12-07 12:06:14,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:14,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:14,311 INFO L87 Difference]: Start difference. First operand 151454 states and 668710 transitions. Second operand 4 states. [2019-12-07 12:06:15,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:15,464 INFO L93 Difference]: Finished difference Result 146958 states and 650586 transitions. [2019-12-07 12:06:15,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:15,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 12:06:15,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:15,842 INFO L225 Difference]: With dead ends: 146958 [2019-12-07 12:06:15,842 INFO L226 Difference]: Without dead ends: 146958 [2019-12-07 12:06:15,843 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 12:06:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146958 states. [2019-12-07 12:06:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146958 to 146958. [2019-12-07 12:06:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146958 states. [2019-12-07 12:06:20,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146958 states to 146958 states and 650586 transitions. [2019-12-07 12:06:20,535 INFO L78 Accepts]: Start accepts. Automaton has 146958 states and 650586 transitions. Word has length 21 [2019-12-07 12:06:20,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:20,535 INFO L462 AbstractCegarLoop]: Abstraction has 146958 states and 650586 transitions. [2019-12-07 12:06:20,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:20,536 INFO L276 IsEmpty]: Start isEmpty. Operand 146958 states and 650586 transitions. [2019-12-07 12:06:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 12:06:20,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:20,564 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] [2019-12-07 12:06:20,564 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:20,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:20,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1517939491, now seen corresponding path program 1 times [2019-12-07 12:06:20,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:20,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181044076] [2019-12-07 12:06:20,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:20,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:06:20,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181044076] [2019-12-07 12:06:20,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:20,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:20,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005772724] [2019-12-07 12:06:20,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:06:20,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:20,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:06:20,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:06:20,601 INFO L87 Difference]: Start difference. First operand 146958 states and 650586 transitions. Second operand 5 states. [2019-12-07 12:06:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:21,799 INFO L93 Difference]: Finished difference Result 173476 states and 759175 transitions. [2019-12-07 12:06:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:06:21,800 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 12:06:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:22,255 INFO L225 Difference]: With dead ends: 173476 [2019-12-07 12:06:22,255 INFO L226 Difference]: Without dead ends: 173368 [2019-12-07 12:06:22,255 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 12:06:24,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173368 states. [2019-12-07 12:06:29,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173368 to 146002. [2019-12-07 12:06:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146002 states. [2019-12-07 12:06:29,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146002 states to 146002 states and 646690 transitions. [2019-12-07 12:06:29,530 INFO L78 Accepts]: Start accepts. Automaton has 146002 states and 646690 transitions. Word has length 24 [2019-12-07 12:06:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:29,530 INFO L462 AbstractCegarLoop]: Abstraction has 146002 states and 646690 transitions. [2019-12-07 12:06:29,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:06:29,531 INFO L276 IsEmpty]: Start isEmpty. Operand 146002 states and 646690 transitions. [2019-12-07 12:06:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:06:29,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:29,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:29,692 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash -50185163, now seen corresponding path program 1 times [2019-12-07 12:06:29,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:29,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664203445] [2019-12-07 12:06:29,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:29,757 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 12:06:29,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664203445] [2019-12-07 12:06:29,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:29,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:29,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614208377] [2019-12-07 12:06:29,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:06:29,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:29,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:06:29,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:06:29,759 INFO L87 Difference]: Start difference. First operand 146002 states and 646690 transitions. Second operand 5 states. [2019-12-07 12:06:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:31,259 INFO L93 Difference]: Finished difference Result 206528 states and 928582 transitions. [2019-12-07 12:06:31,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 12:06:31,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 12:06:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:31,836 INFO L225 Difference]: With dead ends: 206528 [2019-12-07 12:06:31,837 INFO L226 Difference]: Without dead ends: 206528 [2019-12-07 12:06:31,837 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 12:06:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206528 states. [2019-12-07 12:06:37,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206528 to 197950. [2019-12-07 12:06:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197950 states. [2019-12-07 12:06:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197950 states to 197950 states and 891532 transitions. [2019-12-07 12:06:38,227 INFO L78 Accepts]: Start accepts. Automaton has 197950 states and 891532 transitions. Word has length 35 [2019-12-07 12:06:38,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:38,227 INFO L462 AbstractCegarLoop]: Abstraction has 197950 states and 891532 transitions. [2019-12-07 12:06:38,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:06:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 197950 states and 891532 transitions. [2019-12-07 12:06:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:06:38,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:38,470 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:38,470 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:38,470 INFO L82 PathProgramCache]: Analyzing trace with hash 133673921, now seen corresponding path program 2 times [2019-12-07 12:06:38,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:38,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083820793] [2019-12-07 12:06:38,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:38,510 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 12:06:38,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083820793] [2019-12-07 12:06:38,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:38,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:38,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748689661] [2019-12-07 12:06:38,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:06:38,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:38,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:06:38,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:38,511 INFO L87 Difference]: Start difference. First operand 197950 states and 891532 transitions. Second operand 3 states. [2019-12-07 12:06:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:39,597 INFO L93 Difference]: Finished difference Result 154407 states and 646174 transitions. [2019-12-07 12:06:39,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:39,598 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-07 12:06:39,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:39,966 INFO L225 Difference]: With dead ends: 154407 [2019-12-07 12:06:39,966 INFO L226 Difference]: Without dead ends: 154407 [2019-12-07 12:06:39,966 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 12:06:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154407 states. [2019-12-07 12:06:45,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154407 to 154407. [2019-12-07 12:06:45,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154407 states. [2019-12-07 12:06:46,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154407 states to 154407 states and 646174 transitions. [2019-12-07 12:06:46,215 INFO L78 Accepts]: Start accepts. Automaton has 154407 states and 646174 transitions. Word has length 35 [2019-12-07 12:06:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:46,215 INFO L462 AbstractCegarLoop]: Abstraction has 154407 states and 646174 transitions. [2019-12-07 12:06:46,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:46,216 INFO L276 IsEmpty]: Start isEmpty. Operand 154407 states and 646174 transitions. [2019-12-07 12:06:46,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 12:06:46,371 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:46,371 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:06:46,372 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:46,372 INFO L82 PathProgramCache]: Analyzing trace with hash -602400245, now seen corresponding path program 3 times [2019-12-07 12:06:46,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:46,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776936535] [2019-12-07 12:06:46,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:46,411 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 12:06:46,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776936535] [2019-12-07 12:06:46,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:46,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:06:46,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27055129] [2019-12-07 12:06:46,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:06:46,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:46,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:06:46,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:06:46,412 INFO L87 Difference]: Start difference. First operand 154407 states and 646174 transitions. Second operand 4 states. [2019-12-07 12:06:46,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:46,940 INFO L93 Difference]: Finished difference Result 63851 states and 227351 transitions. [2019-12-07 12:06:46,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 12:06:46,941 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 12:06:46,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:47,059 INFO L225 Difference]: With dead ends: 63851 [2019-12-07 12:06:47,059 INFO L226 Difference]: Without dead ends: 63851 [2019-12-07 12:06:47,059 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 12:06:47,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63851 states. [2019-12-07 12:06:48,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63851 to 63783. [2019-12-07 12:06:48,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63783 states. [2019-12-07 12:06:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63783 states to 63783 states and 227121 transitions. [2019-12-07 12:06:48,422 INFO L78 Accepts]: Start accepts. Automaton has 63783 states and 227121 transitions. Word has length 35 [2019-12-07 12:06:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:48,422 INFO L462 AbstractCegarLoop]: Abstraction has 63783 states and 227121 transitions. [2019-12-07 12:06:48,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:06:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 63783 states and 227121 transitions. [2019-12-07 12:06:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 12:06:48,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:48,471 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] [2019-12-07 12:06:48,471 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash -283020318, now seen corresponding path program 1 times [2019-12-07 12:06:48,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:48,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080208414] [2019-12-07 12:06:48,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:48,509 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 12:06:48,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080208414] [2019-12-07 12:06:48,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:48,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 12:06:48,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804585591] [2019-12-07 12:06:48,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 12:06:48,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 12:06:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 12:06:48,511 INFO L87 Difference]: Start difference. First operand 63783 states and 227121 transitions. Second operand 3 states. [2019-12-07 12:06:48,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:48,732 INFO L93 Difference]: Finished difference Result 60370 states and 212088 transitions. [2019-12-07 12:06:48,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 12:06:48,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-12-07 12:06:48,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:48,844 INFO L225 Difference]: With dead ends: 60370 [2019-12-07 12:06:48,844 INFO L226 Difference]: Without dead ends: 60370 [2019-12-07 12:06:48,844 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 12:06:49,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60370 states. [2019-12-07 12:06:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60370 to 60143. [2019-12-07 12:06:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60143 states. [2019-12-07 12:06:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60143 states to 60143 states and 211412 transitions. [2019-12-07 12:06:50,395 INFO L78 Accepts]: Start accepts. Automaton has 60143 states and 211412 transitions. Word has length 36 [2019-12-07 12:06:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:50,395 INFO L462 AbstractCegarLoop]: Abstraction has 60143 states and 211412 transitions. [2019-12-07 12:06:50,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 12:06:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 60143 states and 211412 transitions. [2019-12-07 12:06:50,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:06:50,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:50,443 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] [2019-12-07 12:06:50,443 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1998943296, now seen corresponding path program 1 times [2019-12-07 12:06:50,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:50,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544270912] [2019-12-07 12:06:50,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:50,561 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 12:06:50,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544270912] [2019-12-07 12:06:50,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:50,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:06:50,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723875238] [2019-12-07 12:06:50,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:06:50,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:50,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:06:50,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:06:50,562 INFO L87 Difference]: Start difference. First operand 60143 states and 211412 transitions. Second operand 7 states. [2019-12-07 12:06:51,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:51,011 INFO L93 Difference]: Finished difference Result 78273 states and 275874 transitions. [2019-12-07 12:06:51,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 12:06:51,012 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-07 12:06:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:51,150 INFO L225 Difference]: With dead ends: 78273 [2019-12-07 12:06:51,150 INFO L226 Difference]: Without dead ends: 78273 [2019-12-07 12:06:51,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:06:51,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78273 states. [2019-12-07 12:06:52,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78273 to 62121. [2019-12-07 12:06:52,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62121 states. [2019-12-07 12:06:52,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62121 states to 62121 states and 218836 transitions. [2019-12-07 12:06:52,780 INFO L78 Accepts]: Start accepts. Automaton has 62121 states and 218836 transitions. Word has length 37 [2019-12-07 12:06:52,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:52,781 INFO L462 AbstractCegarLoop]: Abstraction has 62121 states and 218836 transitions. [2019-12-07 12:06:52,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:06:52,781 INFO L276 IsEmpty]: Start isEmpty. Operand 62121 states and 218836 transitions. [2019-12-07 12:06:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 12:06:52,828 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:52,829 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] [2019-12-07 12:06:52,829 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:52,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:52,829 INFO L82 PathProgramCache]: Analyzing trace with hash 2006383964, now seen corresponding path program 2 times [2019-12-07 12:06:52,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:52,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234481973] [2019-12-07 12:06:52,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:06:52,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234481973] [2019-12-07 12:06:52,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:52,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:06:52,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519971788] [2019-12-07 12:06:52,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:06:52,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:52,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:06:52,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:06:52,902 INFO L87 Difference]: Start difference. First operand 62121 states and 218836 transitions. Second operand 9 states. [2019-12-07 12:06:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:53,882 INFO L93 Difference]: Finished difference Result 134574 states and 469324 transitions. [2019-12-07 12:06:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 12:06:53,882 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2019-12-07 12:06:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:54,100 INFO L225 Difference]: With dead ends: 134574 [2019-12-07 12:06:54,100 INFO L226 Difference]: Without dead ends: 113422 [2019-12-07 12:06:54,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-07 12:06:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113422 states. [2019-12-07 12:06:56,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113422 to 80289. [2019-12-07 12:06:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80289 states. [2019-12-07 12:06:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80289 states to 80289 states and 282853 transitions. [2019-12-07 12:06:56,250 INFO L78 Accepts]: Start accepts. Automaton has 80289 states and 282853 transitions. Word has length 37 [2019-12-07 12:06:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:56,251 INFO L462 AbstractCegarLoop]: Abstraction has 80289 states and 282853 transitions. [2019-12-07 12:06:56,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:06:56,251 INFO L276 IsEmpty]: Start isEmpty. Operand 80289 states and 282853 transitions. [2019-12-07 12:06:56,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 12:06:56,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:56,330 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] [2019-12-07 12:06:56,330 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:56,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:56,331 INFO L82 PathProgramCache]: Analyzing trace with hash -502050099, now seen corresponding path program 1 times [2019-12-07 12:06:56,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:56,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60575580] [2019-12-07 12:06:56,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:56,371 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 12:06:56,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60575580] [2019-12-07 12:06:56,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:56,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:06:56,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371388801] [2019-12-07 12:06:56,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:06:56,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:06:56,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:06:56,373 INFO L87 Difference]: Start difference. First operand 80289 states and 282853 transitions. Second operand 5 states. [2019-12-07 12:06:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:56,449 INFO L93 Difference]: Finished difference Result 18104 states and 62875 transitions. [2019-12-07 12:06:56,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:06:56,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 12:06:56,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:56,476 INFO L225 Difference]: With dead ends: 18104 [2019-12-07 12:06:56,477 INFO L226 Difference]: Without dead ends: 18104 [2019-12-07 12:06:56,477 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 12:06:56,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18104 states. [2019-12-07 12:06:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18104 to 16632. [2019-12-07 12:06:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16632 states. [2019-12-07 12:06:56,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16632 states to 16632 states and 57519 transitions. [2019-12-07 12:06:56,720 INFO L78 Accepts]: Start accepts. Automaton has 16632 states and 57519 transitions. Word has length 38 [2019-12-07 12:06:56,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:56,720 INFO L462 AbstractCegarLoop]: Abstraction has 16632 states and 57519 transitions. [2019-12-07 12:06:56,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:06:56,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16632 states and 57519 transitions. [2019-12-07 12:06:56,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:06:56,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:56,738 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] [2019-12-07 12:06:56,738 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:56,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:56,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1651509924, now seen corresponding path program 1 times [2019-12-07 12:06:56,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:56,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307426513] [2019-12-07 12:06:56,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:56,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:56,953 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 12:06:56,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307426513] [2019-12-07 12:06:56,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:56,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 12:06:56,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610089675] [2019-12-07 12:06:56,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 12:06:56,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:56,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 12:06:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-07 12:06:56,954 INFO L87 Difference]: Start difference. First operand 16632 states and 57519 transitions. Second operand 9 states. [2019-12-07 12:06:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:06:58,056 INFO L93 Difference]: Finished difference Result 30837 states and 96990 transitions. [2019-12-07 12:06:58,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:06:58,056 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-12-07 12:06:58,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:06:58,096 INFO L225 Difference]: With dead ends: 30837 [2019-12-07 12:06:58,096 INFO L226 Difference]: Without dead ends: 29733 [2019-12-07 12:06:58,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2019-12-07 12:06:58,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29733 states. [2019-12-07 12:06:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29733 to 21811. [2019-12-07 12:06:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21811 states. [2019-12-07 12:06:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21811 states to 21811 states and 73324 transitions. [2019-12-07 12:06:58,485 INFO L78 Accepts]: Start accepts. Automaton has 21811 states and 73324 transitions. Word has length 49 [2019-12-07 12:06:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:06:58,485 INFO L462 AbstractCegarLoop]: Abstraction has 21811 states and 73324 transitions. [2019-12-07 12:06:58,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 12:06:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 21811 states and 73324 transitions. [2019-12-07 12:06:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:06:58,507 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:06:58,507 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] [2019-12-07 12:06:58,508 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:06:58,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:06:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1529555924, now seen corresponding path program 2 times [2019-12-07 12:06:58,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:06:58,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955670850] [2019-12-07 12:06:58,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:06:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:06:58,731 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 12:06:58,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955670850] [2019-12-07 12:06:58,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:06:58,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 12:06:58,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148962845] [2019-12-07 12:06:58,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 12:06:58,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:06:58,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 12:06:58,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 12:06:58,733 INFO L87 Difference]: Start difference. First operand 21811 states and 73324 transitions. Second operand 11 states. [2019-12-07 12:07:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:00,464 INFO L93 Difference]: Finished difference Result 31239 states and 97907 transitions. [2019-12-07 12:07:00,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 12:07:00,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2019-12-07 12:07:00,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:00,502 INFO L225 Difference]: With dead ends: 31239 [2019-12-07 12:07:00,502 INFO L226 Difference]: Without dead ends: 28147 [2019-12-07 12:07:00,502 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:07:00,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28147 states. [2019-12-07 12:07:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28147 to 24018. [2019-12-07 12:07:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24018 states. [2019-12-07 12:07:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24018 states to 24018 states and 80211 transitions. [2019-12-07 12:07:00,899 INFO L78 Accepts]: Start accepts. Automaton has 24018 states and 80211 transitions. Word has length 49 [2019-12-07 12:07:00,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:00,899 INFO L462 AbstractCegarLoop]: Abstraction has 24018 states and 80211 transitions. [2019-12-07 12:07:00,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 12:07:00,899 INFO L276 IsEmpty]: Start isEmpty. Operand 24018 states and 80211 transitions. [2019-12-07 12:07:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:07:00,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:00,925 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] [2019-12-07 12:07:00,925 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:00,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash -87410594, now seen corresponding path program 3 times [2019-12-07 12:07:00,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:00,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189326077] [2019-12-07 12:07:00,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:00,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:01,163 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 12:07:01,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189326077] [2019-12-07 12:07:01,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:01,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:07:01,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131485401] [2019-12-07 12:07:01,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:07:01,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:07:01,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:07:01,165 INFO L87 Difference]: Start difference. First operand 24018 states and 80211 transitions. Second operand 10 states. [2019-12-07 12:07:04,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:04,020 INFO L93 Difference]: Finished difference Result 58009 states and 178277 transitions. [2019-12-07 12:07:04,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 12:07:04,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-12-07 12:07:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:04,101 INFO L225 Difference]: With dead ends: 58009 [2019-12-07 12:07:04,101 INFO L226 Difference]: Without dead ends: 57513 [2019-12-07 12:07:04,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-07 12:07:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57513 states. [2019-12-07 12:07:04,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57513 to 40633. [2019-12-07 12:07:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40633 states. [2019-12-07 12:07:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40633 states to 40633 states and 134265 transitions. [2019-12-07 12:07:04,908 INFO L78 Accepts]: Start accepts. Automaton has 40633 states and 134265 transitions. Word has length 49 [2019-12-07 12:07:04,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:04,908 INFO L462 AbstractCegarLoop]: Abstraction has 40633 states and 134265 transitions. [2019-12-07 12:07:04,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:07:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 40633 states and 134265 transitions. [2019-12-07 12:07:04,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:07:04,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:04,954 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] [2019-12-07 12:07:04,954 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:04,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:04,954 INFO L82 PathProgramCache]: Analyzing trace with hash -573993964, now seen corresponding path program 4 times [2019-12-07 12:07:04,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:04,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109241392] [2019-12-07 12:07:04,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:05,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:07:05,114 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109241392] [2019-12-07 12:07:05,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:05,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 12:07:05,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679817680] [2019-12-07 12:07:05,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 12:07:05,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:05,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 12:07:05,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 12:07:05,115 INFO L87 Difference]: Start difference. First operand 40633 states and 134265 transitions. Second operand 10 states. [2019-12-07 12:07:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:08,268 INFO L93 Difference]: Finished difference Result 69555 states and 209053 transitions. [2019-12-07 12:07:08,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 12:07:08,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2019-12-07 12:07:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:08,375 INFO L225 Difference]: With dead ends: 69555 [2019-12-07 12:07:08,375 INFO L226 Difference]: Without dead ends: 69423 [2019-12-07 12:07:08,375 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-12-07 12:07:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69423 states. [2019-12-07 12:07:09,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69423 to 41622. [2019-12-07 12:07:09,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41622 states. [2019-12-07 12:07:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41622 states to 41622 states and 136874 transitions. [2019-12-07 12:07:09,270 INFO L78 Accepts]: Start accepts. Automaton has 41622 states and 136874 transitions. Word has length 49 [2019-12-07 12:07:09,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:09,270 INFO L462 AbstractCegarLoop]: Abstraction has 41622 states and 136874 transitions. [2019-12-07 12:07:09,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 12:07:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 41622 states and 136874 transitions. [2019-12-07 12:07:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 12:07:09,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:09,318 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] [2019-12-07 12:07:09,318 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:09,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:09,318 INFO L82 PathProgramCache]: Analyzing trace with hash -256762338, now seen corresponding path program 5 times [2019-12-07 12:07:09,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:09,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385447609] [2019-12-07 12:07:09,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:09,364 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 12:07:09,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385447609] [2019-12-07 12:07:09,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:09,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:07:09,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810751059] [2019-12-07 12:07:09,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 12:07:09,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 12:07:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:07:09,365 INFO L87 Difference]: Start difference. First operand 41622 states and 136874 transitions. Second operand 6 states. [2019-12-07 12:07:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:09,515 INFO L93 Difference]: Finished difference Result 38617 states and 129885 transitions. [2019-12-07 12:07:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:07:09,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 12:07:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:09,575 INFO L225 Difference]: With dead ends: 38617 [2019-12-07 12:07:09,575 INFO L226 Difference]: Without dead ends: 36034 [2019-12-07 12:07:09,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:07:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36034 states. [2019-12-07 12:07:10,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36034 to 28671. [2019-12-07 12:07:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28671 states. [2019-12-07 12:07:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28671 states to 28671 states and 93903 transitions. [2019-12-07 12:07:10,078 INFO L78 Accepts]: Start accepts. Automaton has 28671 states and 93903 transitions. Word has length 49 [2019-12-07 12:07:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:10,078 INFO L462 AbstractCegarLoop]: Abstraction has 28671 states and 93903 transitions. [2019-12-07 12:07:10,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 12:07:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 28671 states and 93903 transitions. [2019-12-07 12:07:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:07:10,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:10,112 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:10,112 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1625603190, now seen corresponding path program 1 times [2019-12-07 12:07:10,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:10,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699903369] [2019-12-07 12:07:10,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:07:10,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699903369] [2019-12-07 12:07:10,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:10,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 12:07:10,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611167682] [2019-12-07 12:07:10,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 12:07:10,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 12:07:10,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 12:07:10,204 INFO L87 Difference]: Start difference. First operand 28671 states and 93903 transitions. Second operand 7 states. [2019-12-07 12:07:10,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:10,476 INFO L93 Difference]: Finished difference Result 53232 states and 174606 transitions. [2019-12-07 12:07:10,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 12:07:10,476 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 12:07:10,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:10,540 INFO L225 Difference]: With dead ends: 53232 [2019-12-07 12:07:10,541 INFO L226 Difference]: Without dead ends: 41798 [2019-12-07 12:07:10,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-07 12:07:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41798 states. [2019-12-07 12:07:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41798 to 31096. [2019-12-07 12:07:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31096 states. [2019-12-07 12:07:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31096 states to 31096 states and 101006 transitions. [2019-12-07 12:07:11,107 INFO L78 Accepts]: Start accepts. Automaton has 31096 states and 101006 transitions. Word has length 65 [2019-12-07 12:07:11,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:11,107 INFO L462 AbstractCegarLoop]: Abstraction has 31096 states and 101006 transitions. [2019-12-07 12:07:11,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 12:07:11,107 INFO L276 IsEmpty]: Start isEmpty. Operand 31096 states and 101006 transitions. [2019-12-07 12:07:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:07:11,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:11,142 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:11,142 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:11,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 251196528, now seen corresponding path program 2 times [2019-12-07 12:07:11,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:11,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071187359] [2019-12-07 12:07:11,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 12:07:11,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071187359] [2019-12-07 12:07:11,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:11,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:07:11,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951984415] [2019-12-07 12:07:11,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:07:11,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:11,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:07:11,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:07:11,203 INFO L87 Difference]: Start difference. First operand 31096 states and 101006 transitions. Second operand 5 states. [2019-12-07 12:07:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:11,314 INFO L93 Difference]: Finished difference Result 32619 states and 105058 transitions. [2019-12-07 12:07:11,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:07:11,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 12:07:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:11,341 INFO L225 Difference]: With dead ends: 32619 [2019-12-07 12:07:11,341 INFO L226 Difference]: Without dead ends: 15912 [2019-12-07 12:07:11,341 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:07:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15912 states. [2019-12-07 12:07:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15912 to 15912. [2019-12-07 12:07:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15912 states. [2019-12-07 12:07:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15912 states to 15912 states and 48852 transitions. [2019-12-07 12:07:11,555 INFO L78 Accepts]: Start accepts. Automaton has 15912 states and 48852 transitions. Word has length 65 [2019-12-07 12:07:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:11,555 INFO L462 AbstractCegarLoop]: Abstraction has 15912 states and 48852 transitions. [2019-12-07 12:07:11,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:07:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15912 states and 48852 transitions. [2019-12-07 12:07:11,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:07:11,571 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:11,571 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:11,571 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:11,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:11,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1684460386, now seen corresponding path program 3 times [2019-12-07 12:07:11,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:11,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387245221] [2019-12-07 12:07:11,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:11,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:11,621 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 12:07:11,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387245221] [2019-12-07 12:07:11,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:11,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:07:11,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477267012] [2019-12-07 12:07:11,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:07:11,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:11,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:07:11,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:07:11,622 INFO L87 Difference]: Start difference. First operand 15912 states and 48852 transitions. Second operand 4 states. [2019-12-07 12:07:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:11,690 INFO L93 Difference]: Finished difference Result 16844 states and 50999 transitions. [2019-12-07 12:07:11,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:07:11,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 12:07:11,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:11,706 INFO L225 Difference]: With dead ends: 16844 [2019-12-07 12:07:11,706 INFO L226 Difference]: Without dead ends: 13511 [2019-12-07 12:07:11,707 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:07:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13511 states. [2019-12-07 12:07:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13511 to 11425. [2019-12-07 12:07:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11425 states. [2019-12-07 12:07:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11425 states to 11425 states and 34281 transitions. [2019-12-07 12:07:11,858 INFO L78 Accepts]: Start accepts. Automaton has 11425 states and 34281 transitions. Word has length 65 [2019-12-07 12:07:11,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:11,858 INFO L462 AbstractCegarLoop]: Abstraction has 11425 states and 34281 transitions. [2019-12-07 12:07:11,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:07:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 11425 states and 34281 transitions. [2019-12-07 12:07:11,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 12:07:11,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:11,869 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:11,869 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:11,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:11,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1552413418, now seen corresponding path program 4 times [2019-12-07 12:07:11,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:11,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444783941] [2019-12-07 12:07:11,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:11,919 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 12:07:11,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444783941] [2019-12-07 12:07:11,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:11,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 12:07:11,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213686627] [2019-12-07 12:07:11,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 12:07:11,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 12:07:11,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 12:07:11,921 INFO L87 Difference]: Start difference. First operand 11425 states and 34281 transitions. Second operand 4 states. [2019-12-07 12:07:11,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:11,997 INFO L93 Difference]: Finished difference Result 16406 states and 47555 transitions. [2019-12-07 12:07:11,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:07:11,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 12:07:11,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:12,013 INFO L225 Difference]: With dead ends: 16406 [2019-12-07 12:07:12,013 INFO L226 Difference]: Without dead ends: 14413 [2019-12-07 12:07:12,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:07:12,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14413 states. [2019-12-07 12:07:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14413 to 9447. [2019-12-07 12:07:12,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9447 states. [2019-12-07 12:07:12,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9447 states to 9447 states and 28877 transitions. [2019-12-07 12:07:12,155 INFO L78 Accepts]: Start accepts. Automaton has 9447 states and 28877 transitions. Word has length 65 [2019-12-07 12:07:12,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:12,155 INFO L462 AbstractCegarLoop]: Abstraction has 9447 states and 28877 transitions. [2019-12-07 12:07:12,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 12:07:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 9447 states and 28877 transitions. [2019-12-07 12:07:12,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:07:12,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:12,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:12,163 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:12,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:12,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1223704505, now seen corresponding path program 1 times [2019-12-07 12:07:12,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:12,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999976647] [2019-12-07 12:07:12,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:12,222 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 12:07:12,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999976647] [2019-12-07 12:07:12,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:12,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:07:12,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820913973] [2019-12-07 12:07:12,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:07:12,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:12,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:07:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:07:12,223 INFO L87 Difference]: Start difference. First operand 9447 states and 28877 transitions. Second operand 5 states. [2019-12-07 12:07:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:12,265 INFO L93 Difference]: Finished difference Result 10382 states and 31029 transitions. [2019-12-07 12:07:12,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 12:07:12,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 12:07:12,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:12,271 INFO L225 Difference]: With dead ends: 10382 [2019-12-07 12:07:12,271 INFO L226 Difference]: Without dead ends: 4772 [2019-12-07 12:07:12,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 12:07:12,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4772 states. [2019-12-07 12:07:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4772 to 4620. [2019-12-07 12:07:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4620 states. [2019-12-07 12:07:12,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4620 states to 4620 states and 12544 transitions. [2019-12-07 12:07:12,326 INFO L78 Accepts]: Start accepts. Automaton has 4620 states and 12544 transitions. Word has length 66 [2019-12-07 12:07:12,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:12,327 INFO L462 AbstractCegarLoop]: Abstraction has 4620 states and 12544 transitions. [2019-12-07 12:07:12,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:07:12,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4620 states and 12544 transitions. [2019-12-07 12:07:12,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:07:12,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:12,330 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:12,330 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:12,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:12,331 INFO L82 PathProgramCache]: Analyzing trace with hash -2003442767, now seen corresponding path program 2 times [2019-12-07 12:07:12,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:12,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660757830] [2019-12-07 12:07:12,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:12,401 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 12:07:12,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660757830] [2019-12-07 12:07:12,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:12,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 12:07:12,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694536101] [2019-12-07 12:07:12,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 12:07:12,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:12,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 12:07:12,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 12:07:12,402 INFO L87 Difference]: Start difference. First operand 4620 states and 12544 transitions. Second operand 8 states. [2019-12-07 12:07:12,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:12,724 INFO L93 Difference]: Finished difference Result 11756 states and 32084 transitions. [2019-12-07 12:07:12,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 12:07:12,724 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 12:07:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:12,737 INFO L225 Difference]: With dead ends: 11756 [2019-12-07 12:07:12,737 INFO L226 Difference]: Without dead ends: 9694 [2019-12-07 12:07:12,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2019-12-07 12:07:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9694 states. [2019-12-07 12:07:12,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9694 to 6921. [2019-12-07 12:07:12,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6921 states. [2019-12-07 12:07:12,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6921 states to 6921 states and 18753 transitions. [2019-12-07 12:07:12,833 INFO L78 Accepts]: Start accepts. Automaton has 6921 states and 18753 transitions. Word has length 66 [2019-12-07 12:07:12,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:12,833 INFO L462 AbstractCegarLoop]: Abstraction has 6921 states and 18753 transitions. [2019-12-07 12:07:12,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 12:07:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6921 states and 18753 transitions. [2019-12-07 12:07:12,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:07:12,839 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:12,839 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:12,839 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash -128297475, now seen corresponding path program 3 times [2019-12-07 12:07:12,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:12,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526009086] [2019-12-07 12:07:12,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 12:07:12,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 12:07:12,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526009086] [2019-12-07 12:07:12,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 12:07:12,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 12:07:12,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526052752] [2019-12-07 12:07:12,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 12:07:12,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 12:07:12,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 12:07:12,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 12:07:12,907 INFO L87 Difference]: Start difference. First operand 6921 states and 18753 transitions. Second operand 5 states. [2019-12-07 12:07:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 12:07:12,952 INFO L93 Difference]: Finished difference Result 7841 states and 20925 transitions. [2019-12-07 12:07:12,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 12:07:12,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 12:07:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 12:07:12,953 INFO L225 Difference]: With dead ends: 7841 [2019-12-07 12:07:12,954 INFO L226 Difference]: Without dead ends: 1066 [2019-12-07 12:07:12,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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 12:07:12,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2019-12-07 12:07:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2019-12-07 12:07:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2019-12-07 12:07:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 2412 transitions. [2019-12-07 12:07:12,962 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 2412 transitions. Word has length 66 [2019-12-07 12:07:12,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 12:07:12,962 INFO L462 AbstractCegarLoop]: Abstraction has 1066 states and 2412 transitions. [2019-12-07 12:07:12,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 12:07:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 2412 transitions. [2019-12-07 12:07:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 12:07:12,963 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 12:07:12,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 12:07:12,963 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 12:07:12,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 12:07:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1220820073, now seen corresponding path program 4 times [2019-12-07 12:07:12,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 12:07:12,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938015996] [2019-12-07 12:07:12,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 12:07:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:07:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 12:07:13,045 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 12:07:13,045 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 12:07:13,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= |v_ULTIMATE.start_main_~#t341~0.offset_23| 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t341~0.base_32| 4)) (= v_~a~0_21 0) (= v_~y~0_64 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t341~0.base_32|) (= v_~z$r_buff0_thd0~0_181 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t341~0.base_32| 1)) (= v_~__unbuffered_p1_EBX~0_76 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t341~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t341~0.base_32|) |v_ULTIMATE.start_main_~#t341~0.offset_23| 0)) |v_#memory_int_27|) (= 0 v_~z$flush_delayed~0_302) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t341~0.base_32|)) (= v_~weak$$choice2~0_349 0) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t341~0.offset=|v_ULTIMATE.start_main_~#t341~0.offset_23|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t343~0.base=|v_ULTIMATE.start_main_~#t343~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ULTIMATE.start_main_~#t344~0.offset=|v_ULTIMATE.start_main_~#t344~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ULTIMATE.start_main_~#t344~0.base=|v_ULTIMATE.start_main_~#t344~0.base_19|, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t342~0.base=|v_ULTIMATE.start_main_~#t342~0.base_25|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_470, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ULTIMATE.start_main_~#t343~0.offset=|v_ULTIMATE.start_main_~#t343~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_~#t342~0.offset=|v_ULTIMATE.start_main_~#t342~0.offset_16|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t341~0.base=|v_ULTIMATE.start_main_~#t341~0.base_32|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t341~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t343~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t344~0.offset, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t344~0.base, ~x~0, ULTIMATE.start_main_~#t342~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t343~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t342~0.offset, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t341~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:07:13,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t342~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t342~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t342~0.base_12|) |v_ULTIMATE.start_main_~#t342~0.offset_11| 1)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t342~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t342~0.base_12|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t342~0.base_12| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t342~0.base_12| 0)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t342~0.base_12| 1) |v_#valid_43|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t342~0.offset=|v_ULTIMATE.start_main_~#t342~0.offset_11|, ULTIMATE.start_main_~#t342~0.base=|v_ULTIMATE.start_main_~#t342~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t342~0.offset, ULTIMATE.start_main_~#t342~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:07:13,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t343~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t343~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t343~0.offset_8|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t343~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t343~0.base_9|) |v_ULTIMATE.start_main_~#t343~0.offset_8| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t343~0.base_9| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t343~0.base_9|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t343~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t343~0.offset=|v_ULTIMATE.start_main_~#t343~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t343~0.base=|v_ULTIMATE.start_main_~#t343~0.base_9|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t343~0.offset, ULTIMATE.start_main_~#t343~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 12:07:13,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t344~0.base_13| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t344~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t344~0.base_13|) |v_ULTIMATE.start_main_~#t344~0.offset_11| 3)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t344~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t344~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t344~0.base_13|) (= 0 (select |v_#valid_50| |v_ULTIMATE.start_main_~#t344~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t344~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t344~0.base=|v_ULTIMATE.start_main_~#t344~0.base_13|, ULTIMATE.start_main_~#t344~0.offset=|v_ULTIMATE.start_main_~#t344~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t344~0.base, ULTIMATE.start_main_~#t344~0.offset] because there is no mapped edge [2019-12-07 12:07:13,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 12:07:13,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In759081738 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite29_Out759081738| |P3Thread1of1ForFork3_#t~ite28_Out759081738|)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In759081738 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z$w_buff1~0_In759081738 |P3Thread1of1ForFork3_#t~ite28_Out759081738|)) (and (not .cse0) .cse2 (not .cse1) (= ~z$w_buff0~0_In759081738 |P3Thread1of1ForFork3_#t~ite28_Out759081738|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In759081738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759081738, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In759081738, ~z$w_buff1~0=~z$w_buff1~0_In759081738} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out759081738|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out759081738|, ~z$w_buff0~0=~z$w_buff0~0_In759081738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759081738, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In759081738, ~z$w_buff1~0=~z$w_buff1~0_In759081738} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 12:07:13,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:07:13,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In951734318 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite48_Out951734318| ~z$mem_tmp~0_In951734318) (not .cse0)) (and (= |P3Thread1of1ForFork3_#t~ite48_Out951734318| ~z~0_In951734318) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In951734318, ~z$flush_delayed~0=~z$flush_delayed~0_In951734318, ~z~0=~z~0_In951734318} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In951734318, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out951734318|, ~z$flush_delayed~0=~z$flush_delayed~0_In951734318, ~z~0=~z~0_In951734318} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 12:07:13,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:07:13,056 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:07:13,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In713455267 256)))) (or (and (= ~z~0_In713455267 |P2Thread1of1ForFork2_#t~ite25_Out713455267|) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite25_Out713455267| ~z$mem_tmp~0_In713455267)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In713455267, ~z$flush_delayed~0=~z$flush_delayed~0_In713455267, ~z~0=~z~0_In713455267} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In713455267, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out713455267|, ~z$flush_delayed~0=~z$flush_delayed~0_In713455267, ~z~0=~z~0_In713455267} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:07:13,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:07:13,063 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1065028430 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1065028430 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite51_Out-1065028430| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1065028430 |P3Thread1of1ForFork3_#t~ite51_Out-1065028430|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-1065028430|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 12:07:13,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2132277137 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-2132277137 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2132277137 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2132277137 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite52_Out-2132277137| ~z$w_buff1_used~0_In-2132277137) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork3_#t~ite52_Out-2132277137| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2132277137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132277137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2132277137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132277137} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out-2132277137|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2132277137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132277137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2132277137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132277137} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 12:07:13,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1452461126 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_In-1452461126 ~z$r_buff0_thd4~0_Out-1452461126)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1452461126 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out-1452461126) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1452461126} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out-1452461126|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1452461126} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:07:13,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-988481534 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-988481534 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-988481534 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-988481534 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite54_Out-988481534|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In-988481534 |P3Thread1of1ForFork3_#t~ite54_Out-988481534|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-988481534, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-988481534} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out-988481534|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-988481534, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-988481534} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 12:07:13,064 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 12:07:13,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:07:13,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2009884867 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In2009884867 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out2009884867| ~z~0_In2009884867)) (and (not .cse1) (= ~z$w_buff1~0_In2009884867 |ULTIMATE.start_main_#t~ite59_Out2009884867|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2009884867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2009884867, ~z$w_buff1~0=~z$w_buff1~0_In2009884867, ~z~0=~z~0_In2009884867} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2009884867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2009884867, ~z$w_buff1~0=~z$w_buff1~0_In2009884867, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2009884867|, ~z~0=~z~0_In2009884867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:07:13,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 12:07:13,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In887434408 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In887434408 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out887434408| ~z$w_buff0_used~0_In887434408) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out887434408|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out887434408|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:07:13,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1559668631 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1559668631 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1559668631 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1559668631 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out1559668631| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out1559668631| ~z$w_buff1_used~0_In1559668631) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1559668631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1559668631, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1559668631, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1559668631} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1559668631|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1559668631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1559668631, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1559668631, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1559668631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:07:13,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-399784188 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-399784188 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-399784188| ~z$r_buff0_thd0~0_In-399784188)) (and (= |ULTIMATE.start_main_#t~ite63_Out-399784188| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-399784188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-399784188} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-399784188|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-399784188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-399784188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:07:13,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2028479665 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2028479665 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2028479665 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2028479665 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out2028479665| ~z$r_buff1_thd0~0_In2028479665) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out2028479665|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2028479665, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2028479665, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2028479665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2028479665} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2028479665, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2028479665, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2028479665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2028479665, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out2028479665|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:07:13,067 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:07:13,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:07:13 BasicIcfg [2019-12-07 12:07:13,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 12:07:13,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 12:07:13,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 12:07:13,134 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 12:07:13,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:05:23" (3/4) ... [2019-12-07 12:07:13,136 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 12:07:13,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= |v_ULTIMATE.start_main_~#t341~0.offset_23| 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t341~0.base_32| 4)) (= v_~a~0_21 0) (= v_~y~0_64 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t341~0.base_32|) (= v_~z$r_buff0_thd0~0_181 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t341~0.base_32| 1)) (= v_~__unbuffered_p1_EBX~0_76 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t341~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t341~0.base_32|) |v_ULTIMATE.start_main_~#t341~0.offset_23| 0)) |v_#memory_int_27|) (= 0 v_~z$flush_delayed~0_302) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t341~0.base_32|)) (= v_~weak$$choice2~0_349 0) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t341~0.offset=|v_ULTIMATE.start_main_~#t341~0.offset_23|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t343~0.base=|v_ULTIMATE.start_main_~#t343~0.base_18|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ULTIMATE.start_main_~#t344~0.offset=|v_ULTIMATE.start_main_~#t344~0.offset_16|, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ULTIMATE.start_main_~#t344~0.base=|v_ULTIMATE.start_main_~#t344~0.base_19|, ~x~0=v_~x~0_31, ULTIMATE.start_main_~#t342~0.base=|v_ULTIMATE.start_main_~#t342~0.base_25|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_470, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ULTIMATE.start_main_~#t343~0.offset=|v_ULTIMATE.start_main_~#t343~0.offset_15|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_~#t342~0.offset=|v_ULTIMATE.start_main_~#t342~0.offset_16|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~#t341~0.base=|v_ULTIMATE.start_main_~#t341~0.base_32|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t341~0.offset, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t343~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t344~0.offset, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t344~0.base, ~x~0, ULTIMATE.start_main_~#t342~0.base, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t343~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t342~0.offset, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t341~0.base, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 12:07:13,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t342~0.base_12|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t342~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t342~0.base_12|) |v_ULTIMATE.start_main_~#t342~0.offset_11| 1)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t342~0.offset_11| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t342~0.base_12|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t342~0.base_12| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t342~0.base_12| 0)) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t342~0.base_12| 1) |v_#valid_43|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t342~0.offset=|v_ULTIMATE.start_main_~#t342~0.offset_11|, ULTIMATE.start_main_~#t342~0.base=|v_ULTIMATE.start_main_~#t342~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t342~0.offset, ULTIMATE.start_main_~#t342~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 12:07:13,137 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t343~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t343~0.base_9| 0)) (= 0 |v_ULTIMATE.start_main_~#t343~0.offset_8|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t343~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t343~0.base_9|) |v_ULTIMATE.start_main_~#t343~0.offset_8| 2)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t343~0.base_9| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t343~0.base_9|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t343~0.base_9| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t343~0.offset=|v_ULTIMATE.start_main_~#t343~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t343~0.base=|v_ULTIMATE.start_main_~#t343~0.base_9|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t343~0.offset, ULTIMATE.start_main_~#t343~0.base, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 12:07:13,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t344~0.base_13| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t344~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t344~0.base_13|) |v_ULTIMATE.start_main_~#t344~0.offset_11| 3)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t344~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t344~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t344~0.base_13|) (= 0 (select |v_#valid_50| |v_ULTIMATE.start_main_~#t344~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t344~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, #length=|v_#length_23|, ULTIMATE.start_main_~#t344~0.base=|v_ULTIMATE.start_main_~#t344~0.base_13|, ULTIMATE.start_main_~#t344~0.offset=|v_ULTIMATE.start_main_~#t344~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length, ULTIMATE.start_main_~#t344~0.base, ULTIMATE.start_main_~#t344~0.offset] because there is no mapped edge [2019-12-07 12:07:13,138 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 12:07:13,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In759081738 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite29_Out759081738| |P3Thread1of1ForFork3_#t~ite28_Out759081738|)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In759081738 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~z$w_buff1~0_In759081738 |P3Thread1of1ForFork3_#t~ite28_Out759081738|)) (and (not .cse0) .cse2 (not .cse1) (= ~z$w_buff0~0_In759081738 |P3Thread1of1ForFork3_#t~ite28_Out759081738|)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In759081738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759081738, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In759081738, ~z$w_buff1~0=~z$w_buff1~0_In759081738} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out759081738|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out759081738|, ~z$w_buff0~0=~z$w_buff0~0_In759081738, ~z$w_buff0_used~0=~z$w_buff0_used~0_In759081738, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In759081738, ~z$w_buff1~0=~z$w_buff1~0_In759081738} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 12:07:13,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:07:13,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In951734318 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite48_Out951734318| ~z$mem_tmp~0_In951734318) (not .cse0)) (and (= |P3Thread1of1ForFork3_#t~ite48_Out951734318| ~z~0_In951734318) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In951734318, ~z$flush_delayed~0=~z$flush_delayed~0_In951734318, ~z~0=~z~0_In951734318} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In951734318, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out951734318|, ~z$flush_delayed~0=~z$flush_delayed~0_In951734318, ~z~0=~z~0_In951734318} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 12:07:13,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 12:07:13,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 12:07:13,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In713455267 256)))) (or (and (= ~z~0_In713455267 |P2Thread1of1ForFork2_#t~ite25_Out713455267|) .cse0) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite25_Out713455267| ~z$mem_tmp~0_In713455267)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In713455267, ~z$flush_delayed~0=~z$flush_delayed~0_In713455267, ~z~0=~z~0_In713455267} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In713455267, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out713455267|, ~z$flush_delayed~0=~z$flush_delayed~0_In713455267, ~z~0=~z~0_In713455267} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 12:07:13,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 12:07:13,151 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd4~0_In-1065028430 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1065028430 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork3_#t~ite51_Out-1065028430| 0)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1065028430 |P3Thread1of1ForFork3_#t~ite51_Out-1065028430|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-1065028430|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1065028430, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1065028430} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 12:07:13,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-2132277137 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-2132277137 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-2132277137 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2132277137 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite52_Out-2132277137| ~z$w_buff1_used~0_In-2132277137) (or .cse2 .cse3)) (and (= |P3Thread1of1ForFork3_#t~ite52_Out-2132277137| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2132277137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132277137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2132277137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132277137} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out-2132277137|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-2132277137, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2132277137, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2132277137, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2132277137} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 12:07:13,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1452461126 256) 0)) (.cse0 (= ~z$r_buff0_thd4~0_In-1452461126 ~z$r_buff0_thd4~0_Out-1452461126)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1452461126 256)))) (or (and .cse0 .cse1) (and (= 0 ~z$r_buff0_thd4~0_Out-1452461126) (not .cse2) (not .cse1)) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1452461126} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out-1452461126|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1452461126, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1452461126} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 12:07:13,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd4~0_In-988481534 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-988481534 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-988481534 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-988481534 256)))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite54_Out-988481534|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd4~0_In-988481534 |P3Thread1of1ForFork3_#t~ite54_Out-988481534|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-988481534, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-988481534} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out-988481534|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-988481534, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-988481534, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-988481534, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-988481534} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 12:07:13,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 12:07:13,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 12:07:13,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In2009884867 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In2009884867 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out2009884867| ~z~0_In2009884867)) (and (not .cse1) (= ~z$w_buff1~0_In2009884867 |ULTIMATE.start_main_#t~ite59_Out2009884867|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2009884867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2009884867, ~z$w_buff1~0=~z$w_buff1~0_In2009884867, ~z~0=~z~0_In2009884867} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2009884867, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2009884867, ~z$w_buff1~0=~z$w_buff1~0_In2009884867, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2009884867|, ~z~0=~z~0_In2009884867} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 12:07:13,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 12:07:13,153 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In887434408 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In887434408 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out887434408| ~z$w_buff0_used~0_In887434408) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out887434408|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In887434408, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out887434408|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In887434408} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 12:07:13,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1559668631 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1559668631 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1559668631 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1559668631 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out1559668631| 0)) (and (= |ULTIMATE.start_main_#t~ite62_Out1559668631| ~z$w_buff1_used~0_In1559668631) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1559668631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1559668631, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1559668631, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1559668631} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1559668631|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1559668631, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1559668631, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1559668631, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1559668631} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 12:07:13,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-399784188 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-399784188 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-399784188| ~z$r_buff0_thd0~0_In-399784188)) (and (= |ULTIMATE.start_main_#t~ite63_Out-399784188| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-399784188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-399784188} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-399784188|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-399784188, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-399784188} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 12:07:13,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In2028479665 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2028479665 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In2028479665 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In2028479665 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite64_Out2028479665| ~z$r_buff1_thd0~0_In2028479665) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite64_Out2028479665|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2028479665, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2028479665, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2028479665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2028479665} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2028479665, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2028479665, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2028479665, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2028479665, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out2028479665|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 12:07:13,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 12:07:13,215 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_64767261-f988-4eba-9381-34ae827cce3e/bin/utaipan/witness.graphml [2019-12-07 12:07:13,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 12:07:13,216 INFO L168 Benchmark]: Toolchain (without parser) took 110975.01 ms. Allocated memory was 1.0 GB in the beginning and 7.9 GB in the end (delta: 6.8 GB). Free memory was 943.5 MB in the beginning and 3.9 GB in the end (delta: -3.0 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-12-07 12:07:13,217 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:07:13,217 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:07:13,217 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 12:07:13,217 INFO L168 Benchmark]: Boogie Preprocessor took 28.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 12:07:13,218 INFO L168 Benchmark]: RCFGBuilder took 460.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:07:13,218 INFO L168 Benchmark]: TraceAbstraction took 109960.83 ms. Allocated memory was 1.2 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 12:07:13,218 INFO L168 Benchmark]: Witness Printer took 81.59 ms. Allocated memory is still 7.9 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. [2019-12-07 12:07:13,220 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -149.8 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 460.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.1 MB). Peak memory consumption was 61.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 109960.83 ms. Allocated memory was 1.2 GB in the beginning and 7.9 GB in the end (delta: 6.7 GB). Free memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: -2.9 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 81.59 ms. Allocated memory is still 7.9 GB. Free memory was 4.0 GB in the beginning and 3.9 GB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 213 ProgramPointsBefore, 115 ProgramPointsAfterwards, 256 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 11402 VarBasedMoverChecksPositive, 391 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 392 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 131114 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L858] FCALL, FORK 0 pthread_create(&t341, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t342, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t343, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] FCALL, FORK 0 pthread_create(&t344, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = z$w_buff0 [L804] 4 z$w_buff0 = 1 [L805] 4 z$w_buff1_used = z$w_buff0_used [L806] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L824] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$flush_delayed ? z$mem_tmp : z [L829] 4 z$flush_delayed = (_Bool)0 [L832] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 y = 1 [L778] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 3 z$flush_delayed = weak$$choice2 [L781] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L783] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L785] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L786] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L788] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L872] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L873] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 201 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7075 SDtfs, 10638 SDslu, 17851 SDs, 0 SdLazy, 7735 SolverSat, 376 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 41 SyntacticMatches, 10 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197950occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 192927 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1150 NumberOfCodeBlocks, 1150 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1058 ConstructedInterpolants, 0 QuantifiedInterpolants, 452190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...