./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/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 669aca6fbd4d294f7aa9a9775b41f96f96c44568 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 14:24:09,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:24:09,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:24:09,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:24:09,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:24:09,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:24:09,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:24:09,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:24:09,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:24:09,238 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:24:09,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:24:09,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:24:09,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:24:09,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:24:09,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:24:09,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:24:09,242 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:24:09,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:24:09,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:24:09,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:24:09,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:24:09,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:24:09,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:24:09,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:24:09,250 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:24:09,251 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:24:09,251 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:24:09,251 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:24:09,251 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:24:09,252 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:24:09,252 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:24:09,253 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:24:09,253 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:24:09,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:24:09,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:24:09,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:24:09,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:24:09,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:24:09,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:24:09,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:24:09,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:24:09,256 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 14:24:09,266 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:24:09,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:24:09,267 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 14:24:09,267 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 14:24:09,267 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 14:24:09,267 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 14:24:09,267 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 14:24:09,267 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 14:24:09,268 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 14:24:09,268 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 14:24:09,268 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 14:24:09,268 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 14:24:09,268 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 14:24:09,268 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 14:24:09,268 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 14:24:09,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:24:09,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:24:09,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:24:09,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:24:09,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:24:09,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:24:09,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:24:09,270 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:24:09,271 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:24:09,271 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:24:09,272 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_0ff375df-0810-4902-b91b-a9dac1a4fc34/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 -> 669aca6fbd4d294f7aa9a9775b41f96f96c44568 [2019-12-07 14:24:09,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:24:09,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:24:09,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:24:09,384 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:24:09,385 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:24:09,385 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.i [2019-12-07 14:24:09,423 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/data/efbe8d229/0982c62eef7e4c3a94594964370db11c/FLAG09c2b5e14 [2019-12-07 14:24:09,821 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:24:09,821 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/sv-benchmarks/c/pthread-wmm/safe026_pso.oepc.i [2019-12-07 14:24:09,831 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/data/efbe8d229/0982c62eef7e4c3a94594964370db11c/FLAG09c2b5e14 [2019-12-07 14:24:09,840 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/data/efbe8d229/0982c62eef7e4c3a94594964370db11c [2019-12-07 14:24:09,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:24:09,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:24:09,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:24:09,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:24:09,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:24:09,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:24:09" (1/1) ... [2019-12-07 14:24:09,848 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:09, skipping insertion in model container [2019-12-07 14:24:09,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:24:09" (1/1) ... [2019-12-07 14:24:09,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:24:09,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:24:10,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:24:10,132 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:24:10,176 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:24:10,223 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:24:10,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10 WrapperNode [2019-12-07 14:24:10,223 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:24:10,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:24:10,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:24:10,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:24:10,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,244 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,263 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:24:10,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:24:10,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:24:10,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:24:10,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,284 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... [2019-12-07 14:24:10,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:24:10,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:24:10,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:24:10,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:24:10,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/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 14:24:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:24:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 14:24:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:24:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 14:24:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 14:24:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 14:24:10,332 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 14:24:10,332 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 14:24:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 14:24:10,333 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 14:24:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 14:24:10,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:24:10,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:24:10,334 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 14:24:10,698 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:24:10,698 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 14:24:10,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:24:10 BoogieIcfgContainer [2019-12-07 14:24:10,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:24:10,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:24:10,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:24:10,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:24:10,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:24:09" (1/3) ... [2019-12-07 14:24:10,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33070479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:24:10, skipping insertion in model container [2019-12-07 14:24:10,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:24:10" (2/3) ... [2019-12-07 14:24:10,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33070479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:24:10, skipping insertion in model container [2019-12-07 14:24:10,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:24:10" (3/3) ... [2019-12-07 14:24:10,706 INFO L109 eAbstractionObserver]: Analyzing ICFG safe026_pso.oepc.i [2019-12-07 14:24:10,714 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 14:24:10,715 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:24:10,721 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 14:24:10,722 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 14:24:10,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,751 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,752 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 14:24:10,782 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 14:24:10,794 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:24:10,795 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:24:10,795 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:24:10,795 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:24:10,795 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:24:10,795 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:24:10,795 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:24:10,795 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:24:10,806 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-07 14:24:10,807 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 14:24:10,861 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 14:24:10,861 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:24:10,872 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 14:24:10,889 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-07 14:24:10,920 INFO L134 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-07 14:24:10,920 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 14:24:10,925 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 14:24:10,941 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 14:24:10,942 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 14:24:13,925 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 14:24:14,014 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78269 [2019-12-07 14:24:14,014 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-07 14:24:14,016 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 103 transitions [2019-12-07 14:24:26,712 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 109594 states. [2019-12-07 14:24:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 109594 states. [2019-12-07 14:24:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 14:24:26,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:26,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 14:24:26,718 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:26,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:26,722 INFO L82 PathProgramCache]: Analyzing trace with hash 909914, now seen corresponding path program 1 times [2019-12-07 14:24:26,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:24:26,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14184002] [2019-12-07 14:24:26,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:24:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:26,865 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 14:24:26,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14184002] [2019-12-07 14:24:26,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:26,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 14:24:26,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616815098] [2019-12-07 14:24:26,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:24:26,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:24:26,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:24:26,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:24:26,881 INFO L87 Difference]: Start difference. First operand 109594 states. Second operand 3 states. [2019-12-07 14:24:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:27,691 INFO L93 Difference]: Finished difference Result 108680 states and 463562 transitions. [2019-12-07 14:24:27,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:24:27,693 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 14:24:27,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:28,138 INFO L225 Difference]: With dead ends: 108680 [2019-12-07 14:24:28,138 INFO L226 Difference]: Without dead ends: 102440 [2019-12-07 14:24:28,139 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 14:24:31,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102440 states. [2019-12-07 14:24:33,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102440 to 102440. [2019-12-07 14:24:33,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102440 states. [2019-12-07 14:24:33,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102440 states to 102440 states and 436366 transitions. [2019-12-07 14:24:33,500 INFO L78 Accepts]: Start accepts. Automaton has 102440 states and 436366 transitions. Word has length 3 [2019-12-07 14:24:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:33,500 INFO L462 AbstractCegarLoop]: Abstraction has 102440 states and 436366 transitions. [2019-12-07 14:24:33,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:24:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 102440 states and 436366 transitions. [2019-12-07 14:24:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 14:24:33,504 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:33,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:33,504 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:33,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -975068220, now seen corresponding path program 1 times [2019-12-07 14:24:33,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:24:33,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951290458] [2019-12-07 14:24:33,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:24:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:33,563 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 14:24:33,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951290458] [2019-12-07 14:24:33,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:33,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:24:33,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518621737] [2019-12-07 14:24:33,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:24:33,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:24:33,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:24:33,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:24:33,565 INFO L87 Difference]: Start difference. First operand 102440 states and 436366 transitions. Second operand 4 states. [2019-12-07 14:24:36,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:36,013 INFO L93 Difference]: Finished difference Result 163248 states and 665679 transitions. [2019-12-07 14:24:36,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:24:36,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 14:24:36,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:36,434 INFO L225 Difference]: With dead ends: 163248 [2019-12-07 14:24:36,434 INFO L226 Difference]: Without dead ends: 163199 [2019-12-07 14:24:36,434 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 14:24:41,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163199 states. [2019-12-07 14:24:43,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163199 to 148639. [2019-12-07 14:24:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148639 states. [2019-12-07 14:24:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148639 states to 148639 states and 614105 transitions. [2019-12-07 14:24:43,720 INFO L78 Accepts]: Start accepts. Automaton has 148639 states and 614105 transitions. Word has length 11 [2019-12-07 14:24:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:43,721 INFO L462 AbstractCegarLoop]: Abstraction has 148639 states and 614105 transitions. [2019-12-07 14:24:43,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:24:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 148639 states and 614105 transitions. [2019-12-07 14:24:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 14:24:43,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:43,725 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:43,726 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:43,726 INFO L82 PathProgramCache]: Analyzing trace with hash -112330344, now seen corresponding path program 1 times [2019-12-07 14:24:43,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:24:43,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526663062] [2019-12-07 14:24:43,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:24:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:43,772 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 14:24:43,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526663062] [2019-12-07 14:24:43,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:43,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:24:43,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567869737] [2019-12-07 14:24:43,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:24:43,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:24:43,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:24:43,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:24:43,773 INFO L87 Difference]: Start difference. First operand 148639 states and 614105 transitions. Second operand 4 states. [2019-12-07 14:24:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:45,184 INFO L93 Difference]: Finished difference Result 208779 states and 842772 transitions. [2019-12-07 14:24:45,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:24:45,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 14:24:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:45,716 INFO L225 Difference]: With dead ends: 208779 [2019-12-07 14:24:45,716 INFO L226 Difference]: Without dead ends: 208723 [2019-12-07 14:24:45,717 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 14:24:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208723 states. [2019-12-07 14:24:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208723 to 175996. [2019-12-07 14:24:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175996 states. [2019-12-07 14:24:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175996 states to 175996 states and 723083 transitions. [2019-12-07 14:24:55,942 INFO L78 Accepts]: Start accepts. Automaton has 175996 states and 723083 transitions. Word has length 13 [2019-12-07 14:24:55,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:24:55,943 INFO L462 AbstractCegarLoop]: Abstraction has 175996 states and 723083 transitions. [2019-12-07 14:24:55,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:24:55,943 INFO L276 IsEmpty]: Start isEmpty. Operand 175996 states and 723083 transitions. [2019-12-07 14:24:55,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 14:24:55,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:24:55,950 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:24:55,950 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:24:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:24:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash -790185689, now seen corresponding path program 1 times [2019-12-07 14:24:55,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:24:55,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218318956] [2019-12-07 14:24:55,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:24:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:24:55,999 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 14:24:55,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218318956] [2019-12-07 14:24:55,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:24:56,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:24:56,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499286397] [2019-12-07 14:24:56,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:24:56,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:24:56,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:24:56,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:24:56,000 INFO L87 Difference]: Start difference. First operand 175996 states and 723083 transitions. Second operand 5 states. [2019-12-07 14:24:57,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:24:57,308 INFO L93 Difference]: Finished difference Result 234922 states and 955485 transitions. [2019-12-07 14:24:57,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:24:57,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 14:24:57,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:24:58,508 INFO L225 Difference]: With dead ends: 234922 [2019-12-07 14:24:58,508 INFO L226 Difference]: Without dead ends: 234922 [2019-12-07 14:24:58,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:25:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234922 states. [2019-12-07 14:25:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234922 to 195490. [2019-12-07 14:25:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195490 states. [2019-12-07 14:25:09,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195490 states to 195490 states and 801473 transitions. [2019-12-07 14:25:09,925 INFO L78 Accepts]: Start accepts. Automaton has 195490 states and 801473 transitions. Word has length 16 [2019-12-07 14:25:09,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:09,926 INFO L462 AbstractCegarLoop]: Abstraction has 195490 states and 801473 transitions. [2019-12-07 14:25:09,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:25:09,926 INFO L276 IsEmpty]: Start isEmpty. Operand 195490 states and 801473 transitions. [2019-12-07 14:25:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 14:25:09,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:09,939 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 14:25:09,939 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:09,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:09,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1153162558, now seen corresponding path program 1 times [2019-12-07 14:25:09,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:09,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044215759] [2019-12-07 14:25:09,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:09,998 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 14:25:09,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044215759] [2019-12-07 14:25:09,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:09,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:09,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288922977] [2019-12-07 14:25:09,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:25:09,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:09,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:25:09,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:09,999 INFO L87 Difference]: Start difference. First operand 195490 states and 801473 transitions. Second operand 4 states. [2019-12-07 14:25:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:10,549 INFO L93 Difference]: Finished difference Result 50544 states and 172360 transitions. [2019-12-07 14:25:10,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:25:10,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 14:25:10,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:10,616 INFO L225 Difference]: With dead ends: 50544 [2019-12-07 14:25:10,616 INFO L226 Difference]: Without dead ends: 38483 [2019-12-07 14:25:10,616 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 14:25:10,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38483 states. [2019-12-07 14:25:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38483 to 38347. [2019-12-07 14:25:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38347 states. [2019-12-07 14:25:11,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38347 states to 38347 states and 123865 transitions. [2019-12-07 14:25:11,260 INFO L78 Accepts]: Start accepts. Automaton has 38347 states and 123865 transitions. Word has length 18 [2019-12-07 14:25:11,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:11,260 INFO L462 AbstractCegarLoop]: Abstraction has 38347 states and 123865 transitions. [2019-12-07 14:25:11,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:25:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 38347 states and 123865 transitions. [2019-12-07 14:25:11,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 14:25:11,265 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:11,265 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:11,266 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:11,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:11,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2079194331, now seen corresponding path program 1 times [2019-12-07 14:25:11,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:11,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966804389] [2019-12-07 14:25:11,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:11,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:11,316 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 14:25:11,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966804389] [2019-12-07 14:25:11,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:11,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:25:11,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307420087] [2019-12-07 14:25:11,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:11,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:11,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:11,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:11,317 INFO L87 Difference]: Start difference. First operand 38347 states and 123865 transitions. Second operand 6 states. [2019-12-07 14:25:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:11,977 INFO L93 Difference]: Finished difference Result 58112 states and 182585 transitions. [2019-12-07 14:25:11,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 14:25:11,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 14:25:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:12,063 INFO L225 Difference]: With dead ends: 58112 [2019-12-07 14:25:12,063 INFO L226 Difference]: Without dead ends: 58056 [2019-12-07 14:25:12,064 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58056 states. [2019-12-07 14:25:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58056 to 38947. [2019-12-07 14:25:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38947 states. [2019-12-07 14:25:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38947 states to 38947 states and 124912 transitions. [2019-12-07 14:25:12,841 INFO L78 Accepts]: Start accepts. Automaton has 38947 states and 124912 transitions. Word has length 22 [2019-12-07 14:25:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:12,841 INFO L462 AbstractCegarLoop]: Abstraction has 38947 states and 124912 transitions. [2019-12-07 14:25:12,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 38947 states and 124912 transitions. [2019-12-07 14:25:12,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 14:25:12,850 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:12,850 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:12,850 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:12,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:12,850 INFO L82 PathProgramCache]: Analyzing trace with hash -356343789, now seen corresponding path program 1 times [2019-12-07 14:25:12,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:12,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939648910] [2019-12-07 14:25:12,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:12,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939648910] [2019-12-07 14:25:12,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:12,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:12,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703068940] [2019-12-07 14:25:12,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:25:12,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:12,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:25:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:25:12,909 INFO L87 Difference]: Start difference. First operand 38947 states and 124912 transitions. Second operand 5 states. [2019-12-07 14:25:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:13,315 INFO L93 Difference]: Finished difference Result 54188 states and 170191 transitions. [2019-12-07 14:25:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 14:25:13,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 14:25:13,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:13,396 INFO L225 Difference]: With dead ends: 54188 [2019-12-07 14:25:13,396 INFO L226 Difference]: Without dead ends: 54175 [2019-12-07 14:25:13,396 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:25:13,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54175 states. [2019-12-07 14:25:14,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54175 to 45950. [2019-12-07 14:25:14,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45950 states. [2019-12-07 14:25:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45950 states to 45950 states and 146719 transitions. [2019-12-07 14:25:14,575 INFO L78 Accepts]: Start accepts. Automaton has 45950 states and 146719 transitions. Word has length 25 [2019-12-07 14:25:14,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:14,575 INFO L462 AbstractCegarLoop]: Abstraction has 45950 states and 146719 transitions. [2019-12-07 14:25:14,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:25:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 45950 states and 146719 transitions. [2019-12-07 14:25:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 14:25:14,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:14,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:14,587 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:14,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1041381309, now seen corresponding path program 1 times [2019-12-07 14:25:14,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:14,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194212747] [2019-12-07 14:25:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:14,633 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 14:25:14,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194212747] [2019-12-07 14:25:14,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:14,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:25:14,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491293528] [2019-12-07 14:25:14,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:14,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:14,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:14,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:14,634 INFO L87 Difference]: Start difference. First operand 45950 states and 146719 transitions. Second operand 6 states. [2019-12-07 14:25:15,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:15,171 INFO L93 Difference]: Finished difference Result 65294 states and 203497 transitions. [2019-12-07 14:25:15,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:25:15,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 14:25:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:15,264 INFO L225 Difference]: With dead ends: 65294 [2019-12-07 14:25:15,264 INFO L226 Difference]: Without dead ends: 64946 [2019-12-07 14:25:15,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:25:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64946 states. [2019-12-07 14:25:16,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64946 to 50721. [2019-12-07 14:25:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50721 states. [2019-12-07 14:25:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50721 states to 50721 states and 161063 transitions. [2019-12-07 14:25:16,221 INFO L78 Accepts]: Start accepts. Automaton has 50721 states and 161063 transitions. Word has length 27 [2019-12-07 14:25:16,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:16,221 INFO L462 AbstractCegarLoop]: Abstraction has 50721 states and 161063 transitions. [2019-12-07 14:25:16,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:16,221 INFO L276 IsEmpty]: Start isEmpty. Operand 50721 states and 161063 transitions. [2019-12-07 14:25:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 14:25:16,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:16,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:16,236 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:16,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash 312672747, now seen corresponding path program 1 times [2019-12-07 14:25:16,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:16,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370816483] [2019-12-07 14:25:16,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:16,265 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 14:25:16,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370816483] [2019-12-07 14:25:16,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:16,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:16,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226378913] [2019-12-07 14:25:16,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:16,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:16,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:16,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:16,267 INFO L87 Difference]: Start difference. First operand 50721 states and 161063 transitions. Second operand 3 states. [2019-12-07 14:25:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:16,402 INFO L93 Difference]: Finished difference Result 48753 states and 153505 transitions. [2019-12-07 14:25:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:16,402 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-07 14:25:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:16,468 INFO L225 Difference]: With dead ends: 48753 [2019-12-07 14:25:16,468 INFO L226 Difference]: Without dead ends: 48753 [2019-12-07 14:25:16,469 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 14:25:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48753 states. [2019-12-07 14:25:17,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48753 to 45797. [2019-12-07 14:25:17,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45797 states. [2019-12-07 14:25:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45797 states to 45797 states and 144643 transitions. [2019-12-07 14:25:17,222 INFO L78 Accepts]: Start accepts. Automaton has 45797 states and 144643 transitions. Word has length 28 [2019-12-07 14:25:17,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:17,222 INFO L462 AbstractCegarLoop]: Abstraction has 45797 states and 144643 transitions. [2019-12-07 14:25:17,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:17,222 INFO L276 IsEmpty]: Start isEmpty. Operand 45797 states and 144643 transitions. [2019-12-07 14:25:17,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 14:25:17,236 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:17,236 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:17,236 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:17,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:17,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1439082270, now seen corresponding path program 1 times [2019-12-07 14:25:17,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:17,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9369243] [2019-12-07 14:25:17,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:17,295 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 14:25:17,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9369243] [2019-12-07 14:25:17,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:17,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:25:17,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028934270] [2019-12-07 14:25:17,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:25:17,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:25:17,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:25:17,296 INFO L87 Difference]: Start difference. First operand 45797 states and 144643 transitions. Second operand 5 states. [2019-12-07 14:25:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:17,373 INFO L93 Difference]: Finished difference Result 20112 states and 60938 transitions. [2019-12-07 14:25:17,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:25:17,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-07 14:25:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:17,394 INFO L225 Difference]: With dead ends: 20112 [2019-12-07 14:25:17,394 INFO L226 Difference]: Without dead ends: 17577 [2019-12-07 14:25:17,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:25:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-12-07 14:25:17,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 16564. [2019-12-07 14:25:17,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16564 states. [2019-12-07 14:25:17,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16564 states to 16564 states and 49915 transitions. [2019-12-07 14:25:17,635 INFO L78 Accepts]: Start accepts. Automaton has 16564 states and 49915 transitions. Word has length 29 [2019-12-07 14:25:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:17,635 INFO L462 AbstractCegarLoop]: Abstraction has 16564 states and 49915 transitions. [2019-12-07 14:25:17,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:25:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 16564 states and 49915 transitions. [2019-12-07 14:25:17,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 14:25:17,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:17,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:17,651 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:17,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:17,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1993081713, now seen corresponding path program 1 times [2019-12-07 14:25:17,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:17,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958471012] [2019-12-07 14:25:17,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:17,710 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 14:25:17,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958471012] [2019-12-07 14:25:17,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:17,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:25:17,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032216501] [2019-12-07 14:25:17,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 14:25:17,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:17,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 14:25:17,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:25:17,711 INFO L87 Difference]: Start difference. First operand 16564 states and 49915 transitions. Second operand 7 states. [2019-12-07 14:25:18,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:18,727 INFO L93 Difference]: Finished difference Result 23459 states and 68690 transitions. [2019-12-07 14:25:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 14:25:18,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 14:25:18,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:18,764 INFO L225 Difference]: With dead ends: 23459 [2019-12-07 14:25:18,764 INFO L226 Difference]: Without dead ends: 22772 [2019-12-07 14:25:18,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:25:18,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22772 states. [2019-12-07 14:25:19,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22772 to 15927. [2019-12-07 14:25:19,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15927 states. [2019-12-07 14:25:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15927 states to 15927 states and 47844 transitions. [2019-12-07 14:25:19,031 INFO L78 Accepts]: Start accepts. Automaton has 15927 states and 47844 transitions. Word has length 33 [2019-12-07 14:25:19,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:19,032 INFO L462 AbstractCegarLoop]: Abstraction has 15927 states and 47844 transitions. [2019-12-07 14:25:19,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 14:25:19,032 INFO L276 IsEmpty]: Start isEmpty. Operand 15927 states and 47844 transitions. [2019-12-07 14:25:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 14:25:19,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:19,049 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] [2019-12-07 14:25:19,050 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:19,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:19,050 INFO L82 PathProgramCache]: Analyzing trace with hash 731907862, now seen corresponding path program 1 times [2019-12-07 14:25:19,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:19,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934489619] [2019-12-07 14:25:19,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:19,091 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 14:25:19,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934489619] [2019-12-07 14:25:19,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:19,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:19,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294029847] [2019-12-07 14:25:19,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:19,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:19,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:19,093 INFO L87 Difference]: Start difference. First operand 15927 states and 47844 transitions. Second operand 3 states. [2019-12-07 14:25:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:19,152 INFO L93 Difference]: Finished difference Result 15927 states and 47304 transitions. [2019-12-07 14:25:19,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:19,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 14:25:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:19,169 INFO L225 Difference]: With dead ends: 15927 [2019-12-07 14:25:19,169 INFO L226 Difference]: Without dead ends: 15927 [2019-12-07 14:25:19,170 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 14:25:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15927 states. [2019-12-07 14:25:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15927 to 15677. [2019-12-07 14:25:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15677 states. [2019-12-07 14:25:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15677 states to 15677 states and 46606 transitions. [2019-12-07 14:25:19,377 INFO L78 Accepts]: Start accepts. Automaton has 15677 states and 46606 transitions. Word has length 40 [2019-12-07 14:25:19,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:19,378 INFO L462 AbstractCegarLoop]: Abstraction has 15677 states and 46606 transitions. [2019-12-07 14:25:19,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:19,378 INFO L276 IsEmpty]: Start isEmpty. Operand 15677 states and 46606 transitions. [2019-12-07 14:25:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:25:19,390 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:19,390 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:19,390 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash 854921497, now seen corresponding path program 1 times [2019-12-07 14:25:19,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:19,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708693784] [2019-12-07 14:25:19,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:19,443 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 14:25:19,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708693784] [2019-12-07 14:25:19,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:19,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:25:19,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812212549] [2019-12-07 14:25:19,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:25:19,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:19,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:25:19,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:25:19,444 INFO L87 Difference]: Start difference. First operand 15677 states and 46606 transitions. Second operand 6 states. [2019-12-07 14:25:19,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:19,518 INFO L93 Difference]: Finished difference Result 14423 states and 43850 transitions. [2019-12-07 14:25:19,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:25:19,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 14:25:19,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:19,533 INFO L225 Difference]: With dead ends: 14423 [2019-12-07 14:25:19,533 INFO L226 Difference]: Without dead ends: 14289 [2019-12-07 14:25:19,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:25:19,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14289 states. [2019-12-07 14:25:19,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14289 to 13025. [2019-12-07 14:25:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13025 states. [2019-12-07 14:25:19,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13025 states to 13025 states and 39816 transitions. [2019-12-07 14:25:19,722 INFO L78 Accepts]: Start accepts. Automaton has 13025 states and 39816 transitions. Word has length 41 [2019-12-07 14:25:19,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:19,722 INFO L462 AbstractCegarLoop]: Abstraction has 13025 states and 39816 transitions. [2019-12-07 14:25:19,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:25:19,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13025 states and 39816 transitions. [2019-12-07 14:25:19,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:25:19,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:19,734 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 14:25:19,734 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:19,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:19,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1128251409, now seen corresponding path program 1 times [2019-12-07 14:25:19,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:19,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939101777] [2019-12-07 14:25:19,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:19,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939101777] [2019-12-07 14:25:19,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:19,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:19,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761123468] [2019-12-07 14:25:19,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:19,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:19,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:19,762 INFO L87 Difference]: Start difference. First operand 13025 states and 39816 transitions. Second operand 3 states. [2019-12-07 14:25:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:19,826 INFO L93 Difference]: Finished difference Result 18867 states and 57936 transitions. [2019-12-07 14:25:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:19,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 14:25:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:19,848 INFO L225 Difference]: With dead ends: 18867 [2019-12-07 14:25:19,848 INFO L226 Difference]: Without dead ends: 18867 [2019-12-07 14:25:19,848 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18867 states. [2019-12-07 14:25:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18867 to 14565. [2019-12-07 14:25:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14565 states. [2019-12-07 14:25:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14565 states to 14565 states and 45200 transitions. [2019-12-07 14:25:20,094 INFO L78 Accepts]: Start accepts. Automaton has 14565 states and 45200 transitions. Word has length 66 [2019-12-07 14:25:20,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:20,094 INFO L462 AbstractCegarLoop]: Abstraction has 14565 states and 45200 transitions. [2019-12-07 14:25:20,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 14565 states and 45200 transitions. [2019-12-07 14:25:20,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:25:20,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:20,109 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 14:25:20,109 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:20,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:20,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1486247926, now seen corresponding path program 1 times [2019-12-07 14:25:20,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:20,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256626198] [2019-12-07 14:25:20,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:20,138 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 14:25:20,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256626198] [2019-12-07 14:25:20,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:20,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:20,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380041315] [2019-12-07 14:25:20,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:20,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:20,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:20,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:20,139 INFO L87 Difference]: Start difference. First operand 14565 states and 45200 transitions. Second operand 3 states. [2019-12-07 14:25:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:20,198 INFO L93 Difference]: Finished difference Result 18027 states and 54178 transitions. [2019-12-07 14:25:20,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:20,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 14:25:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:20,217 INFO L225 Difference]: With dead ends: 18027 [2019-12-07 14:25:20,217 INFO L226 Difference]: Without dead ends: 18027 [2019-12-07 14:25:20,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18027 states. [2019-12-07 14:25:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18027 to 13809. [2019-12-07 14:25:20,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13809 states. [2019-12-07 14:25:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13809 states to 13809 states and 41675 transitions. [2019-12-07 14:25:20,441 INFO L78 Accepts]: Start accepts. Automaton has 13809 states and 41675 transitions. Word has length 66 [2019-12-07 14:25:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:20,441 INFO L462 AbstractCegarLoop]: Abstraction has 13809 states and 41675 transitions. [2019-12-07 14:25:20,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 13809 states and 41675 transitions. [2019-12-07 14:25:20,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 14:25:20,454 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:20,454 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 14:25:20,455 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:20,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:20,455 INFO L82 PathProgramCache]: Analyzing trace with hash 2105019115, now seen corresponding path program 1 times [2019-12-07 14:25:20,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:20,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200612154] [2019-12-07 14:25:20,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:20,492 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 14:25:20,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200612154] [2019-12-07 14:25:20,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:20,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 14:25:20,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110335013] [2019-12-07 14:25:20,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:25:20,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:20,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:25:20,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:20,493 INFO L87 Difference]: Start difference. First operand 13809 states and 41675 transitions. Second operand 3 states. [2019-12-07 14:25:20,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:20,563 INFO L93 Difference]: Finished difference Result 16490 states and 49848 transitions. [2019-12-07 14:25:20,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:25:20,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 14:25:20,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:20,580 INFO L225 Difference]: With dead ends: 16490 [2019-12-07 14:25:20,580 INFO L226 Difference]: Without dead ends: 16490 [2019-12-07 14:25:20,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:25:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16490 states. [2019-12-07 14:25:20,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16490 to 12952. [2019-12-07 14:25:20,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12952 states. [2019-12-07 14:25:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12952 states to 12952 states and 39462 transitions. [2019-12-07 14:25:20,780 INFO L78 Accepts]: Start accepts. Automaton has 12952 states and 39462 transitions. Word has length 66 [2019-12-07 14:25:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:20,780 INFO L462 AbstractCegarLoop]: Abstraction has 12952 states and 39462 transitions. [2019-12-07 14:25:20,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:25:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 12952 states and 39462 transitions. [2019-12-07 14:25:20,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:20,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:20,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:20,792 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:20,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:20,792 INFO L82 PathProgramCache]: Analyzing trace with hash -991043735, now seen corresponding path program 1 times [2019-12-07 14:25:20,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:20,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392559478] [2019-12-07 14:25:20,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:20,837 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 14:25:20,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392559478] [2019-12-07 14:25:20,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:20,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:25:20,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138346515] [2019-12-07 14:25:20,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:25:20,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:20,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:25:20,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:25:20,839 INFO L87 Difference]: Start difference. First operand 12952 states and 39462 transitions. Second operand 4 states. [2019-12-07 14:25:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:20,914 INFO L93 Difference]: Finished difference Result 12780 states and 38791 transitions. [2019-12-07 14:25:20,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:25:20,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 14:25:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:20,928 INFO L225 Difference]: With dead ends: 12780 [2019-12-07 14:25:20,928 INFO L226 Difference]: Without dead ends: 12780 [2019-12-07 14:25:20,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 14:25:20,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12780 states. [2019-12-07 14:25:21,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12780 to 11737. [2019-12-07 14:25:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11737 states. [2019-12-07 14:25:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11737 states to 11737 states and 35494 transitions. [2019-12-07 14:25:21,100 INFO L78 Accepts]: Start accepts. Automaton has 11737 states and 35494 transitions. Word has length 67 [2019-12-07 14:25:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:21,100 INFO L462 AbstractCegarLoop]: Abstraction has 11737 states and 35494 transitions. [2019-12-07 14:25:21,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:25:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11737 states and 35494 transitions. [2019-12-07 14:25:21,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:21,109 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:21,110 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:21,110 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:21,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:21,110 INFO L82 PathProgramCache]: Analyzing trace with hash -869199490, now seen corresponding path program 1 times [2019-12-07 14:25:21,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:21,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043360405] [2019-12-07 14:25:21,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:21,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 14:25:21,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043360405] [2019-12-07 14:25:21,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:21,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:25:21,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827121588] [2019-12-07 14:25:21,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 14:25:21,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:21,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 14:25:21,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 14:25:21,402 INFO L87 Difference]: Start difference. First operand 11737 states and 35494 transitions. Second operand 14 states. [2019-12-07 14:25:22,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:22,920 INFO L93 Difference]: Finished difference Result 38557 states and 117241 transitions. [2019-12-07 14:25:22,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 14:25:22,921 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2019-12-07 14:25:22,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:22,958 INFO L225 Difference]: With dead ends: 38557 [2019-12-07 14:25:22,958 INFO L226 Difference]: Without dead ends: 33743 [2019-12-07 14:25:22,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 14:25:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33743 states. [2019-12-07 14:25:23,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33743 to 15609. [2019-12-07 14:25:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15609 states. [2019-12-07 14:25:23,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15609 states to 15609 states and 47073 transitions. [2019-12-07 14:25:23,283 INFO L78 Accepts]: Start accepts. Automaton has 15609 states and 47073 transitions. Word has length 67 [2019-12-07 14:25:23,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:23,283 INFO L462 AbstractCegarLoop]: Abstraction has 15609 states and 47073 transitions. [2019-12-07 14:25:23,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 14:25:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 15609 states and 47073 transitions. [2019-12-07 14:25:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:23,297 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:23,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:23,297 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash -825405888, now seen corresponding path program 2 times [2019-12-07 14:25:23,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:23,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578415186] [2019-12-07 14:25:23,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:23,438 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 14:25:23,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578415186] [2019-12-07 14:25:23,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:23,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:25:23,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769409437] [2019-12-07 14:25:23,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:25:23,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:25:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:25:23,439 INFO L87 Difference]: Start difference. First operand 15609 states and 47073 transitions. Second operand 11 states. [2019-12-07 14:25:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:24,282 INFO L93 Difference]: Finished difference Result 40795 states and 122879 transitions. [2019-12-07 14:25:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-07 14:25:24,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 14:25:24,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:24,322 INFO L225 Difference]: With dead ends: 40795 [2019-12-07 14:25:24,322 INFO L226 Difference]: Without dead ends: 35968 [2019-12-07 14:25:24,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=1135, Unknown=0, NotChecked=0, Total=1406 [2019-12-07 14:25:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35968 states. [2019-12-07 14:25:24,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35968 to 17759. [2019-12-07 14:25:24,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17759 states. [2019-12-07 14:25:24,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17759 states to 17759 states and 54012 transitions. [2019-12-07 14:25:24,697 INFO L78 Accepts]: Start accepts. Automaton has 17759 states and 54012 transitions. Word has length 67 [2019-12-07 14:25:24,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:24,697 INFO L462 AbstractCegarLoop]: Abstraction has 17759 states and 54012 transitions. [2019-12-07 14:25:24,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:25:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 17759 states and 54012 transitions. [2019-12-07 14:25:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:24,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:24,713 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:24,713 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:24,713 INFO L82 PathProgramCache]: Analyzing trace with hash 289864222, now seen corresponding path program 3 times [2019-12-07 14:25:24,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:24,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609514972] [2019-12-07 14:25:24,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:24,843 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 14:25:24,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609514972] [2019-12-07 14:25:24,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:24,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 14:25:24,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015205293] [2019-12-07 14:25:24,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 14:25:24,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:24,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 14:25:24,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 14:25:24,845 INFO L87 Difference]: Start difference. First operand 17759 states and 54012 transitions. Second operand 11 states. [2019-12-07 14:25:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:25,440 INFO L93 Difference]: Finished difference Result 32286 states and 96627 transitions. [2019-12-07 14:25:25,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 14:25:25,440 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 14:25:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:25,467 INFO L225 Difference]: With dead ends: 32286 [2019-12-07 14:25:25,467 INFO L226 Difference]: Without dead ends: 24859 [2019-12-07 14:25:25,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2019-12-07 14:25:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24859 states. [2019-12-07 14:25:25,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24859 to 13839. [2019-12-07 14:25:25,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13839 states. [2019-12-07 14:25:25,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 41422 transitions. [2019-12-07 14:25:25,736 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 41422 transitions. Word has length 67 [2019-12-07 14:25:25,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:25,736 INFO L462 AbstractCegarLoop]: Abstraction has 13839 states and 41422 transitions. [2019-12-07 14:25:25,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 14:25:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 41422 transitions. [2019-12-07 14:25:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:25,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:25,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:25,749 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:25,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1169490426, now seen corresponding path program 4 times [2019-12-07 14:25:25,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:25,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018465888] [2019-12-07 14:25:25,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:25,977 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 14:25:25,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018465888] [2019-12-07 14:25:25,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:25,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 14:25:25,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786410606] [2019-12-07 14:25:25,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:25:25,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:25,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:25:25,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:25:25,979 INFO L87 Difference]: Start difference. First operand 13839 states and 41422 transitions. Second operand 13 states. [2019-12-07 14:25:31,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:31,188 INFO L93 Difference]: Finished difference Result 53473 states and 153116 transitions. [2019-12-07 14:25:31,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-07 14:25:31,188 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-07 14:25:31,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:31,234 INFO L225 Difference]: With dead ends: 53473 [2019-12-07 14:25:31,234 INFO L226 Difference]: Without dead ends: 46170 [2019-12-07 14:25:31,235 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 928 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=574, Invalid=2506, Unknown=0, NotChecked=0, Total=3080 [2019-12-07 14:25:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46170 states. [2019-12-07 14:25:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46170 to 14570. [2019-12-07 14:25:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14570 states. [2019-12-07 14:25:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 43300 transitions. [2019-12-07 14:25:31,618 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 43300 transitions. Word has length 67 [2019-12-07 14:25:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:31,619 INFO L462 AbstractCegarLoop]: Abstraction has 14570 states and 43300 transitions. [2019-12-07 14:25:31,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:25:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 43300 transitions. [2019-12-07 14:25:31,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:31,632 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:31,632 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:31,632 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:31,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:31,633 INFO L82 PathProgramCache]: Analyzing trace with hash -164342018, now seen corresponding path program 5 times [2019-12-07 14:25:31,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:31,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373908535] [2019-12-07 14:25:31,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:31,926 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 14:25:31,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373908535] [2019-12-07 14:25:31,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:31,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 14:25:31,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282263133] [2019-12-07 14:25:31,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 14:25:31,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:31,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 14:25:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-12-07 14:25:31,927 INFO L87 Difference]: Start difference. First operand 14570 states and 43300 transitions. Second operand 17 states. [2019-12-07 14:25:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:36,046 INFO L93 Difference]: Finished difference Result 33058 states and 96662 transitions. [2019-12-07 14:25:36,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-07 14:25:36,046 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-07 14:25:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:36,082 INFO L225 Difference]: With dead ends: 33058 [2019-12-07 14:25:36,082 INFO L226 Difference]: Without dead ends: 32393 [2019-12-07 14:25:36,083 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=280, Invalid=1976, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 14:25:36,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32393 states. [2019-12-07 14:25:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32393 to 14730. [2019-12-07 14:25:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14730 states. [2019-12-07 14:25:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14730 states to 14730 states and 43343 transitions. [2019-12-07 14:25:36,411 INFO L78 Accepts]: Start accepts. Automaton has 14730 states and 43343 transitions. Word has length 67 [2019-12-07 14:25:36,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:36,411 INFO L462 AbstractCegarLoop]: Abstraction has 14730 states and 43343 transitions. [2019-12-07 14:25:36,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 14:25:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 14730 states and 43343 transitions. [2019-12-07 14:25:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:36,425 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:36,425 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:36,425 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:36,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:36,425 INFO L82 PathProgramCache]: Analyzing trace with hash 289428518, now seen corresponding path program 6 times [2019-12-07 14:25:36,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:36,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061021853] [2019-12-07 14:25:36,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:25:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:25:36,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061021853] [2019-12-07 14:25:36,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:25:36,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 14:25:36,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532935685] [2019-12-07 14:25:36,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 14:25:36,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 14:25:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 14:25:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-07 14:25:36,548 INFO L87 Difference]: Start difference. First operand 14730 states and 43343 transitions. Second operand 12 states. [2019-12-07 14:25:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:25:37,116 INFO L93 Difference]: Finished difference Result 26270 states and 76816 transitions. [2019-12-07 14:25:37,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 14:25:37,116 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-07 14:25:37,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:25:37,144 INFO L225 Difference]: With dead ends: 26270 [2019-12-07 14:25:37,144 INFO L226 Difference]: Without dead ends: 25779 [2019-12-07 14:25:37,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-07 14:25:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25779 states. [2019-12-07 14:25:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25779 to 14186. [2019-12-07 14:25:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14186 states. [2019-12-07 14:25:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 41865 transitions. [2019-12-07 14:25:37,435 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 41865 transitions. Word has length 67 [2019-12-07 14:25:37,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:25:37,435 INFO L462 AbstractCegarLoop]: Abstraction has 14186 states and 41865 transitions. [2019-12-07 14:25:37,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 14:25:37,435 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 41865 transitions. [2019-12-07 14:25:37,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 14:25:37,448 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:25:37,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:25:37,448 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:25:37,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:25:37,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1080421452, now seen corresponding path program 7 times [2019-12-07 14:25:37,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 14:25:37,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486007146] [2019-12-07 14:25:37,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:25:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:25:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:25:37,520 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 14:25:37,520 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:25:37,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= 0 |v_ULTIMATE.start_main_~#t2399~0.offset_26|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39| 1)) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2399~0.base_39|) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2399~0.base_39| 4)) (= v_~y~0_189 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39|) |v_ULTIMATE.start_main_~#t2399~0.offset_26| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39|)) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2399~0.offset=|v_ULTIMATE.start_main_~#t2399~0.offset_26|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2399~0.base=|v_ULTIMATE.start_main_~#t2399~0.base_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_25|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2400~0.base, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2399~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_~#t2399~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2401~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2401~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2400~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:25:37,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:25:37,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2400~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11|) |v_ULTIMATE.start_main_~#t2400~0.offset_10| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2400~0.base_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11| 1) |v_#valid_39|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2400~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2400~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2400~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t2400~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:25:37,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11|) |v_ULTIMATE.start_main_~#t2401~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2401~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2401~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2401~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2401~0.base] because there is no mapped edge [2019-12-07 14:25:37,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1591910011 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In1591910011| |P2Thread1of1ForFork2_#t~ite23_Out1591910011|) (= |P2Thread1of1ForFork2_#t~ite24_Out1591910011| ~y$w_buff1~0_In1591910011)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1591910011 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1591910011 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd3~0_In1591910011 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1591910011 256) 0))) (= |P2Thread1of1ForFork2_#t~ite23_Out1591910011| |P2Thread1of1ForFork2_#t~ite24_Out1591910011|) .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out1591910011| ~y$w_buff1~0_In1591910011)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1591910011|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1591910011, ~y$w_buff1~0=~y$w_buff1~0_In1591910011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591910011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1591910011, ~weak$$choice2~0=~weak$$choice2~0_In1591910011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591910011} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1591910011|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1591910011|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1591910011, ~y$w_buff1~0=~y$w_buff1~0_In1591910011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591910011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1591910011, ~weak$$choice2~0=~weak$$choice2~0_In1591910011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591910011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 14:25:37,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1642538921 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1642538921| |P2Thread1of1ForFork2_#t~ite26_Out-1642538921|) (= ~y$w_buff0_used~0_In-1642538921 |P2Thread1of1ForFork2_#t~ite26_Out-1642538921|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1642538921 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1642538921 256))) (and (= (mod ~y$r_buff1_thd3~0_In-1642538921 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1642538921 256)))) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1642538921| ~y$w_buff0_used~0_In-1642538921) (= |P2Thread1of1ForFork2_#t~ite26_In-1642538921| |P2Thread1of1ForFork2_#t~ite26_Out-1642538921|) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1642538921, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1642538921|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1642538921, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1642538921, ~weak$$choice2~0=~weak$$choice2~0_In-1642538921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1642538921} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1642538921|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1642538921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1642538921, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1642538921, ~weak$$choice2~0=~weak$$choice2~0_In-1642538921, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1642538921|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1642538921} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 14:25:37,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-914854319 256) 0))) (or (and (= ~y$w_buff1_used~0_In-914854319 |P2Thread1of1ForFork2_#t~ite30_Out-914854319|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In-914854319| |P2Thread1of1ForFork2_#t~ite29_Out-914854319|)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-914854319| ~y$w_buff1_used~0_In-914854319) (= |P2Thread1of1ForFork2_#t~ite29_Out-914854319| |P2Thread1of1ForFork2_#t~ite30_Out-914854319|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-914854319 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-914854319 256)) (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-914854319 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-914854319 256)))))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-914854319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-914854319, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-914854319, ~weak$$choice2~0=~weak$$choice2~0_In-914854319, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-914854319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914854319} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-914854319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-914854319, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-914854319|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-914854319, ~weak$$choice2~0=~weak$$choice2~0_In-914854319, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-914854319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914854319} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 14:25:37,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 14:25:37,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 14:25:37,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-467164207 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-467164207 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-467164207| ~y~0_In-467164207) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-467164207| ~y$w_buff1~0_In-467164207) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-467164207, ~y$w_buff1~0=~y$w_buff1~0_In-467164207, ~y~0=~y~0_In-467164207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-467164207} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-467164207, ~y$w_buff1~0=~y$w_buff1~0_In-467164207, ~y~0=~y~0_In-467164207, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-467164207|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-467164207} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 14:25:37,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In230798634 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In230798634 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out230798634| ~y$w_buff0_used~0_In230798634)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out230798634| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In230798634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230798634} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out230798634|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In230798634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230798634} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:25:37,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In738178807 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In738178807 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In738178807 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In738178807 256)))) (or (and (= ~y$w_buff1_used~0_In738178807 |P0Thread1of1ForFork0_#t~ite6_Out738178807|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out738178807|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In738178807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In738178807, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In738178807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In738178807} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out738178807|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In738178807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In738178807, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In738178807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In738178807} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:25:37,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1465430992 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1465430992 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out1465430992| |P1Thread1of1ForFork1_#t~ite9_Out1465430992|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1465430992| ~y$w_buff1~0_In1465430992) (not .cse0) (not .cse1) .cse2) (and (= ~y~0_In1465430992 |P1Thread1of1ForFork1_#t~ite9_Out1465430992|) (or .cse1 .cse0) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1465430992, ~y$w_buff1~0=~y$w_buff1~0_In1465430992, ~y~0=~y~0_In1465430992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1465430992} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1465430992, ~y$w_buff1~0=~y$w_buff1~0_In1465430992, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1465430992|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1465430992|, ~y~0=~y~0_In1465430992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1465430992} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 14:25:37,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 14:25:37,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1126165676 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1126165676 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1126165676 |P2Thread1of1ForFork2_#t~ite40_Out1126165676|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1126165676|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1126165676, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1126165676} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1126165676, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1126165676, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1126165676|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 14:25:37,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In2078274004 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2078274004 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2078274004 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In2078274004 256) 0))) (or (and (= ~y$w_buff1_used~0_In2078274004 |P2Thread1of1ForFork2_#t~ite41_Out2078274004|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out2078274004|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078274004, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078274004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078274004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078274004} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078274004, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078274004, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out2078274004|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078274004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078274004} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 14:25:37,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-32514386 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-32514386 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-32514386| ~y$r_buff0_thd3~0_In-32514386) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-32514386| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-32514386, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-32514386} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-32514386, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-32514386|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-32514386} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 14:25:37,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1353549744 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1353549744 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1353549744 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1353549744 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1353549744 |P2Thread1of1ForFork2_#t~ite43_Out-1353549744|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1353549744| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1353549744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353549744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1353549744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353549744} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1353549744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353549744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1353549744, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1353549744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353549744} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 14:25:37,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out1855236685 ~y$r_buff0_thd1~0_In1855236685)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1855236685 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1855236685 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~y$r_buff0_thd1~0_Out1855236685 0) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1855236685, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1855236685} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1855236685, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1855236685|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1855236685} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:25:37,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1629351781 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1629351781 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1629351781 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1629351781 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1629351781| ~y$r_buff1_thd1~0_In-1629351781) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1629351781| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1629351781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1629351781, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1629351781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629351781} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1629351781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1629351781, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1629351781|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1629351781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629351781} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:25:37,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:25:37,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 14:25:37,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In688827863 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In688827863 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out688827863| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out688827863| ~y$w_buff0_used~0_In688827863) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In688827863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In688827863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In688827863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In688827863, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out688827863|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 14:25:37,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1067130461 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1067130461 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1067130461 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1067130461 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1067130461|)) (and (= ~y$w_buff1_used~0_In-1067130461 |P1Thread1of1ForFork1_#t~ite12_Out-1067130461|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1067130461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067130461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1067130461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067130461} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1067130461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067130461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1067130461, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1067130461|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067130461} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 14:25:37,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-428616939 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-428616939 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-428616939| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-428616939| ~y$r_buff0_thd2~0_In-428616939) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-428616939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-428616939} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-428616939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-428616939, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-428616939|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 14:25:37,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In159198614 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In159198614 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In159198614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In159198614 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out159198614|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out159198614| ~y$r_buff1_thd2~0_In159198614)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In159198614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In159198614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In159198614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159198614} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In159198614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In159198614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In159198614, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out159198614|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159198614} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 14:25:37,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:25:37,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:25:37,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1700508112 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1700508112 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1700508112| ~y~0_In-1700508112) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1700508112| ~y$w_buff1~0_In-1700508112) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1700508112, ~y~0=~y~0_In-1700508112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1700508112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1700508112} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1700508112, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1700508112|, ~y~0=~y~0_In-1700508112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1700508112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1700508112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 14:25:37,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 14:25:37,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In538531409 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In538531409 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In538531409 |ULTIMATE.start_main_#t~ite49_Out538531409|)) (and (= |ULTIMATE.start_main_#t~ite49_Out538531409| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In538531409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538531409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In538531409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538531409, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out538531409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 14:25:37,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1954978472 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1954978472 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1954978472 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1954978472 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1954978472| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out1954978472| ~y$w_buff1_used~0_In1954978472) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1954978472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1954978472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1954978472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1954978472} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1954978472|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1954978472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1954978472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1954978472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1954978472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 14:25:37,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-665195667 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-665195667 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-665195667| 0)) (and (= ~y$r_buff0_thd0~0_In-665195667 |ULTIMATE.start_main_#t~ite51_Out-665195667|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-665195667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-665195667} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-665195667|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-665195667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-665195667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 14:25:37,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-197686713 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-197686713 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-197686713 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-197686713 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-197686713|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-197686713 |ULTIMATE.start_main_#t~ite52_Out-197686713|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-197686713, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-197686713, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-197686713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-197686713} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-197686713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-197686713, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-197686713, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-197686713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-197686713} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 14:25:37,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:25:37,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:25:37 BasicIcfg [2019-12-07 14:25:37,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:25:37,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:25:37,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:25:37,590 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:25:37,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:24:10" (3/4) ... [2019-12-07 14:25:37,593 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 14:25:37,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L815: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= 0 v_~__unbuffered_p2_EAX~0_43) (= v_~y$r_buff1_thd1~0_178 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$w_buff1_used~0_439 0) (= v_~y$w_buff1~0_188 0) (= 0 v_~y$r_buff1_thd3~0_309) (= 0 |v_ULTIMATE.start_main_~#t2399~0.offset_26|) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff1_thd0~0_201 0) (= v_~main$tmp_guard0~0_41 0) (= 0 v_~y$w_buff0~0_254) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39| 1)) (= 0 v_~y$r_buff0_thd3~0_343) (< 0 |v_#StackHeapBarrier_15|) (= v_~main$tmp_guard1~0_39 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 v_~y$flush_delayed~0_35) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2399~0.base_39|) (= 0 v_~y$r_buff0_thd2~0_104) (= v_~weak$$choice2~0_129 0) (= 0 |v_#NULL.base_4|) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_134 0) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= v_~y$w_buff0_used~0_785 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x~0_158) (= 0 v_~y$r_buff1_thd2~0_197) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2399~0.base_39| 4)) (= v_~y~0_189 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2399~0.base_39|) |v_ULTIMATE.start_main_~#t2399~0.offset_26| 0)) |v_#memory_int_23|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2399~0.base_39|)) (= v_~y$r_buff0_thd1~0_218 0) (= v_~__unbuffered_cnt~0_118 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_785, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_37|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_133|, ULTIMATE.start_main_~#t2399~0.offset=|v_ULTIMATE.start_main_~#t2399~0.offset_26|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_293|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_104|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_47|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t2399~0.base=|v_ULTIMATE.start_main_~#t2399~0.base_39|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_78|, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_309, ~y$w_buff0~0=v_~y$w_buff0~0_254, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_343, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_218, ~y$flush_delayed~0=v_~y$flush_delayed~0_35, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_43, ~y~0=v_~y~0_189, ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_20|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_18|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_197, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_25|, ~y$w_buff1~0=v_~y$w_buff1~0_188, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_134, #valid=|v_#valid_72|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_104, #memory_int=|v_#memory_int_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_118, ~weak$$choice2~0=v_~weak$$choice2~0_129, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_201, ~x~0=v_~x~0_158, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_439} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t2400~0.base, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t2399~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_~#t2399~0.base, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~y$r_buff1_thd3~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~y~0, ULTIMATE.start_main_~#t2401~0.offset, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_#t~nondet45, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t2401~0.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2400~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:25:37,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff1_used~0_76 v_~y$w_buff0_used~0_125) (= v_~y$w_buff0~0_37 v_~y$w_buff1~0_27) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|) (= v_~y$w_buff0_used~0_124 1) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= 1 v_~y$w_buff0~0_36) (= |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11| (ite (not (and (not (= 0 (mod v_~y$w_buff1_used~0_76 256))) (not (= (mod v_~y$w_buff0_used~0_124 256) 0)))) 1 0)) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13 0))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_125, ~y$w_buff0~0=v_~y$w_buff0~0_37, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_27, ~y$w_buff0~0=v_~y$w_buff0~0_36, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_13, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_11|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_76} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 14:25:37,594 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L815-1-->L817: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2400~0.offset_10|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2400~0.base_11|) |v_ULTIMATE.start_main_~#t2400~0.offset_10| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2400~0.base_11|) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11| 1) |v_#valid_39|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2400~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t2400~0.base_11|)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2400~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2400~0.offset=|v_ULTIMATE.start_main_~#t2400~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, ULTIMATE.start_main_~#t2400~0.base=|v_ULTIMATE.start_main_~#t2400~0.base_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2400~0.offset, ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t2400~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 14:25:37,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L817-1-->L819: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2401~0.base_11|) |v_ULTIMATE.start_main_~#t2401~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t2401~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2401~0.base_11| 4)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2401~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2401~0.offset_10|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2401~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2401~0.offset=|v_ULTIMATE.start_main_~#t2401~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_31|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2401~0.base=|v_ULTIMATE.start_main_~#t2401~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2401~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t2401~0.base] because there is no mapped edge [2019-12-07 14:25:37,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L782-->L782-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1591910011 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite23_In1591910011| |P2Thread1of1ForFork2_#t~ite23_Out1591910011|) (= |P2Thread1of1ForFork2_#t~ite24_Out1591910011| ~y$w_buff1~0_In1591910011)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1591910011 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1591910011 256)) .cse1) (and (= 0 (mod ~y$r_buff1_thd3~0_In1591910011 256)) .cse1) (= (mod ~y$w_buff0_used~0_In1591910011 256) 0))) (= |P2Thread1of1ForFork2_#t~ite23_Out1591910011| |P2Thread1of1ForFork2_#t~ite24_Out1591910011|) .cse0 (= |P2Thread1of1ForFork2_#t~ite23_Out1591910011| ~y$w_buff1~0_In1591910011)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In1591910011|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1591910011, ~y$w_buff1~0=~y$w_buff1~0_In1591910011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591910011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1591910011, ~weak$$choice2~0=~weak$$choice2~0_In1591910011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591910011} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out1591910011|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out1591910011|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1591910011, ~y$w_buff1~0=~y$w_buff1~0_In1591910011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591910011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1591910011, ~weak$$choice2~0=~weak$$choice2~0_In1591910011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1591910011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-07 14:25:37,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L783-->L783-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1642538921 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1642538921| |P2Thread1of1ForFork2_#t~ite26_Out-1642538921|) (= ~y$w_buff0_used~0_In-1642538921 |P2Thread1of1ForFork2_#t~ite26_Out-1642538921|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1642538921 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-1642538921 256))) (and (= (mod ~y$r_buff1_thd3~0_In-1642538921 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-1642538921 256)))) .cse1) (and (= |P2Thread1of1ForFork2_#t~ite27_Out-1642538921| ~y$w_buff0_used~0_In-1642538921) (= |P2Thread1of1ForFork2_#t~ite26_In-1642538921| |P2Thread1of1ForFork2_#t~ite26_Out-1642538921|) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1642538921, P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1642538921|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1642538921, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1642538921, ~weak$$choice2~0=~weak$$choice2~0_In-1642538921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1642538921} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1642538921|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1642538921, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1642538921, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1642538921, ~weak$$choice2~0=~weak$$choice2~0_In-1642538921, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1642538921|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1642538921} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-07 14:25:37,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L784-->L784-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-914854319 256) 0))) (or (and (= ~y$w_buff1_used~0_In-914854319 |P2Thread1of1ForFork2_#t~ite30_Out-914854319|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite29_In-914854319| |P2Thread1of1ForFork2_#t~ite29_Out-914854319|)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite29_Out-914854319| ~y$w_buff1_used~0_In-914854319) (= |P2Thread1of1ForFork2_#t~ite29_Out-914854319| |P2Thread1of1ForFork2_#t~ite30_Out-914854319|) (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-914854319 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-914854319 256)) (and .cse1 (= (mod ~y$r_buff1_thd3~0_In-914854319 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-914854319 256)))))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-914854319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-914854319, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-914854319, ~weak$$choice2~0=~weak$$choice2~0_In-914854319, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In-914854319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914854319} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-914854319, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-914854319, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-914854319|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-914854319, ~weak$$choice2~0=~weak$$choice2~0_In-914854319, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-914854319|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-914854319} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-07 14:25:37,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L785-->L786: Formula: (and (= v_~y$r_buff0_thd3~0_93 v_~y$r_buff0_thd3~0_92) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_93, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_6|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_92, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_8|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite32] because there is no mapped edge [2019-12-07 14:25:37,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L788-->L792: Formula: (and (= v_~y~0_52 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_7 256))) (= 0 v_~y$flush_delayed~0_6)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_52} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-07 14:25:37,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L792-2-->L792-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In-467164207 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-467164207 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-467164207| ~y~0_In-467164207) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite38_Out-467164207| ~y$w_buff1~0_In-467164207) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-467164207, ~y$w_buff1~0=~y$w_buff1~0_In-467164207, ~y~0=~y~0_In-467164207, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-467164207} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-467164207, ~y$w_buff1~0=~y$w_buff1~0_In-467164207, ~y~0=~y~0_In-467164207, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-467164207|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-467164207} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 14:25:37,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L743-->L743-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In230798634 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In230798634 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out230798634| ~y$w_buff0_used~0_In230798634)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out230798634| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In230798634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230798634} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out230798634|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In230798634, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In230798634} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-07 14:25:37,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L744-->L744-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In738178807 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In738178807 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In738178807 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In738178807 256)))) (or (and (= ~y$w_buff1_used~0_In738178807 |P0Thread1of1ForFork0_#t~ite6_Out738178807|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out738178807|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In738178807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In738178807, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In738178807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In738178807} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out738178807|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In738178807, ~y$w_buff0_used~0=~y$w_buff0_used~0_In738178807, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In738178807, ~y$w_buff1_used~0=~y$w_buff1_used~0_In738178807} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-07 14:25:37,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L759-2-->L759-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1465430992 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1465430992 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite10_Out1465430992| |P1Thread1of1ForFork1_#t~ite9_Out1465430992|))) (or (and (= |P1Thread1of1ForFork1_#t~ite9_Out1465430992| ~y$w_buff1~0_In1465430992) (not .cse0) (not .cse1) .cse2) (and (= ~y~0_In1465430992 |P1Thread1of1ForFork1_#t~ite9_Out1465430992|) (or .cse1 .cse0) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1465430992, ~y$w_buff1~0=~y$w_buff1~0_In1465430992, ~y~0=~y~0_In1465430992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1465430992} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1465430992, ~y$w_buff1~0=~y$w_buff1~0_In1465430992, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1465430992|, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1465430992|, ~y~0=~y~0_In1465430992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1465430992} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-07 14:25:37,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L792-4-->L793: Formula: (= v_~y~0_32 |v_P2Thread1of1ForFork2_#t~ite38_10|) InVars {P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_10|} OutVars{~y~0=v_~y~0_32, P2Thread1of1ForFork2_#t~ite39=|v_P2Thread1of1ForFork2_#t~ite39_5|, P2Thread1of1ForFork2_#t~ite38=|v_P2Thread1of1ForFork2_#t~ite38_9|} AuxVars[] AssignedVars[~y~0, P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-07 14:25:37,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L793-->L793-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1126165676 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1126165676 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1126165676 |P2Thread1of1ForFork2_#t~ite40_Out1126165676|)) (and (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1126165676|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1126165676, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1126165676} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1126165676, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1126165676, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1126165676|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-07 14:25:37,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd3~0_In2078274004 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2078274004 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In2078274004 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In2078274004 256) 0))) (or (and (= ~y$w_buff1_used~0_In2078274004 |P2Thread1of1ForFork2_#t~ite41_Out2078274004|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite41_Out2078274004|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078274004, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078274004, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078274004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078274004} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2078274004, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2078274004, P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out2078274004|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2078274004, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2078274004} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-07 14:25:37,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L795-->L795-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-32514386 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-32514386 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite42_Out-32514386| ~y$r_buff0_thd3~0_In-32514386) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-32514386| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-32514386, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-32514386} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-32514386, P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-32514386|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-32514386} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-07 14:25:37,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In-1353549744 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1353549744 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1353549744 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1353549744 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1353549744 |P2Thread1of1ForFork2_#t~ite43_Out-1353549744|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite43_Out-1353549744| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1353549744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353549744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1353549744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353549744} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1353549744, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1353549744, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1353549744, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1353549744|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1353549744} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 14:25:37,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L745-->L746: Formula: (let ((.cse0 (= ~y$r_buff0_thd1~0_Out1855236685 ~y$r_buff0_thd1~0_In1855236685)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In1855236685 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1855236685 256)))) (or (and .cse0 .cse1) (and .cse0 .cse2) (and (= ~y$r_buff0_thd1~0_Out1855236685 0) (not .cse2) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1855236685, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1855236685} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1855236685, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1855236685|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1855236685} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 14:25:37,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1629351781 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-1629351781 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1629351781 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1629351781 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1629351781| ~y$r_buff1_thd1~0_In-1629351781) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1629351781| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1629351781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1629351781, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1629351781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629351781} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1629351781, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1629351781, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1629351781|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1629351781, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1629351781} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-07 14:25:37,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L746-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_95 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_95, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 14:25:37,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L796-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite43_32| v_~y$r_buff1_thd3~0_152)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_152, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_31|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 14:25:37,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In688827863 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In688827863 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out688827863| 0)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out688827863| ~y$w_buff0_used~0_In688827863) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In688827863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In688827863} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In688827863, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In688827863, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out688827863|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-07 14:25:37,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L761-->L761-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1067130461 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1067130461 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1067130461 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1067130461 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1067130461|)) (and (= ~y$w_buff1_used~0_In-1067130461 |P1Thread1of1ForFork1_#t~ite12_Out-1067130461|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1067130461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067130461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1067130461, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067130461} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1067130461, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1067130461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1067130461, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1067130461|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1067130461} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-07 14:25:37,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L762-->L762-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-428616939 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-428616939 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-428616939| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out-428616939| ~y$r_buff0_thd2~0_In-428616939) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-428616939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-428616939} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-428616939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-428616939, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-428616939|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-07 14:25:37,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In159198614 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In159198614 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In159198614 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In159198614 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out159198614|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite14_Out159198614| ~y$r_buff1_thd2~0_In159198614)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In159198614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In159198614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In159198614, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159198614} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In159198614, ~y$w_buff0_used~0=~y$w_buff0_used~0_In159198614, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In159198614, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out159198614|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In159198614} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-07 14:25:37,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L763-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1)) (= v_~y$r_buff1_thd2~0_109 |v_P1Thread1of1ForFork1_#t~ite14_30|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_109, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 14:25:37,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L823-->L825-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_137 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_31 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_31, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 14:25:37,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L825-2-->L825-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1700508112 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1700508112 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1700508112| ~y~0_In-1700508112) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite47_Out-1700508112| ~y$w_buff1~0_In-1700508112) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1700508112, ~y~0=~y~0_In-1700508112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1700508112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1700508112} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1700508112, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1700508112|, ~y~0=~y~0_In-1700508112, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1700508112, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1700508112} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 14:25:37,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L825-4-->L826: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~y~0=v_~y~0_31} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~y~0] because there is no mapped edge [2019-12-07 14:25:37,609 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In538531409 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In538531409 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In538531409 |ULTIMATE.start_main_#t~ite49_Out538531409|)) (and (= |ULTIMATE.start_main_#t~ite49_Out538531409| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In538531409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538531409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In538531409, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In538531409, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out538531409|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 14:25:37,610 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L827-->L827-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1954978472 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1954978472 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1954978472 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1954978472 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out1954978472| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite50_Out1954978472| ~y$w_buff1_used~0_In1954978472) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1954978472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1954978472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1954978472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1954978472} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1954978472|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1954978472, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1954978472, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1954978472, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1954978472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 14:25:37,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-665195667 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-665195667 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-665195667| 0)) (and (= ~y$r_buff0_thd0~0_In-665195667 |ULTIMATE.start_main_#t~ite51_Out-665195667|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-665195667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-665195667} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-665195667|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-665195667, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-665195667} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 14:25:37,611 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L829-->L829-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-197686713 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-197686713 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-197686713 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-197686713 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite52_Out-197686713|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-197686713 |ULTIMATE.start_main_#t~ite52_Out-197686713|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-197686713, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-197686713, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-197686713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-197686713} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-197686713|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-197686713, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-197686713, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-197686713, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-197686713} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 14:25:37,612 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L829-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 2 v_~x~0_130) (= 2 v_~__unbuffered_p2_EAX~0_23) (= v_~__unbuffered_p2_EBX~0_31 0))) 1 0)) 0 1)) (= v_~y$r_buff1_thd0~0_163 |v_ULTIMATE.start_main_#t~ite52_41|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_41|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_40|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_31, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_130, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_163, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 14:25:37,670 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0ff375df-0810-4902-b91b-a9dac1a4fc34/bin/utaipan/witness.graphml [2019-12-07 14:25:37,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:25:37,671 INFO L168 Benchmark]: Toolchain (without parser) took 87828.68 ms. Allocated memory was 1.0 GB in the beginning and 6.9 GB in the end (delta: 5.9 GB). Free memory was 934.4 MB in the beginning and 2.7 GB in the end (delta: -1.8 GB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-12-07 14:25:37,672 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:25:37,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:37,672 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:37,672 INFO L168 Benchmark]: Boogie Preprocessor took 26.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:25:37,673 INFO L168 Benchmark]: RCFGBuilder took 409.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:37,673 INFO L168 Benchmark]: TraceAbstraction took 86889.46 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. [2019-12-07 14:25:37,673 INFO L168 Benchmark]: Witness Printer took 80.29 ms. Allocated memory is still 6.9 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:25:37,674 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 379.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 934.4 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 409.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86889.46 ms. Allocated memory was 1.1 GB in the beginning and 6.9 GB in the end (delta: 5.8 GB). Free memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: -1.8 GB). Peak memory consumption was 4.0 GB. Max. memory is 11.5 GB. * Witness Printer took 80.29 ms. Allocated memory is still 6.9 GB. Free memory was 2.8 GB in the beginning and 2.7 GB in the end (delta: 57.5 MB). Peak memory consumption was 57.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.2s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 103 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 31 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 252 VarBasedMoverChecksNegative, 75 SemBasedMoverChecksPositive, 241 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 78269 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L815] FCALL, FORK 0 pthread_create(&t2399, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L733] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L734] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L735] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L736] 1 y$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] FCALL, FORK 0 pthread_create(&t2400, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L819] FCALL, FORK 0 pthread_create(&t2401, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 3 __unbuffered_p2_EAX = x [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 y$flush_delayed = weak$$choice2 [L779] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L792] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L743] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L744] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y=0] [L793] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L759] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L821] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 86.7s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 26.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5601 SDtfs, 7873 SDslu, 22722 SDs, 0 SdLazy, 13417 SolverSat, 395 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 352 GetRequests, 31 SyntacticMatches, 20 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2497 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195490occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 262062 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1040 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 950 ConstructedInterpolants, 0 QuantifiedInterpolants, 306721 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...