./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_rmo.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_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/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 d7cb8982ef8fcbc6dd237835e3a4e45e7338e5b9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 11:40:06,177 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:40:06,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:40:06,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:40:06,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:40:06,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:40:06,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:40:06,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:40:06,191 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:40:06,191 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:40:06,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:40:06,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:40:06,193 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:40:06,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:40:06,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:40:06,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:40:06,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:40:06,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:40:06,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:40:06,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:40:06,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:40:06,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:40:06,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:40:06,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:40:06,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:40:06,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:40:06,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:40:06,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:40:06,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:40:06,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:40:06,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:40:06,205 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:40:06,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:40:06,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:40:06,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:40:06,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:40:06,207 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:40:06,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:40:06,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:40:06,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:40:06,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:40:06,209 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 11:40:06,219 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:40:06,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:40:06,219 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 11:40:06,220 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 11:40:06,220 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 11:40:06,220 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 11:40:06,220 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 11:40:06,220 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 11:40:06,220 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 11:40:06,220 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 11:40:06,220 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 11:40:06,221 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 11:40:06,221 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 11:40:06,221 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 11:40:06,221 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 11:40:06,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:40:06,222 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 11:40:06,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:40:06,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:40:06,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:40:06,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:40:06,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:40:06,223 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:40:06,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:40:06,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:40:06,223 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:40:06,224 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:40:06,224 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:40:06,224 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 11:40:06,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:40:06,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:40:06,224 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:40:06,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:40:06,224 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_826c759e-a928-49a3-abdf-cdfcf8594ef9/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 -> d7cb8982ef8fcbc6dd237835e3a4e45e7338e5b9 [2019-12-07 11:40:06,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:40:06,333 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:40:06,336 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:40:06,337 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:40:06,337 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:40:06,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix038_rmo.oepc.i [2019-12-07 11:40:06,379 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/data/2a8973585/2648ae1f552f429dad669be30de3862b/FLAGd0e336191 [2019-12-07 11:40:06,725 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:40:06,725 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/sv-benchmarks/c/pthread-wmm/mix038_rmo.oepc.i [2019-12-07 11:40:06,735 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/data/2a8973585/2648ae1f552f429dad669be30de3862b/FLAGd0e336191 [2019-12-07 11:40:06,744 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/data/2a8973585/2648ae1f552f429dad669be30de3862b [2019-12-07 11:40:06,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:40:06,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:40:06,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:40:06,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:40:06,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:40:06,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:40:06" (1/1) ... [2019-12-07 11:40:06,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d85a783 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:06, skipping insertion in model container [2019-12-07 11:40:06,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:40:06" (1/1) ... [2019-12-07 11:40:06,758 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:40:06,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:40:07,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:40:07,048 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:40:07,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:40:07,139 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:40:07,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07 WrapperNode [2019-12-07 11:40:07,139 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:40:07,140 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:40:07,140 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:40:07,140 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:40:07,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,160 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:40:07,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:40:07,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:40:07,180 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:40:07,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,197 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... [2019-12-07 11:40:07,206 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:40:07,206 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:40:07,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:40:07,207 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:40:07,207 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/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 11:40:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 11:40:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 11:40:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:40:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:40:07,256 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 11:40:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 11:40:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 11:40:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 11:40:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 11:40:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 11:40:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 11:40:07,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:40:07,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:40:07,259 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 11:40:07,628 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:40:07,628 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 11:40:07,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:40:07 BoogieIcfgContainer [2019-12-07 11:40:07,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:40:07,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:40:07,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:40:07,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:40:07,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:40:06" (1/3) ... [2019-12-07 11:40:07,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a71c149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:40:07, skipping insertion in model container [2019-12-07 11:40:07,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:40:07" (2/3) ... [2019-12-07 11:40:07,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a71c149 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:40:07, skipping insertion in model container [2019-12-07 11:40:07,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:40:07" (3/3) ... [2019-12-07 11:40:07,635 INFO L109 eAbstractionObserver]: Analyzing ICFG mix038_rmo.oepc.i [2019-12-07 11:40:07,643 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 11:40:07,643 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:40:07,648 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:40:07,649 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 11:40:07,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,682 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,687 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,688 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,688 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,689 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,690 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,691 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,692 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,693 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,694 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,695 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 11:40:07,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 11:40:07,734 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:40:07,734 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:40:07,734 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:40:07,734 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:40:07,734 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:40:07,734 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:40:07,734 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:40:07,734 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:40:07,745 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-07 11:40:07,746 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 11:40:07,811 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 11:40:07,811 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:40:07,820 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 11:40:07,836 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-07 11:40:07,866 INFO L134 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-07 11:40:07,866 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 11:40:07,872 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 699 event pairs. 9/171 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 11:40:07,890 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 11:40:07,891 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 11:40:10,966 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-07 11:40:11,309 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-07 11:40:11,397 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-07 11:40:11,397 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 11:40:11,399 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-07 11:40:23,213 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-07 11:40:23,215 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-07 11:40:23,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 11:40:23,219 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:23,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 11:40:23,219 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 11:40:23,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:23,223 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-07 11:40:23,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:23,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984498761] [2019-12-07 11:40:23,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:23,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:23,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984498761] [2019-12-07 11:40:23,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:23,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 11:40:23,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112309158] [2019-12-07 11:40:23,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:40:23,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:23,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:40:23,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:23,379 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-07 11:40:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:24,047 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-07 11:40:24,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:40:24,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 11:40:24,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:24,449 INFO L225 Difference]: With dead ends: 101544 [2019-12-07 11:40:24,449 INFO L226 Difference]: Without dead ends: 95304 [2019-12-07 11:40:24,450 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 11:40:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-07 11:40:30,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-07 11:40:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-07 11:40:31,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-07 11:40:31,137 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-07 11:40:31,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:31,137 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-07 11:40:31,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:40:31,138 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-07 11:40:31,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 11:40:31,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:31,140 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:31,141 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 11:40:31,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:31,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-07 11:40:31,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:31,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501604250] [2019-12-07 11:40:31,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:31,196 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 11:40:31,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501604250] [2019-12-07 11:40:31,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:31,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:40:31,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189900227] [2019-12-07 11:40:31,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:40:31,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:31,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:40:31,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:40:31,198 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-07 11:40:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:32,027 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-07 11:40:32,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:40:32,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 11:40:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:32,400 INFO L225 Difference]: With dead ends: 152040 [2019-12-07 11:40:32,400 INFO L226 Difference]: Without dead ends: 151991 [2019-12-07 11:40:32,401 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 11:40:36,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-07 11:40:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-07 11:40:39,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-07 11:40:40,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-07 11:40:40,221 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-07 11:40:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:40,222 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-07 11:40:40,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:40:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-07 11:40:40,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 11:40:40,226 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:40,226 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:40,227 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 11:40:40,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:40,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-07 11:40:40,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:40,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457497318] [2019-12-07 11:40:40,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:40,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 11:40:40,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457497318] [2019-12-07 11:40:40,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:40,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:40:40,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670649278] [2019-12-07 11:40:40,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:40:40,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:40,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:40:40,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:40,266 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-07 11:40:40,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:40,353 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-07 11:40:40,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:40:40,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-07 11:40:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:40,398 INFO L225 Difference]: With dead ends: 30915 [2019-12-07 11:40:40,398 INFO L226 Difference]: Without dead ends: 30915 [2019-12-07 11:40:40,399 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-07 11:40:41,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-07 11:40:41,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-07 11:40:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-07 11:40:41,161 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-07 11:40:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:41,161 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-07 11:40:41,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:40:41,161 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-07 11:40:41,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:40:41,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:41,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:41,163 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 11:40:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:41,163 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-07 11:40:41,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:41,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594736788] [2019-12-07 11:40:41,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:41,209 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 11:40:41,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594736788] [2019-12-07 11:40:41,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:41,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:40:41,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345457375] [2019-12-07 11:40:41,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:40:41,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:41,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:40:41,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:40:41,210 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-07 11:40:41,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:41,423 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-07 11:40:41,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:40:41,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:40:41,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:41,476 INFO L225 Difference]: With dead ends: 38538 [2019-12-07 11:40:41,476 INFO L226 Difference]: Without dead ends: 38538 [2019-12-07 11:40:41,477 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 11:40:41,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-07 11:40:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-07 11:40:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-07 11:40:42,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-07 11:40:42,050 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-07 11:40:42,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:42,051 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-07 11:40:42,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:40:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-07 11:40:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:40:42,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:42,058 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 11:40:42,058 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 11:40:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-07 11:40:42,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:42,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459393232] [2019-12-07 11:40:42,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:42,120 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 11:40:42,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459393232] [2019-12-07 11:40:42,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:42,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:40:42,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380050621] [2019-12-07 11:40:42,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:40:42,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:42,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:40:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:40:42,121 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 5 states. [2019-12-07 11:40:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:42,517 INFO L93 Difference]: Finished difference Result 44779 states and 142105 transitions. [2019-12-07 11:40:42,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:40:42,518 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 11:40:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:42,575 INFO L225 Difference]: With dead ends: 44779 [2019-12-07 11:40:42,576 INFO L226 Difference]: Without dead ends: 44772 [2019-12-07 11:40:42,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:40:42,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44772 states. [2019-12-07 11:40:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44772 to 34062. [2019-12-07 11:40:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-07 11:40:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-07 11:40:43,182 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-07 11:40:43,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:43,182 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-07 11:40:43,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:40:43,182 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-07 11:40:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:40:43,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:43,191 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 11:40:43,191 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 11:40:43,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-07 11:40:43,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:43,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426611686] [2019-12-07 11:40:43,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:43,251 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 11:40:43,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426611686] [2019-12-07 11:40:43,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:43,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:40:43,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536788089] [2019-12-07 11:40:43,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:40:43,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:43,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:40:43,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:40:43,253 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 5 states. [2019-12-07 11:40:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:43,599 INFO L93 Difference]: Finished difference Result 48290 states and 152456 transitions. [2019-12-07 11:40:43,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 11:40:43,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 11:40:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:43,663 INFO L225 Difference]: With dead ends: 48290 [2019-12-07 11:40:43,663 INFO L226 Difference]: Without dead ends: 48277 [2019-12-07 11:40:43,664 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:40:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48277 states. [2019-12-07 11:40:44,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48277 to 39783. [2019-12-07 11:40:44,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39783 states. [2019-12-07 11:40:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39783 states to 39783 states and 127731 transitions. [2019-12-07 11:40:44,544 INFO L78 Accepts]: Start accepts. Automaton has 39783 states and 127731 transitions. Word has length 25 [2019-12-07 11:40:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:44,545 INFO L462 AbstractCegarLoop]: Abstraction has 39783 states and 127731 transitions. [2019-12-07 11:40:44,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:40:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 39783 states and 127731 transitions. [2019-12-07 11:40:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:40:44,554 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:44,554 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 11:40:44,555 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 11:40:44,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:44,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-07 11:40:44,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:44,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510622098] [2019-12-07 11:40:44,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:44,586 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 11:40:44,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510622098] [2019-12-07 11:40:44,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:44,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:40:44,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256718353] [2019-12-07 11:40:44,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:40:44,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:44,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:40:44,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:44,587 INFO L87 Difference]: Start difference. First operand 39783 states and 127731 transitions. Second operand 3 states. [2019-12-07 11:40:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:44,743 INFO L93 Difference]: Finished difference Result 56828 states and 180787 transitions. [2019-12-07 11:40:44,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:40:44,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 11:40:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:44,828 INFO L225 Difference]: With dead ends: 56828 [2019-12-07 11:40:44,828 INFO L226 Difference]: Without dead ends: 56828 [2019-12-07 11:40:44,829 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 11:40:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56828 states. [2019-12-07 11:40:45,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56828 to 42213. [2019-12-07 11:40:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42213 states. [2019-12-07 11:40:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42213 states to 42213 states and 135001 transitions. [2019-12-07 11:40:45,574 INFO L78 Accepts]: Start accepts. Automaton has 42213 states and 135001 transitions. Word has length 27 [2019-12-07 11:40:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:45,574 INFO L462 AbstractCegarLoop]: Abstraction has 42213 states and 135001 transitions. [2019-12-07 11:40:45,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:40:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 42213 states and 135001 transitions. [2019-12-07 11:40:45,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:40:45,585 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:45,585 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:45,585 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 11:40:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-07 11:40:45,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:45,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976342005] [2019-12-07 11:40:45,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:45,607 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 11:40:45,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976342005] [2019-12-07 11:40:45,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:45,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:40:45,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582474602] [2019-12-07 11:40:45,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:40:45,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:45,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:40:45,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:45,608 INFO L87 Difference]: Start difference. First operand 42213 states and 135001 transitions. Second operand 3 states. [2019-12-07 11:40:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:45,783 INFO L93 Difference]: Finished difference Result 62192 states and 195378 transitions. [2019-12-07 11:40:45,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:40:45,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 11:40:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:45,872 INFO L225 Difference]: With dead ends: 62192 [2019-12-07 11:40:45,872 INFO L226 Difference]: Without dead ends: 62192 [2019-12-07 11:40:45,872 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 11:40:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62192 states. [2019-12-07 11:40:46,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62192 to 47577. [2019-12-07 11:40:46,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47577 states. [2019-12-07 11:40:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47577 states to 47577 states and 149592 transitions. [2019-12-07 11:40:46,703 INFO L78 Accepts]: Start accepts. Automaton has 47577 states and 149592 transitions. Word has length 27 [2019-12-07 11:40:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:46,703 INFO L462 AbstractCegarLoop]: Abstraction has 47577 states and 149592 transitions. [2019-12-07 11:40:46,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:40:46,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47577 states and 149592 transitions. [2019-12-07 11:40:46,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:40:46,715 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:46,715 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 11:40:46,715 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 11:40:46,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:46,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-07 11:40:46,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:46,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483379689] [2019-12-07 11:40:46,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:46,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483379689] [2019-12-07 11:40:46,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:46,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:40:46,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716304218] [2019-12-07 11:40:46,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:40:46,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:46,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:40:46,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:40:46,778 INFO L87 Difference]: Start difference. First operand 47577 states and 149592 transitions. Second operand 6 states. [2019-12-07 11:40:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:47,320 INFO L93 Difference]: Finished difference Result 89520 states and 280849 transitions. [2019-12-07 11:40:47,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:40:47,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 11:40:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:47,450 INFO L225 Difference]: With dead ends: 89520 [2019-12-07 11:40:47,450 INFO L226 Difference]: Without dead ends: 89501 [2019-12-07 11:40:47,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:40:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89501 states. [2019-12-07 11:40:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89501 to 51874. [2019-12-07 11:40:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51874 states. [2019-12-07 11:40:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51874 states to 51874 states and 162887 transitions. [2019-12-07 11:40:48,581 INFO L78 Accepts]: Start accepts. Automaton has 51874 states and 162887 transitions. Word has length 27 [2019-12-07 11:40:48,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:48,581 INFO L462 AbstractCegarLoop]: Abstraction has 51874 states and 162887 transitions. [2019-12-07 11:40:48,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:40:48,581 INFO L276 IsEmpty]: Start isEmpty. Operand 51874 states and 162887 transitions. [2019-12-07 11:40:48,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:40:48,595 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:48,595 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 11:40:48,595 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 11:40:48,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:48,595 INFO L82 PathProgramCache]: Analyzing trace with hash -665356316, now seen corresponding path program 1 times [2019-12-07 11:40:48,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:48,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276348861] [2019-12-07 11:40:48,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:48,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276348861] [2019-12-07 11:40:48,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:48,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:40:48,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250855789] [2019-12-07 11:40:48,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:40:48,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:48,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:40:48,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:40:48,647 INFO L87 Difference]: Start difference. First operand 51874 states and 162887 transitions. Second operand 5 states. [2019-12-07 11:40:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:49,143 INFO L93 Difference]: Finished difference Result 71552 states and 222438 transitions. [2019-12-07 11:40:49,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:40:49,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 11:40:49,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:49,244 INFO L225 Difference]: With dead ends: 71552 [2019-12-07 11:40:49,244 INFO L226 Difference]: Without dead ends: 71552 [2019-12-07 11:40:49,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:40:49,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71552 states. [2019-12-07 11:40:50,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71552 to 62228. [2019-12-07 11:40:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62228 states. [2019-12-07 11:40:50,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62228 states to 62228 states and 195110 transitions. [2019-12-07 11:40:50,280 INFO L78 Accepts]: Start accepts. Automaton has 62228 states and 195110 transitions. Word has length 28 [2019-12-07 11:40:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:50,281 INFO L462 AbstractCegarLoop]: Abstraction has 62228 states and 195110 transitions. [2019-12-07 11:40:50,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:40:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 62228 states and 195110 transitions. [2019-12-07 11:40:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:40:50,302 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:50,302 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 11:40:50,302 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 11:40:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-07 11:40:50,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:50,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818900585] [2019-12-07 11:40:50,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:50,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:50,367 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 11:40:50,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818900585] [2019-12-07 11:40:50,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:50,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:40:50,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686823649] [2019-12-07 11:40:50,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:40:50,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:50,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:40:50,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:40:50,368 INFO L87 Difference]: Start difference. First operand 62228 states and 195110 transitions. Second operand 6 states. [2019-12-07 11:40:50,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:50,996 INFO L93 Difference]: Finished difference Result 100378 states and 313238 transitions. [2019-12-07 11:40:50,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:40:50,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 11:40:50,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:51,157 INFO L225 Difference]: With dead ends: 100378 [2019-12-07 11:40:51,157 INFO L226 Difference]: Without dead ends: 100356 [2019-12-07 11:40:51,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:40:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100356 states. [2019-12-07 11:40:52,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100356 to 62116. [2019-12-07 11:40:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62116 states. [2019-12-07 11:40:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62116 states to 62116 states and 194655 transitions. [2019-12-07 11:40:52,501 INFO L78 Accepts]: Start accepts. Automaton has 62116 states and 194655 transitions. Word has length 28 [2019-12-07 11:40:52,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:52,501 INFO L462 AbstractCegarLoop]: Abstraction has 62116 states and 194655 transitions. [2019-12-07 11:40:52,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:40:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 62116 states and 194655 transitions. [2019-12-07 11:40:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 11:40:52,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:52,521 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 11:40:52,521 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 11:40:52,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:52,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1921906081, now seen corresponding path program 1 times [2019-12-07 11:40:52,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:52,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927984460] [2019-12-07 11:40:52,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:52,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:40:52,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927984460] [2019-12-07 11:40:52,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:52,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:40:52,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988172703] [2019-12-07 11:40:52,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:40:52,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:52,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:40:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:40:52,579 INFO L87 Difference]: Start difference. First operand 62116 states and 194655 transitions. Second operand 4 states. [2019-12-07 11:40:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:52,879 INFO L93 Difference]: Finished difference Result 113233 states and 354289 transitions. [2019-12-07 11:40:52,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:40:52,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 11:40:52,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:53,020 INFO L225 Difference]: With dead ends: 113233 [2019-12-07 11:40:53,020 INFO L226 Difference]: Without dead ends: 100083 [2019-12-07 11:40:53,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:40:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100083 states. [2019-12-07 11:40:54,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100083 to 98681. [2019-12-07 11:40:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98681 states. [2019-12-07 11:40:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98681 states to 98681 states and 308419 transitions. [2019-12-07 11:40:54,584 INFO L78 Accepts]: Start accepts. Automaton has 98681 states and 308419 transitions. Word has length 29 [2019-12-07 11:40:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:54,584 INFO L462 AbstractCegarLoop]: Abstraction has 98681 states and 308419 transitions. [2019-12-07 11:40:54,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:40:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 98681 states and 308419 transitions. [2019-12-07 11:40:54,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:40:54,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:54,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:54,621 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 11:40:54,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:54,621 INFO L82 PathProgramCache]: Analyzing trace with hash -58977604, now seen corresponding path program 1 times [2019-12-07 11:40:54,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:54,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452167524] [2019-12-07 11:40:54,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:54,653 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 11:40:54,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452167524] [2019-12-07 11:40:54,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:54,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:40:54,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43242778] [2019-12-07 11:40:54,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:40:54,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:54,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:40:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:54,654 INFO L87 Difference]: Start difference. First operand 98681 states and 308419 transitions. Second operand 3 states. [2019-12-07 11:40:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:55,013 INFO L93 Difference]: Finished difference Result 135039 states and 423182 transitions. [2019-12-07 11:40:55,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:40:55,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 11:40:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:55,090 INFO L225 Difference]: With dead ends: 135039 [2019-12-07 11:40:55,090 INFO L226 Difference]: Without dead ends: 52344 [2019-12-07 11:40:55,090 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52344 states. [2019-12-07 11:40:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52344 to 49222. [2019-12-07 11:40:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49222 states. [2019-12-07 11:40:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49222 states to 49222 states and 152327 transitions. [2019-12-07 11:40:55,888 INFO L78 Accepts]: Start accepts. Automaton has 49222 states and 152327 transitions. Word has length 30 [2019-12-07 11:40:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:55,889 INFO L462 AbstractCegarLoop]: Abstraction has 49222 states and 152327 transitions. [2019-12-07 11:40:55,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:40:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 49222 states and 152327 transitions. [2019-12-07 11:40:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 11:40:55,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:55,908 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:55,908 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 11:40:55,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1385438307, now seen corresponding path program 1 times [2019-12-07 11:40:55,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:55,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518366109] [2019-12-07 11:40:55,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:55,942 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 11:40:55,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518366109] [2019-12-07 11:40:55,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:55,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:40:55,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167383612] [2019-12-07 11:40:55,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:40:55,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:55,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:40:55,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:40:55,944 INFO L87 Difference]: Start difference. First operand 49222 states and 152327 transitions. Second operand 3 states. [2019-12-07 11:40:56,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:56,106 INFO L93 Difference]: Finished difference Result 49222 states and 150747 transitions. [2019-12-07 11:40:56,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:40:56,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 11:40:56,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:56,249 INFO L225 Difference]: With dead ends: 49222 [2019-12-07 11:40:56,249 INFO L226 Difference]: Without dead ends: 49222 [2019-12-07 11:40:56,250 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 11:40:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49222 states. [2019-12-07 11:40:56,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49222 to 44094. [2019-12-07 11:40:56,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44094 states. [2019-12-07 11:40:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44094 states to 44094 states and 135429 transitions. [2019-12-07 11:40:56,886 INFO L78 Accepts]: Start accepts. Automaton has 44094 states and 135429 transitions. Word has length 30 [2019-12-07 11:40:56,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:56,886 INFO L462 AbstractCegarLoop]: Abstraction has 44094 states and 135429 transitions. [2019-12-07 11:40:56,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:40:56,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44094 states and 135429 transitions. [2019-12-07 11:40:56,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 11:40:56,906 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:56,907 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] [2019-12-07 11:40:56,907 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 11:40:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:56,907 INFO L82 PathProgramCache]: Analyzing trace with hash 313779856, now seen corresponding path program 1 times [2019-12-07 11:40:56,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:56,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503635659] [2019-12-07 11:40:56,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:56,939 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 11:40:56,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503635659] [2019-12-07 11:40:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:40:56,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633498726] [2019-12-07 11:40:56,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:40:56,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:56,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:40:56,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:40:56,941 INFO L87 Difference]: Start difference. First operand 44094 states and 135429 transitions. Second operand 4 states. [2019-12-07 11:40:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:56,991 INFO L93 Difference]: Finished difference Result 17489 states and 51428 transitions. [2019-12-07 11:40:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:40:56,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-07 11:40:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:57,009 INFO L225 Difference]: With dead ends: 17489 [2019-12-07 11:40:57,009 INFO L226 Difference]: Without dead ends: 17489 [2019-12-07 11:40:57,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:40:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17489 states. [2019-12-07 11:40:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17489 to 17002. [2019-12-07 11:40:57,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17002 states. [2019-12-07 11:40:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17002 states to 17002 states and 50351 transitions. [2019-12-07 11:40:57,229 INFO L78 Accepts]: Start accepts. Automaton has 17002 states and 50351 transitions. Word has length 31 [2019-12-07 11:40:57,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:57,229 INFO L462 AbstractCegarLoop]: Abstraction has 17002 states and 50351 transitions. [2019-12-07 11:40:57,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:40:57,229 INFO L276 IsEmpty]: Start isEmpty. Operand 17002 states and 50351 transitions. [2019-12-07 11:40:57,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:40:57,240 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:57,240 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 11:40:57,240 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 11:40:57,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:57,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-07 11:40:57,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:57,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063912739] [2019-12-07 11:40:57,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:57,297 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 11:40:57,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063912739] [2019-12-07 11:40:57,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:57,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:40:57,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603731706] [2019-12-07 11:40:57,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:40:57,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:57,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:40:57,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:40:57,298 INFO L87 Difference]: Start difference. First operand 17002 states and 50351 transitions. Second operand 7 states. [2019-12-07 11:40:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:57,949 INFO L93 Difference]: Finished difference Result 31978 states and 93472 transitions. [2019-12-07 11:40:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:40:57,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 11:40:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:57,983 INFO L225 Difference]: With dead ends: 31978 [2019-12-07 11:40:57,983 INFO L226 Difference]: Without dead ends: 31978 [2019-12-07 11:40:57,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:40:58,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31978 states. [2019-12-07 11:40:58,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31978 to 17189. [2019-12-07 11:40:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17189 states. [2019-12-07 11:40:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17189 states to 17189 states and 50926 transitions. [2019-12-07 11:40:58,306 INFO L78 Accepts]: Start accepts. Automaton has 17189 states and 50926 transitions. Word has length 33 [2019-12-07 11:40:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:58,306 INFO L462 AbstractCegarLoop]: Abstraction has 17189 states and 50926 transitions. [2019-12-07 11:40:58,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:40:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 17189 states and 50926 transitions. [2019-12-07 11:40:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:40:58,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:58,318 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:58,318 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 11:40:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:58,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-07 11:40:58,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:58,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267903047] [2019-12-07 11:40:58,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:58,376 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 11:40:58,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267903047] [2019-12-07 11:40:58,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:58,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:40:58,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757666735] [2019-12-07 11:40:58,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:40:58,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:58,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:40:58,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:40:58,377 INFO L87 Difference]: Start difference. First operand 17189 states and 50926 transitions. Second operand 8 states. [2019-12-07 11:40:59,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:40:59,232 INFO L93 Difference]: Finished difference Result 38448 states and 110808 transitions. [2019-12-07 11:40:59,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:40:59,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-07 11:40:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:40:59,272 INFO L225 Difference]: With dead ends: 38448 [2019-12-07 11:40:59,273 INFO L226 Difference]: Without dead ends: 38448 [2019-12-07 11:40:59,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:40:59,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38448 states. [2019-12-07 11:40:59,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38448 to 17118. [2019-12-07 11:40:59,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17118 states. [2019-12-07 11:40:59,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17118 states to 17118 states and 50715 transitions. [2019-12-07 11:40:59,638 INFO L78 Accepts]: Start accepts. Automaton has 17118 states and 50715 transitions. Word has length 33 [2019-12-07 11:40:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:40:59,639 INFO L462 AbstractCegarLoop]: Abstraction has 17118 states and 50715 transitions. [2019-12-07 11:40:59,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:40:59,639 INFO L276 IsEmpty]: Start isEmpty. Operand 17118 states and 50715 transitions. [2019-12-07 11:40:59,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:40:59,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:40:59,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:40:59,651 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 11:40:59,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:40:59,651 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-07 11:40:59,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:40:59,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449907222] [2019-12-07 11:40:59,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:40:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:40:59,711 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 11:40:59,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449907222] [2019-12-07 11:40:59,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:40:59,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:40:59,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350006750] [2019-12-07 11:40:59,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:40:59,712 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:40:59,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:40:59,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:40:59,712 INFO L87 Difference]: Start difference. First operand 17118 states and 50715 transitions. Second operand 7 states. [2019-12-07 11:41:00,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:00,414 INFO L93 Difference]: Finished difference Result 29248 states and 85103 transitions. [2019-12-07 11:41:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 11:41:00,414 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 11:41:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:00,444 INFO L225 Difference]: With dead ends: 29248 [2019-12-07 11:41:00,444 INFO L226 Difference]: Without dead ends: 29248 [2019-12-07 11:41:00,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:41:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29248 states. [2019-12-07 11:41:00,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29248 to 16954. [2019-12-07 11:41:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16954 states. [2019-12-07 11:41:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16954 states to 16954 states and 50219 transitions. [2019-12-07 11:41:00,754 INFO L78 Accepts]: Start accepts. Automaton has 16954 states and 50219 transitions. Word has length 34 [2019-12-07 11:41:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:00,754 INFO L462 AbstractCegarLoop]: Abstraction has 16954 states and 50219 transitions. [2019-12-07 11:41:00,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:41:00,754 INFO L276 IsEmpty]: Start isEmpty. Operand 16954 states and 50219 transitions. [2019-12-07 11:41:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:41:00,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:00,766 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:00,766 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 11:41:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-07 11:41:00,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:00,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268589478] [2019-12-07 11:41:00,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:00,834 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 11:41:00,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268589478] [2019-12-07 11:41:00,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:00,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 11:41:00,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325624392] [2019-12-07 11:41:00,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:41:00,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:00,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:41:00,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:41:00,835 INFO L87 Difference]: Start difference. First operand 16954 states and 50219 transitions. Second operand 7 states. [2019-12-07 11:41:01,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:01,671 INFO L93 Difference]: Finished difference Result 35633 states and 101868 transitions. [2019-12-07 11:41:01,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:41:01,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-07 11:41:01,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:01,709 INFO L225 Difference]: With dead ends: 35633 [2019-12-07 11:41:01,709 INFO L226 Difference]: Without dead ends: 35633 [2019-12-07 11:41:01,709 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:41:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35633 states. [2019-12-07 11:41:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35633 to 16884. [2019-12-07 11:41:02,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16884 states. [2019-12-07 11:41:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16884 states to 16884 states and 50005 transitions. [2019-12-07 11:41:02,112 INFO L78 Accepts]: Start accepts. Automaton has 16884 states and 50005 transitions. Word has length 34 [2019-12-07 11:41:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:02,112 INFO L462 AbstractCegarLoop]: Abstraction has 16884 states and 50005 transitions. [2019-12-07 11:41:02,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:41:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 16884 states and 50005 transitions. [2019-12-07 11:41:02,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 11:41:02,122 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:02,123 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:02,123 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 11:41:02,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:02,123 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-07 11:41:02,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:02,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439917664] [2019-12-07 11:41:02,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:02,180 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 11:41:02,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439917664] [2019-12-07 11:41:02,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:02,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 11:41:02,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671818033] [2019-12-07 11:41:02,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:41:02,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:02,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:41:02,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:41:02,182 INFO L87 Difference]: Start difference. First operand 16884 states and 50005 transitions. Second operand 8 states. [2019-12-07 11:41:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:03,008 INFO L93 Difference]: Finished difference Result 33176 states and 95245 transitions. [2019-12-07 11:41:03,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 11:41:03,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-12-07 11:41:03,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:03,042 INFO L225 Difference]: With dead ends: 33176 [2019-12-07 11:41:03,042 INFO L226 Difference]: Without dead ends: 33176 [2019-12-07 11:41:03,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:41:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33176 states. [2019-12-07 11:41:03,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33176 to 16642. [2019-12-07 11:41:03,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16642 states. [2019-12-07 11:41:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16642 states to 16642 states and 49315 transitions. [2019-12-07 11:41:03,371 INFO L78 Accepts]: Start accepts. Automaton has 16642 states and 49315 transitions. Word has length 34 [2019-12-07 11:41:03,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:03,371 INFO L462 AbstractCegarLoop]: Abstraction has 16642 states and 49315 transitions. [2019-12-07 11:41:03,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:41:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16642 states and 49315 transitions. [2019-12-07 11:41:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 11:41:03,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:03,384 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 11:41:03,384 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 11:41:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1677421997, now seen corresponding path program 1 times [2019-12-07 11:41:03,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:03,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998658968] [2019-12-07 11:41:03,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:03,412 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 11:41:03,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998658968] [2019-12-07 11:41:03,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:03,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:03,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737258161] [2019-12-07 11:41:03,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:03,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:03,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:03,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:03,414 INFO L87 Difference]: Start difference. First operand 16642 states and 49315 transitions. Second operand 3 states. [2019-12-07 11:41:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:03,460 INFO L93 Difference]: Finished difference Result 16642 states and 48523 transitions. [2019-12-07 11:41:03,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:03,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 11:41:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:03,477 INFO L225 Difference]: With dead ends: 16642 [2019-12-07 11:41:03,478 INFO L226 Difference]: Without dead ends: 16642 [2019-12-07 11:41:03,478 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 11:41:03,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2019-12-07 11:41:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 16160. [2019-12-07 11:41:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16160 states. [2019-12-07 11:41:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16160 states to 16160 states and 47170 transitions. [2019-12-07 11:41:03,698 INFO L78 Accepts]: Start accepts. Automaton has 16160 states and 47170 transitions. Word has length 41 [2019-12-07 11:41:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:03,698 INFO L462 AbstractCegarLoop]: Abstraction has 16160 states and 47170 transitions. [2019-12-07 11:41:03,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:03,698 INFO L276 IsEmpty]: Start isEmpty. Operand 16160 states and 47170 transitions. [2019-12-07 11:41:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 11:41:03,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:03,711 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:41:03,711 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 11:41:03,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1399805170, now seen corresponding path program 1 times [2019-12-07 11:41:03,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:03,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262336402] [2019-12-07 11:41:03,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:41:03,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262336402] [2019-12-07 11:41:03,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:03,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:41:03,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818129371] [2019-12-07 11:41:03,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 11:41:03,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:03,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 11:41:03,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:03,744 INFO L87 Difference]: Start difference. First operand 16160 states and 47170 transitions. Second operand 5 states. [2019-12-07 11:41:03,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:03,790 INFO L93 Difference]: Finished difference Result 15008 states and 44703 transitions. [2019-12-07 11:41:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:41:03,791 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-07 11:41:03,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:03,805 INFO L225 Difference]: With dead ends: 15008 [2019-12-07 11:41:03,805 INFO L226 Difference]: Without dead ends: 13452 [2019-12-07 11:41:03,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:41:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13452 states. [2019-12-07 11:41:03,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13452 to 13452. [2019-12-07 11:41:03,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13452 states. [2019-12-07 11:41:03,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13452 states to 13452 states and 40960 transitions. [2019-12-07 11:41:03,988 INFO L78 Accepts]: Start accepts. Automaton has 13452 states and 40960 transitions. Word has length 42 [2019-12-07 11:41:03,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:03,988 INFO L462 AbstractCegarLoop]: Abstraction has 13452 states and 40960 transitions. [2019-12-07 11:41:03,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 11:41:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 13452 states and 40960 transitions. [2019-12-07 11:41:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 11:41:03,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:03,999 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 11:41:03,999 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 11:41:03,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:04,000 INFO L82 PathProgramCache]: Analyzing trace with hash 622120387, now seen corresponding path program 1 times [2019-12-07 11:41:04,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:04,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550058510] [2019-12-07 11:41:04,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:04,034 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 11:41:04,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550058510] [2019-12-07 11:41:04,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:04,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 11:41:04,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277035724] [2019-12-07 11:41:04,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:04,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:04,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:04,035 INFO L87 Difference]: Start difference. First operand 13452 states and 40960 transitions. Second operand 3 states. [2019-12-07 11:41:04,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:04,104 INFO L93 Difference]: Finished difference Result 15913 states and 48476 transitions. [2019-12-07 11:41:04,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:04,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 11:41:04,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:04,121 INFO L225 Difference]: With dead ends: 15913 [2019-12-07 11:41:04,121 INFO L226 Difference]: Without dead ends: 15913 [2019-12-07 11:41:04,121 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 11:41:04,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15913 states. [2019-12-07 11:41:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15913 to 12758. [2019-12-07 11:41:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-12-07 11:41:04,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 39103 transitions. [2019-12-07 11:41:04,316 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 39103 transitions. Word has length 66 [2019-12-07 11:41:04,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:04,316 INFO L462 AbstractCegarLoop]: Abstraction has 12758 states and 39103 transitions. [2019-12-07 11:41:04,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:04,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 39103 transitions. [2019-12-07 11:41:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:41:04,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:04,327 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 11:41:04,327 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 11:41:04,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:04,327 INFO L82 PathProgramCache]: Analyzing trace with hash -586454608, now seen corresponding path program 1 times [2019-12-07 11:41:04,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:04,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994747608] [2019-12-07 11:41:04,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:04,353 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 11:41:04,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994747608] [2019-12-07 11:41:04,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:04,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:04,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167858941] [2019-12-07 11:41:04,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:41:04,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:04,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:41:04,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:41:04,354 INFO L87 Difference]: Start difference. First operand 12758 states and 39103 transitions. Second operand 3 states. [2019-12-07 11:41:04,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:04,468 INFO L93 Difference]: Finished difference Result 18426 states and 56737 transitions. [2019-12-07 11:41:04,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:41:04,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-07 11:41:04,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:04,489 INFO L225 Difference]: With dead ends: 18426 [2019-12-07 11:41:04,489 INFO L226 Difference]: Without dead ends: 18426 [2019-12-07 11:41:04,489 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 11:41:04,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18426 states. [2019-12-07 11:41:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18426 to 12976. [2019-12-07 11:41:04,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12976 states. [2019-12-07 11:41:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12976 states to 12976 states and 39850 transitions. [2019-12-07 11:41:04,700 INFO L78 Accepts]: Start accepts. Automaton has 12976 states and 39850 transitions. Word has length 67 [2019-12-07 11:41:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:04,700 INFO L462 AbstractCegarLoop]: Abstraction has 12976 states and 39850 transitions. [2019-12-07 11:41:04,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:41:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 12976 states and 39850 transitions. [2019-12-07 11:41:04,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:41:04,711 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:04,711 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 11:41:04,711 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:04,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:04,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1786041058, now seen corresponding path program 1 times [2019-12-07 11:41:04,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:04,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774217586] [2019-12-07 11:41:04,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:04,783 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 11:41:04,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774217586] [2019-12-07 11:41:04,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:04,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 11:41:04,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215872700] [2019-12-07 11:41:04,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 11:41:04,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:04,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 11:41:04,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 11:41:04,784 INFO L87 Difference]: Start difference. First operand 12976 states and 39850 transitions. Second operand 7 states. [2019-12-07 11:41:05,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:05,737 INFO L93 Difference]: Finished difference Result 25016 states and 74646 transitions. [2019-12-07 11:41:05,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 11:41:05,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-07 11:41:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:05,771 INFO L225 Difference]: With dead ends: 25016 [2019-12-07 11:41:05,771 INFO L226 Difference]: Without dead ends: 25016 [2019-12-07 11:41:05,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-07 11:41:05,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25016 states. [2019-12-07 11:41:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25016 to 13242. [2019-12-07 11:41:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13242 states. [2019-12-07 11:41:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13242 states to 13242 states and 40631 transitions. [2019-12-07 11:41:06,028 INFO L78 Accepts]: Start accepts. Automaton has 13242 states and 40631 transitions. Word has length 67 [2019-12-07 11:41:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:06,029 INFO L462 AbstractCegarLoop]: Abstraction has 13242 states and 40631 transitions. [2019-12-07 11:41:06,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 11:41:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 13242 states and 40631 transitions. [2019-12-07 11:41:06,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:41:06,040 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:06,041 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 11:41:06,041 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:06,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:06,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1398756383, now seen corresponding path program 1 times [2019-12-07 11:41:06,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:06,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138401765] [2019-12-07 11:41:06,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:41:06,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138401765] [2019-12-07 11:41:06,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:06,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:41:06,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823212583] [2019-12-07 11:41:06,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:41:06,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:06,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:41:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:41:06,118 INFO L87 Difference]: Start difference. First operand 13242 states and 40631 transitions. Second operand 9 states. [2019-12-07 11:41:06,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:06,810 INFO L93 Difference]: Finished difference Result 70905 states and 212477 transitions. [2019-12-07 11:41:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 11:41:06,811 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-07 11:41:06,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:06,888 INFO L225 Difference]: With dead ends: 70905 [2019-12-07 11:41:06,888 INFO L226 Difference]: Without dead ends: 66675 [2019-12-07 11:41:06,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:41:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66675 states. [2019-12-07 11:41:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66675 to 14339. [2019-12-07 11:41:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14339 states. [2019-12-07 11:41:07,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14339 states to 14339 states and 44194 transitions. [2019-12-07 11:41:07,421 INFO L78 Accepts]: Start accepts. Automaton has 14339 states and 44194 transitions. Word has length 67 [2019-12-07 11:41:07,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:07,421 INFO L462 AbstractCegarLoop]: Abstraction has 14339 states and 44194 transitions. [2019-12-07 11:41:07,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:41:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 14339 states and 44194 transitions. [2019-12-07 11:41:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:41:07,434 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:07,435 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 11:41:07,435 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:07,435 INFO L82 PathProgramCache]: Analyzing trace with hash -95777668, now seen corresponding path program 2 times [2019-12-07 11:41:07,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:07,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215427453] [2019-12-07 11:41:07,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:07,472 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 11:41:07,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215427453] [2019-12-07 11:41:07,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:07,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:41:07,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942064930] [2019-12-07 11:41:07,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:41:07,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:07,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:41:07,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:41:07,473 INFO L87 Difference]: Start difference. First operand 14339 states and 44194 transitions. Second operand 4 states. [2019-12-07 11:41:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:07,541 INFO L93 Difference]: Finished difference Result 14195 states and 43585 transitions. [2019-12-07 11:41:07,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:41:07,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 11:41:07,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:07,557 INFO L225 Difference]: With dead ends: 14195 [2019-12-07 11:41:07,557 INFO L226 Difference]: Without dead ends: 14195 [2019-12-07 11:41:07,557 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 11:41:07,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14195 states. [2019-12-07 11:41:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14195 to 12698. [2019-12-07 11:41:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12698 states. [2019-12-07 11:41:07,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12698 states to 12698 states and 38843 transitions. [2019-12-07 11:41:07,742 INFO L78 Accepts]: Start accepts. Automaton has 12698 states and 38843 transitions. Word has length 67 [2019-12-07 11:41:07,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:07,742 INFO L462 AbstractCegarLoop]: Abstraction has 12698 states and 38843 transitions. [2019-12-07 11:41:07,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:41:07,742 INFO L276 IsEmpty]: Start isEmpty. Operand 12698 states and 38843 transitions. [2019-12-07 11:41:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:41:07,753 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:07,753 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 11:41:07,753 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:07,753 INFO L82 PathProgramCache]: Analyzing trace with hash 579351643, now seen corresponding path program 2 times [2019-12-07 11:41:07,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:07,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601941119] [2019-12-07 11:41:07,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:41:07,821 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 11:41:07,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601941119] [2019-12-07 11:41:07,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:41:07,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:41:07,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745490400] [2019-12-07 11:41:07,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:41:07,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:41:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:41:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:41:07,822 INFO L87 Difference]: Start difference. First operand 12698 states and 38843 transitions. Second operand 9 states. [2019-12-07 11:41:08,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:41:08,749 INFO L93 Difference]: Finished difference Result 70186 states and 206980 transitions. [2019-12-07 11:41:08,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-07 11:41:08,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-07 11:41:08,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:41:08,792 INFO L225 Difference]: With dead ends: 70186 [2019-12-07 11:41:08,792 INFO L226 Difference]: Without dead ends: 48969 [2019-12-07 11:41:08,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=291, Invalid=969, Unknown=0, NotChecked=0, Total=1260 [2019-12-07 11:41:08,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48969 states. [2019-12-07 11:41:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48969 to 14149. [2019-12-07 11:41:09,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14149 states. [2019-12-07 11:41:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14149 states to 14149 states and 43203 transitions. [2019-12-07 11:41:09,176 INFO L78 Accepts]: Start accepts. Automaton has 14149 states and 43203 transitions. Word has length 67 [2019-12-07 11:41:09,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:41:09,177 INFO L462 AbstractCegarLoop]: Abstraction has 14149 states and 43203 transitions. [2019-12-07 11:41:09,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:41:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 14149 states and 43203 transitions. [2019-12-07 11:41:09,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 11:41:09,188 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:41:09,189 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 11:41:09,189 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:41:09,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:41:09,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 3 times [2019-12-07 11:41:09,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:41:09,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923351066] [2019-12-07 11:41:09,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:41:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:41:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:41:09,270 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:41:09,271 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:41:09,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1013~0.base_51|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_51| 4) |v_#length_25|) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51|) |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= 0 v_~x~0_130) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51|) 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_39|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_163, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_32|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_20|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_19|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t1013~0.base] because there is no mapped edge [2019-12-07 11:41:09,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1618306399 0)) (= ~a$r_buff1_thd3~0_Out-1618306399 ~a$r_buff0_thd3~0_In-1618306399) (= ~a$r_buff0_thd0~0_In-1618306399 ~a$r_buff1_thd0~0_Out-1618306399) (= ~x~0_Out-1618306399 1) (= ~a$r_buff1_thd2~0_Out-1618306399 ~a$r_buff0_thd2~0_In-1618306399) (= ~a$r_buff0_thd1~0_In-1618306399 ~a$r_buff1_thd1~0_Out-1618306399) (= ~a$r_buff0_thd1~0_Out-1618306399 1)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1618306399, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1618306399, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1618306399, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1618306399, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1618306399} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1618306399, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1618306399, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1618306399, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1618306399, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1618306399, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1618306399, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1618306399, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1618306399, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1618306399, ~x~0=~x~0_Out-1618306399} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 11:41:09,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-07 11:41:09,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-07 11:41:09,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1660834533 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1660834533 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out1660834533| |P1Thread1of1ForFork2_#t~ite9_Out1660834533|))) (or (and (or .cse0 .cse1) (= ~a~0_In1660834533 |P1Thread1of1ForFork2_#t~ite9_Out1660834533|) .cse2) (and (= ~a$w_buff1~0_In1660834533 |P1Thread1of1ForFork2_#t~ite9_Out1660834533|) (not .cse1) (not .cse0) .cse2))) InVars {~a~0=~a~0_In1660834533, ~a$w_buff1~0=~a$w_buff1~0_In1660834533, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1660834533, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1660834533} OutVars{~a~0=~a~0_In1660834533, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1660834533|, ~a$w_buff1~0=~a$w_buff1~0_In1660834533, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1660834533, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1660834533|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1660834533} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 11:41:09,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-296232016 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-296232016 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-296232016| ~a$w_buff0_used~0_In-296232016)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-296232016|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-296232016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-296232016} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-296232016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-296232016, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-296232016|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:41:09,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In112012508 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In112012508 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In112012508 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In112012508 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out112012508| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out112012508| ~a$w_buff1_used~0_In112012508) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In112012508, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In112012508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In112012508, ~a$w_buff1_used~0=~a$w_buff1_used~0_In112012508} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In112012508, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In112012508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In112012508, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out112012508|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In112012508} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 11:41:09,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2068824701 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In2068824701| |P2Thread1of1ForFork0_#t~ite20_Out2068824701|) (= |P2Thread1of1ForFork0_#t~ite21_Out2068824701| ~a$w_buff0~0_In2068824701)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out2068824701| ~a$w_buff0~0_In2068824701) (= |P2Thread1of1ForFork0_#t~ite20_Out2068824701| |P2Thread1of1ForFork0_#t~ite21_Out2068824701|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In2068824701 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In2068824701 256))) (= (mod ~a$w_buff0_used~0_In2068824701 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In2068824701 256) 0))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In2068824701, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2068824701, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2068824701, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2068824701, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2068824701, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In2068824701|, ~weak$$choice2~0=~weak$$choice2~0_In2068824701} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out2068824701|, ~a$w_buff0~0=~a$w_buff0~0_In2068824701, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2068824701, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2068824701, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2068824701, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out2068824701|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2068824701, ~weak$$choice2~0=~weak$$choice2~0_In2068824701} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 11:41:09,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1606725814 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1606725814 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1606725814| ~a$r_buff0_thd2~0_In1606725814)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1606725814| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1606725814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1606725814} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1606725814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1606725814, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1606725814|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 11:41:09,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1685913780 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1685913780 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1685913780 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1685913780 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-1685913780 |P1Thread1of1ForFork2_#t~ite14_Out-1685913780|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1685913780|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1685913780, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1685913780, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1685913780, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1685913780} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1685913780, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1685913780, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1685913780, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1685913780, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1685913780|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 11:41:09,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_48| v_~a$r_buff1_thd2~0_119) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_48|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_47|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 11:41:09,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1224864799 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1224864799| |P2Thread1of1ForFork0_#t~ite23_Out-1224864799|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1224864799 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1224864799 256)) (and (= (mod ~a$w_buff1_used~0_In-1224864799 256) 0) .cse0) (and (= (mod ~a$r_buff1_thd3~0_In-1224864799 256) 0) .cse0))) .cse1 (= ~a$w_buff1~0_In-1224864799 |P2Thread1of1ForFork0_#t~ite23_Out-1224864799|)) (and (= ~a$w_buff1~0_In-1224864799 |P2Thread1of1ForFork0_#t~ite24_Out-1224864799|) (= |P2Thread1of1ForFork0_#t~ite23_In-1224864799| |P2Thread1of1ForFork0_#t~ite23_Out-1224864799|) (not .cse1)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1224864799, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1224864799|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1224864799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1224864799, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1224864799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1224864799, ~weak$$choice2~0=~weak$$choice2~0_In-1224864799} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1224864799, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1224864799|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1224864799|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1224864799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1224864799, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1224864799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1224864799, ~weak$$choice2~0=~weak$$choice2~0_In-1224864799} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 11:41:09,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1085039469 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1085039469 256)))) (or (and (= (mod ~a$w_buff1_used~0_In1085039469 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In1085039469 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In1085039469 256)) .cse0))) (= |P2Thread1of1ForFork0_#t~ite26_Out1085039469| |P2Thread1of1ForFork0_#t~ite27_Out1085039469|) (= |P2Thread1of1ForFork0_#t~ite26_Out1085039469| ~a$w_buff0_used~0_In1085039469) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite26_In1085039469| |P2Thread1of1ForFork0_#t~ite26_Out1085039469|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out1085039469| ~a$w_buff0_used~0_In1085039469)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1085039469|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1085039469, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1085039469, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1085039469, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1085039469, ~weak$$choice2~0=~weak$$choice2~0_In1085039469} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1085039469|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1085039469|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1085039469, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1085039469, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1085039469, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1085039469, ~weak$$choice2~0=~weak$$choice2~0_In1085039469} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 11:41:09,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:41:09,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 11:41:09,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-2147316253 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2147316253 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-2147316253| ~a~0_In-2147316253)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-2147316253| ~a$w_buff1~0_In-2147316253)))) InVars {~a~0=~a~0_In-2147316253, ~a$w_buff1~0=~a$w_buff1~0_In-2147316253, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2147316253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2147316253} OutVars{~a~0=~a~0_In-2147316253, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-2147316253|, ~a$w_buff1~0=~a$w_buff1~0_In-2147316253, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2147316253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2147316253} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 11:41:09,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_5|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 11:41:09,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1758224013 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1758224013 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1758224013| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1758224013| ~a$w_buff0_used~0_In-1758224013) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1758224013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1758224013} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1758224013|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1758224013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1758224013} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 11:41:09,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1645358788 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1645358788 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1645358788|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1645358788 |P0Thread1of1ForFork1_#t~ite5_Out1645358788|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1645358788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1645358788} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1645358788|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1645358788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1645358788} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 11:41:09,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1914786999 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1914786999 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1914786999 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1914786999 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1914786999|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In1914786999 |P0Thread1of1ForFork1_#t~ite6_Out1914786999|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1914786999, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914786999, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1914786999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914786999} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1914786999|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1914786999, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914786999, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1914786999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914786999} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 11:41:09,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2094033631 256))) (.cse2 (= ~a$r_buff0_thd1~0_Out2094033631 ~a$r_buff0_thd1~0_In2094033631)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In2094033631 256)))) (or (and (= ~a$r_buff0_thd1~0_Out2094033631 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2094033631, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2094033631} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2094033631|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2094033631, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2094033631} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:41:09,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1485707760 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1485707760 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1485707760 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1485707760 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1485707760| ~a$r_buff1_thd1~0_In-1485707760) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1485707760|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1485707760, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1485707760, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1485707760, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1485707760} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1485707760|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1485707760, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1485707760, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1485707760, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1485707760} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:41:09,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_25|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:41:09,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1550855277 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1550855277 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1550855277 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1550855277 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1550855277| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1550855277| ~a$w_buff1_used~0_In1550855277) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1550855277, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1550855277, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1550855277, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1550855277} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1550855277, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1550855277, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1550855277, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1550855277, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1550855277|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 11:41:09,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-212030983 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-212030983 256)))) (or (and (= ~a$r_buff0_thd3~0_In-212030983 |P2Thread1of1ForFork0_#t~ite42_Out-212030983|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-212030983|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-212030983, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-212030983} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-212030983, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-212030983, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-212030983|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:41:09,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1354403389 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1354403389 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1354403389 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1354403389 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In1354403389 |P2Thread1of1ForFork0_#t~ite43_Out1354403389|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1354403389|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1354403389, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1354403389, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1354403389, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1354403389} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1354403389|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1354403389, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1354403389, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1354403389, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1354403389} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 11:41:09,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_28|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:41:09,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_24) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:41:09,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-958573657| |ULTIMATE.start_main_#t~ite47_Out-958573657|)) (.cse1 (= (mod ~a$w_buff1_used~0_In-958573657 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-958573657 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In-958573657 |ULTIMATE.start_main_#t~ite47_Out-958573657|)) (and (= ~a~0_In-958573657 |ULTIMATE.start_main_#t~ite47_Out-958573657|) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In-958573657, ~a$w_buff1~0=~a$w_buff1~0_In-958573657, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-958573657, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-958573657} OutVars{~a~0=~a~0_In-958573657, ~a$w_buff1~0=~a$w_buff1~0_In-958573657, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-958573657|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-958573657, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-958573657|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-958573657} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 11:41:09,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-64007978 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-64007978 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-64007978| ~a$w_buff0_used~0_In-64007978) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-64007978| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-64007978, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-64007978} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-64007978, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-64007978|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-64007978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 11:41:09,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In355679719 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In355679719 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In355679719 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In355679719 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In355679719 |ULTIMATE.start_main_#t~ite50_Out355679719|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out355679719|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In355679719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In355679719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In355679719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In355679719} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out355679719|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In355679719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In355679719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In355679719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In355679719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 11:41:09,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-510095934 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-510095934 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-510095934|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-510095934 |ULTIMATE.start_main_#t~ite51_Out-510095934|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-510095934, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-510095934} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-510095934|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-510095934, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-510095934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 11:41:09,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In331451192 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In331451192 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In331451192 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In331451192 256)))) (or (and (= ~a$r_buff1_thd0~0_In331451192 |ULTIMATE.start_main_#t~ite52_Out331451192|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out331451192|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In331451192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In331451192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In331451192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In331451192} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out331451192|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In331451192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In331451192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In331451192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In331451192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 11:41:09,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:41:09,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:41:09 BasicIcfg [2019-12-07 11:41:09,338 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:41:09,338 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:41:09,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:41:09,338 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:41:09,339 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:40:07" (3/4) ... [2019-12-07 11:41:09,340 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:41:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_89| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~y~0_33 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1013~0.base_51|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1013~0.base_51| 4) |v_#length_25|) (= v_~main$tmp_guard1~0_50 0) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$mem_tmp~0_19 0) (= v_~a$r_buff1_thd3~0_279 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$r_buff0_thd3~0_364 0) (= v_~z~0_14 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51| 1) |v_#valid_87|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice0~0_15) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p1_EAX~0_57) (= 0 v_~a$w_buff1_used~0_506) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1013~0.base_51|) |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0)) |v_#memory_int_21|) (= |v_ULTIMATE.start_main_~#t1013~0.offset_32| 0) (= v_~a$r_buff1_thd0~0_160 0) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= v_~a$flush_delayed~0_30 0) (= 0 v_~x~0_130) (= (select .cse0 |v_ULTIMATE.start_main_~#t1013~0.base_51|) 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~weak$$choice2~0_108 0) (= v_~a~0_163 0) (= v_~__unbuffered_p2_EBX~0_61 0) (= 0 v_~__unbuffered_p2_EAX~0_52) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_89|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_39|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_163, ULTIMATE.start_main_~#t1013~0.offset=|v_ULTIMATE.start_main_~#t1013~0.offset_32|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_57, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_52, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_61, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_20|, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_160, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_130, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_19|, ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_28|, ~a$mem_tmp~0=v_~a$mem_tmp~0_19, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_33, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_30, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, #valid=|v_#valid_87|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_14, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ~weak$$choice2~0=v_~weak$$choice2~0_108, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t1013~0.base=|v_ULTIMATE.start_main_~#t1013~0.base_51|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1014~0.base, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_~#t1013~0.offset, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ULTIMATE.start_main_~#t1015~0.offset, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_~#t1014~0.offset, ULTIMATE.start_main_~#t1015~0.base, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ~weak$$choice2~0, ~a$read_delayed_var~0.base, ULTIMATE.start_main_~#t1013~0.base] because there is no mapped edge [2019-12-07 11:41:09,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (not (= P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1618306399 0)) (= ~a$r_buff1_thd3~0_Out-1618306399 ~a$r_buff0_thd3~0_In-1618306399) (= ~a$r_buff0_thd0~0_In-1618306399 ~a$r_buff1_thd0~0_Out-1618306399) (= ~x~0_Out-1618306399 1) (= ~a$r_buff1_thd2~0_Out-1618306399 ~a$r_buff0_thd2~0_In-1618306399) (= ~a$r_buff0_thd1~0_In-1618306399 ~a$r_buff1_thd1~0_Out-1618306399) (= ~a$r_buff0_thd1~0_Out-1618306399 1)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1618306399, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1618306399, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1618306399, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1618306399, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1618306399} OutVars{~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out-1618306399, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out-1618306399, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out-1618306399, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out-1618306399, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1618306399, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1618306399, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In-1618306399, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-1618306399, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-1618306399, ~x~0=~x~0_Out-1618306399} AuxVars[] AssignedVars[~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-07 11:41:09,341 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1014~0.base_9|) |v_ULTIMATE.start_main_~#t1014~0.offset_7| 1)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1014~0.base_9| 4)) (= |v_ULTIMATE.start_main_~#t1014~0.offset_7| 0) (not (= |v_ULTIMATE.start_main_~#t1014~0.base_9| 0)) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1014~0.base_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, ULTIMATE.start_main_~#t1014~0.base=|v_ULTIMATE.start_main_~#t1014~0.base_9|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1014~0.offset=|v_ULTIMATE.start_main_~#t1014~0.offset_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, ULTIMATE.start_main_~#t1014~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1014~0.offset] because there is no mapped edge [2019-12-07 11:41:09,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1015~0.base_9| 4) |v_#length_13|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) |v_ULTIMATE.start_main_~#t1015~0.offset_8| 2))) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1015~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1015~0.base_9| 0)) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t1015~0.offset_8| 0) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1015~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1015~0.base=|v_ULTIMATE.start_main_~#t1015~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1015~0.offset=|v_ULTIMATE.start_main_~#t1015~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1015~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t1015~0.offset, #length] because there is no mapped edge [2019-12-07 11:41:09,342 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff1_used~0_In1660834533 256))) (.cse0 (= (mod ~a$r_buff1_thd2~0_In1660834533 256) 0)) (.cse2 (= |P1Thread1of1ForFork2_#t~ite10_Out1660834533| |P1Thread1of1ForFork2_#t~ite9_Out1660834533|))) (or (and (or .cse0 .cse1) (= ~a~0_In1660834533 |P1Thread1of1ForFork2_#t~ite9_Out1660834533|) .cse2) (and (= ~a$w_buff1~0_In1660834533 |P1Thread1of1ForFork2_#t~ite9_Out1660834533|) (not .cse1) (not .cse0) .cse2))) InVars {~a~0=~a~0_In1660834533, ~a$w_buff1~0=~a$w_buff1~0_In1660834533, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1660834533, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1660834533} OutVars{~a~0=~a~0_In1660834533, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1660834533|, ~a$w_buff1~0=~a$w_buff1~0_In1660834533, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In1660834533, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1660834533|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1660834533} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-07 11:41:09,343 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-296232016 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd2~0_In-296232016 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out-296232016| ~a$w_buff0_used~0_In-296232016)) (and (not .cse1) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-296232016|) (not .cse0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-296232016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-296232016} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-296232016, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-296232016, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-296232016|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 11:41:09,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd2~0_In112012508 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In112012508 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In112012508 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd2~0_In112012508 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite12_Out112012508| 0)) (and (= |P1Thread1of1ForFork2_#t~ite12_Out112012508| ~a$w_buff1_used~0_In112012508) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In112012508, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In112012508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In112012508, ~a$w_buff1_used~0=~a$w_buff1_used~0_In112012508} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In112012508, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In112012508, ~a$w_buff0_used~0=~a$w_buff0_used~0_In112012508, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out112012508|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In112012508} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 11:41:09,344 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2068824701 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite20_In2068824701| |P2Thread1of1ForFork0_#t~ite20_Out2068824701|) (= |P2Thread1of1ForFork0_#t~ite21_Out2068824701| ~a$w_buff0~0_In2068824701)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out2068824701| ~a$w_buff0~0_In2068824701) (= |P2Thread1of1ForFork0_#t~ite20_Out2068824701| |P2Thread1of1ForFork0_#t~ite21_Out2068824701|) (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In2068824701 256) 0))) (or (and .cse1 (= 0 (mod ~a$r_buff1_thd3~0_In2068824701 256))) (= (mod ~a$w_buff0_used~0_In2068824701 256) 0) (and .cse1 (= (mod ~a$w_buff1_used~0_In2068824701 256) 0))))))) InVars {~a$w_buff0~0=~a$w_buff0~0_In2068824701, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2068824701, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2068824701, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2068824701, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2068824701, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In2068824701|, ~weak$$choice2~0=~weak$$choice2~0_In2068824701} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out2068824701|, ~a$w_buff0~0=~a$w_buff0~0_In2068824701, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2068824701, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2068824701, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2068824701, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out2068824701|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2068824701, ~weak$$choice2~0=~weak$$choice2~0_In2068824701} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-07 11:41:09,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff0_used~0_In1606725814 256))) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1606725814 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite13_Out1606725814| ~a$r_buff0_thd2~0_In1606725814)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1606725814| 0) (not .cse0) (not .cse1)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1606725814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1606725814} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1606725814, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1606725814, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1606725814|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 11:41:09,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~a$w_buff1_used~0_In-1685913780 256))) (.cse1 (= (mod ~a$r_buff1_thd2~0_In-1685913780 256) 0)) (.cse3 (= (mod ~a$r_buff0_thd2~0_In-1685913780 256) 0)) (.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1685913780 256)))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd2~0_In-1685913780 |P1Thread1of1ForFork2_#t~ite14_Out-1685913780|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1685913780|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1685913780, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1685913780, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1685913780, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1685913780} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1685913780, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1685913780, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1685913780, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1685913780, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1685913780|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 11:41:09,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite14_48| v_~a$r_buff1_thd2~0_119) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_48|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_47|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 11:41:09,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1224864799 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite24_Out-1224864799| |P2Thread1of1ForFork0_#t~ite23_Out-1224864799|) (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1224864799 256)))) (or (= 0 (mod ~a$w_buff0_used~0_In-1224864799 256)) (and (= (mod ~a$w_buff1_used~0_In-1224864799 256) 0) .cse0) (and (= (mod ~a$r_buff1_thd3~0_In-1224864799 256) 0) .cse0))) .cse1 (= ~a$w_buff1~0_In-1224864799 |P2Thread1of1ForFork0_#t~ite23_Out-1224864799|)) (and (= ~a$w_buff1~0_In-1224864799 |P2Thread1of1ForFork0_#t~ite24_Out-1224864799|) (= |P2Thread1of1ForFork0_#t~ite23_In-1224864799| |P2Thread1of1ForFork0_#t~ite23_Out-1224864799|) (not .cse1)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-1224864799, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1224864799|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1224864799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1224864799, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1224864799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1224864799, ~weak$$choice2~0=~weak$$choice2~0_In-1224864799} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-1224864799, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1224864799|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1224864799|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1224864799, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1224864799, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1224864799, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1224864799, ~weak$$choice2~0=~weak$$choice2~0_In-1224864799} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-07 11:41:09,346 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1085039469 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1085039469 256)))) (or (and (= (mod ~a$w_buff1_used~0_In1085039469 256) 0) .cse0) (= (mod ~a$w_buff0_used~0_In1085039469 256) 0) (and (= 0 (mod ~a$r_buff1_thd3~0_In1085039469 256)) .cse0))) (= |P2Thread1of1ForFork0_#t~ite26_Out1085039469| |P2Thread1of1ForFork0_#t~ite27_Out1085039469|) (= |P2Thread1of1ForFork0_#t~ite26_Out1085039469| ~a$w_buff0_used~0_In1085039469) .cse1) (and (= |P2Thread1of1ForFork0_#t~ite26_In1085039469| |P2Thread1of1ForFork0_#t~ite26_Out1085039469|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite27_Out1085039469| ~a$w_buff0_used~0_In1085039469)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1085039469|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1085039469, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1085039469, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1085039469, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1085039469, ~weak$$choice2~0=~weak$$choice2~0_In1085039469} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1085039469|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1085039469|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1085039469, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1085039469, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1085039469, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1085039469, ~weak$$choice2~0=~weak$$choice2~0_In1085039469} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 11:41:09,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 11:41:09,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-07 11:41:09,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~a$r_buff1_thd3~0_In-2147316253 256) 0)) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-2147316253 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out-2147316253| ~a~0_In-2147316253)) (and (not .cse1) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out-2147316253| ~a$w_buff1~0_In-2147316253)))) InVars {~a~0=~a~0_In-2147316253, ~a$w_buff1~0=~a$w_buff1~0_In-2147316253, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2147316253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2147316253} OutVars{~a~0=~a~0_In-2147316253, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-2147316253|, ~a$w_buff1~0=~a$w_buff1~0_In-2147316253, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-2147316253, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2147316253} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 11:41:09,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_10|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_10|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_5|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_9|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 11:41:09,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-1758224013 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1758224013 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1758224013| 0) (not .cse0) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite40_Out-1758224013| ~a$w_buff0_used~0_In-1758224013) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1758224013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1758224013} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1758224013|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1758224013, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1758224013} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 11:41:09,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd1~0_In1645358788 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1645358788 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1645358788|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In1645358788 |P0Thread1of1ForFork1_#t~ite5_Out1645358788|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1645358788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1645358788} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1645358788|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1645358788, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1645358788} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 11:41:09,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In1914786999 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1914786999 256) 0)) (.cse3 (= 0 (mod ~a$r_buff1_thd1~0_In1914786999 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In1914786999 256)))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1914786999|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In1914786999 |P0Thread1of1ForFork1_#t~ite6_Out1914786999|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1914786999, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914786999, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1914786999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914786999} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1914786999|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In1914786999, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1914786999, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1914786999, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1914786999} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 11:41:09,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In2094033631 256))) (.cse2 (= ~a$r_buff0_thd1~0_Out2094033631 ~a$r_buff0_thd1~0_In2094033631)) (.cse0 (= 0 (mod ~a$r_buff0_thd1~0_In2094033631 256)))) (or (and (= ~a$r_buff0_thd1~0_Out2094033631 0) (not .cse0) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In2094033631, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In2094033631} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out2094033631|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2094033631, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out2094033631} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 11:41:09,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~a$w_buff1_used~0_In-1485707760 256))) (.cse2 (= 0 (mod ~a$r_buff1_thd1~0_In-1485707760 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In-1485707760 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd1~0_In-1485707760 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-1485707760| ~a$r_buff1_thd1~0_In-1485707760) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite8_Out-1485707760|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1485707760, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1485707760, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1485707760, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1485707760} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1485707760|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1485707760, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1485707760, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1485707760, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1485707760} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 11:41:09,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_25|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 11:41:09,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff1_used~0_In1550855277 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In1550855277 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In1550855277 256) 0)) (.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In1550855277 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite41_Out1550855277| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out1550855277| ~a$w_buff1_used~0_In1550855277) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1550855277, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1550855277, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1550855277, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1550855277} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1550855277, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1550855277, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1550855277, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1550855277, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1550855277|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 11:41:09,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-212030983 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-212030983 256)))) (or (and (= ~a$r_buff0_thd3~0_In-212030983 |P2Thread1of1ForFork0_#t~ite42_Out-212030983|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-212030983|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-212030983, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-212030983} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-212030983, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-212030983, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-212030983|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 11:41:09,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse3 (= (mod ~a$w_buff1_used~0_In1354403389 256) 0)) (.cse2 (= (mod ~a$r_buff1_thd3~0_In1354403389 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In1354403389 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1354403389 256) 0))) (or (and (or .cse0 .cse1) (= ~a$r_buff1_thd3~0_In1354403389 |P2Thread1of1ForFork0_#t~ite43_Out1354403389|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1354403389|)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1354403389, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1354403389, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1354403389, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1354403389} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1354403389|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In1354403389, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1354403389, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1354403389, ~a$w_buff1_used~0=~a$w_buff1_used~0_In1354403389} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 11:41:09,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_28|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 11:41:09,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_24) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 11:41:09,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite48_Out-958573657| |ULTIMATE.start_main_#t~ite47_Out-958573657|)) (.cse1 (= (mod ~a$w_buff1_used~0_In-958573657 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In-958573657 256)))) (or (and .cse0 (not .cse1) (not .cse2) (= ~a$w_buff1~0_In-958573657 |ULTIMATE.start_main_#t~ite47_Out-958573657|)) (and (= ~a~0_In-958573657 |ULTIMATE.start_main_#t~ite47_Out-958573657|) .cse0 (or .cse1 .cse2)))) InVars {~a~0=~a~0_In-958573657, ~a$w_buff1~0=~a$w_buff1~0_In-958573657, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-958573657, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-958573657} OutVars{~a~0=~a~0_In-958573657, ~a$w_buff1~0=~a$w_buff1~0_In-958573657, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-958573657|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-958573657, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-958573657|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-958573657} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 11:41:09,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In-64007978 256))) (.cse1 (= (mod ~a$w_buff0_used~0_In-64007978 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-64007978| ~a$w_buff0_used~0_In-64007978) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out-64007978| 0) (not .cse0) (not .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-64007978, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-64007978} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-64007978, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-64007978|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-64007978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 11:41:09,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In355679719 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In355679719 256) 0)) (.cse2 (= 0 (mod ~a$r_buff1_thd0~0_In355679719 256))) (.cse3 (= 0 (mod ~a$w_buff1_used~0_In355679719 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~a$w_buff1_used~0_In355679719 |ULTIMATE.start_main_#t~ite50_Out355679719|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out355679719|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In355679719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In355679719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In355679719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In355679719} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out355679719|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In355679719, ~a$w_buff0_used~0=~a$w_buff0_used~0_In355679719, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In355679719, ~a$w_buff1_used~0=~a$w_buff1_used~0_In355679719} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 11:41:09,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-510095934 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd0~0_In-510095934 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-510095934|) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd0~0_In-510095934 |ULTIMATE.start_main_#t~ite51_Out-510095934|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-510095934, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-510095934} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-510095934|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-510095934, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-510095934} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 11:41:09,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In331451192 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In331451192 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In331451192 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In331451192 256)))) (or (and (= ~a$r_buff1_thd0~0_In331451192 |ULTIMATE.start_main_#t~ite52_Out331451192|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite52_Out331451192|)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In331451192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In331451192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In331451192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In331451192} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out331451192|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In331451192, ~a$w_buff0_used~0=~a$w_buff0_used~0_In331451192, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In331451192, ~a$w_buff1_used~0=~a$w_buff1_used~0_In331451192} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 11:41:09,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_24) (= v_~x~0_77 2) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_23))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_24, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~x~0=v_~x~0_77, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 11:41:09,403 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_826c759e-a928-49a3-abdf-cdfcf8594ef9/bin/utaipan/witness.graphml [2019-12-07 11:41:09,403 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:41:09,404 INFO L168 Benchmark]: Toolchain (without parser) took 62656.69 ms. Allocated memory was 1.0 GB in the beginning and 6.1 GB in the end (delta: 5.0 GB). Free memory was 940.7 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 11:41:09,404 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:41:09,405 INFO L168 Benchmark]: CACSL2BoogieTranslator took 391.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -114.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:09,405 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.83 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: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:09,405 INFO L168 Benchmark]: Boogie Preprocessor took 26.47 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:09,405 INFO L168 Benchmark]: RCFGBuilder took 423.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.7 MB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:09,405 INFO L168 Benchmark]: TraceAbstraction took 61707.79 ms. Allocated memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 984.7 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-12-07 11:41:09,406 INFO L168 Benchmark]: Witness Printer took 64.84 ms. Allocated memory is still 6.1 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:41:09,407 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 959.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 391.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 94.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -114.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.83 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: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.47 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: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 423.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 984.7 MB in the end (delta: 64.7 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 61707.79 ms. Allocated memory was 1.1 GB in the beginning and 6.1 GB in the end (delta: 4.9 GB). Free memory was 984.7 MB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 64.84 ms. Allocated memory is still 6.1 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7286 VarBasedMoverChecksPositive, 247 VarBasedMoverChecksNegative, 37 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1015, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L782] 3 y = 1 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 61.5s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5606 SDtfs, 8093 SDslu, 13387 SDs, 0 SdLazy, 8743 SolverSat, 486 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 51 SyntacticMatches, 23 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 355229 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1066 NumberOfCodeBlocks, 1066 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 971 ConstructedInterpolants, 0 QuantifiedInterpolants, 141492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...