./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/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 99bc27c223000294db1dc9517da00c75aa65eca8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:13:45,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:13:45,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:13:45,993 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:13:45,993 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:13:45,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:13:45,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:13:45,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:13:45,998 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:13:45,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:13:45,999 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:13:46,000 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:13:46,001 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:13:46,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:13:46,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:13:46,003 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:13:46,003 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:13:46,004 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:13:46,005 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:13:46,007 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:13:46,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:13:46,009 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:13:46,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:13:46,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:13:46,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:13:46,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:13:46,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:13:46,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:13:46,013 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:13:46,014 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:13:46,014 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:13:46,015 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:13:46,015 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:13:46,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:13:46,016 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:13:46,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:13:46,017 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:13:46,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:13:46,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:13:46,018 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:13:46,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:13:46,018 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:13:46,029 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:13:46,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:13:46,030 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:13:46,030 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:13:46,030 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:13:46,030 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:13:46,030 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:13:46,031 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:13:46,031 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:13:46,031 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:13:46,031 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:13:46,031 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:13:46,031 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:13:46,031 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:13:46,032 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:13:46,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:13:46,032 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:13:46,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:13:46,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:13:46,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:13:46,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:13:46,033 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:13:46,033 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:13:46,033 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:13:46,033 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:13:46,033 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:13:46,034 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:13:46,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:13:46,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:13:46,034 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:13:46,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:13:46,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:13:46,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:13:46,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:13:46,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:13:46,035 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:13:46,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:13:46,035 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:13:46,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:13:46,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:13:46,036 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_36768c87-051f-4127-a86f-98c2d3b21dce/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 -> 99bc27c223000294db1dc9517da00c75aa65eca8 [2019-12-07 10:13:46,138 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:13:46,148 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:13:46,151 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:13:46,152 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:13:46,152 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:13:46,153 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc.i [2019-12-07 10:13:46,197 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/data/a5dafdfd5/24a701bb8fe14f31ba99ad450e956344/FLAG3165a14bc [2019-12-07 10:13:46,647 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:13:46,648 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/sv-benchmarks/c/pthread-wmm/rfi010_pso.oepc.i [2019-12-07 10:13:46,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/data/a5dafdfd5/24a701bb8fe14f31ba99ad450e956344/FLAG3165a14bc [2019-12-07 10:13:46,981 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/data/a5dafdfd5/24a701bb8fe14f31ba99ad450e956344 [2019-12-07 10:13:46,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:13:46,987 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:13:46,988 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:13:46,988 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:13:46,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:13:46,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:13:46" (1/1) ... [2019-12-07 10:13:46,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261f166e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:46, skipping insertion in model container [2019-12-07 10:13:46,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:13:46" (1/1) ... [2019-12-07 10:13:47,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:13:47,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:13:47,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:13:47,311 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:13:47,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:13:47,411 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:13:47,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47 WrapperNode [2019-12-07 10:13:47,412 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:13:47,412 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:13:47,412 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:13:47,412 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:13:47,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:13:47,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:13:47,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:13:47,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:13:47,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,462 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,463 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... [2019-12-07 10:13:47,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:13:47,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:13:47,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:13:47,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:13:47,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/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 10:13:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 10:13:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 10:13:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 10:13:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 10:13:47,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 10:13:47,532 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 10:13:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:13:47,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:13:47,534 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 10:13:47,917 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:13:47,917 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 10:13:47,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:13:47 BoogieIcfgContainer [2019-12-07 10:13:47,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:13:47,919 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:13:47,919 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:13:47,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:13:47,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:13:46" (1/3) ... [2019-12-07 10:13:47,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5205806e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:13:47, skipping insertion in model container [2019-12-07 10:13:47,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:13:47" (2/3) ... [2019-12-07 10:13:47,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5205806e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:13:47, skipping insertion in model container [2019-12-07 10:13:47,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:13:47" (3/3) ... [2019-12-07 10:13:47,923 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi010_pso.oepc.i [2019-12-07 10:13:47,929 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 10:13:47,929 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:13:47,935 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 10:13:47,936 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 10:13:47,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,967 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,967 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,982 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,989 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,990 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,991 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,992 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,993 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:47,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 10:13:48,008 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 10:13:48,021 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:13:48,021 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:13:48,021 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:13:48,021 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:13:48,021 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:13:48,021 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:13:48,021 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:13:48,021 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:13:48,032 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 227 transitions [2019-12-07 10:13:48,034 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-07 10:13:48,090 INFO L134 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-07 10:13:48,090 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:13:48,103 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 905 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:13:48,121 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 178 places, 227 transitions [2019-12-07 10:13:48,154 INFO L134 PetriNetUnfolder]: 56/225 cut-off events. [2019-12-07 10:13:48,154 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 10:13:48,160 INFO L76 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 225 events. 56/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 905 event pairs. 6/173 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-07 10:13:48,180 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-07 10:13:48,180 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 10:13:50,934 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-07 10:13:51,165 INFO L206 etLargeBlockEncoding]: Checked pairs total: 121847 [2019-12-07 10:13:51,165 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-07 10:13:51,168 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 102 places, 126 transitions [2019-12-07 10:13:52,407 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 23697 states. [2019-12-07 10:13:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 23697 states. [2019-12-07 10:13:52,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 10:13:52,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:52,412 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 10:13:52,413 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:52,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash 960453199, now seen corresponding path program 1 times [2019-12-07 10:13:52,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:52,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741070833] [2019-12-07 10:13:52,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:52,564 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 10:13:52,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741070833] [2019-12-07 10:13:52,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:52,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 10:13:52,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646651864] [2019-12-07 10:13:52,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:13:52,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:13:52,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:13:52,580 INFO L87 Difference]: Start difference. First operand 23697 states. Second operand 3 states. [2019-12-07 10:13:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:52,852 INFO L93 Difference]: Finished difference Result 23505 states and 84597 transitions. [2019-12-07 10:13:52,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:13:52,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 10:13:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:52,992 INFO L225 Difference]: With dead ends: 23505 [2019-12-07 10:13:52,992 INFO L226 Difference]: Without dead ends: 22000 [2019-12-07 10:13:52,993 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 10:13:53,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22000 states. [2019-12-07 10:13:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22000 to 22000. [2019-12-07 10:13:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22000 states. [2019-12-07 10:13:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22000 states to 22000 states and 79119 transitions. [2019-12-07 10:13:53,918 INFO L78 Accepts]: Start accepts. Automaton has 22000 states and 79119 transitions. Word has length 5 [2019-12-07 10:13:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:53,919 INFO L462 AbstractCegarLoop]: Abstraction has 22000 states and 79119 transitions. [2019-12-07 10:13:53,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:13:53,919 INFO L276 IsEmpty]: Start isEmpty. Operand 22000 states and 79119 transitions. [2019-12-07 10:13:53,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:13:53,922 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:53,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:13:53,922 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:53,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1767797629, now seen corresponding path program 1 times [2019-12-07 10:13:53,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:53,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008908078] [2019-12-07 10:13:53,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:54,010 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 10:13:54,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008908078] [2019-12-07 10:13:54,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:54,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:13:54,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496877984] [2019-12-07 10:13:54,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:13:54,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:54,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:13:54,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:13:54,012 INFO L87 Difference]: Start difference. First operand 22000 states and 79119 transitions. Second operand 4 states. [2019-12-07 10:13:54,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:54,414 INFO L93 Difference]: Finished difference Result 34136 states and 117485 transitions. [2019-12-07 10:13:54,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:13:54,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 10:13:54,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:54,609 INFO L225 Difference]: With dead ends: 34136 [2019-12-07 10:13:54,609 INFO L226 Difference]: Without dead ends: 34120 [2019-12-07 10:13:54,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 10:13:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34120 states. [2019-12-07 10:13:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34120 to 32747. [2019-12-07 10:13:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32747 states. [2019-12-07 10:13:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32747 states to 32747 states and 113702 transitions. [2019-12-07 10:13:55,448 INFO L78 Accepts]: Start accepts. Automaton has 32747 states and 113702 transitions. Word has length 11 [2019-12-07 10:13:55,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:55,448 INFO L462 AbstractCegarLoop]: Abstraction has 32747 states and 113702 transitions. [2019-12-07 10:13:55,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:13:55,448 INFO L276 IsEmpty]: Start isEmpty. Operand 32747 states and 113702 transitions. [2019-12-07 10:13:55,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 10:13:55,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:55,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:13:55,452 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:55,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:55,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1354653160, now seen corresponding path program 1 times [2019-12-07 10:13:55,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:55,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846617815] [2019-12-07 10:13:55,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:55,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:55,504 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 10:13:55,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846617815] [2019-12-07 10:13:55,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:55,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:13:55,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547739030] [2019-12-07 10:13:55,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:13:55,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:55,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:13:55,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:13:55,609 INFO L87 Difference]: Start difference. First operand 32747 states and 113702 transitions. Second operand 4 states. [2019-12-07 10:13:55,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:55,909 INFO L93 Difference]: Finished difference Result 42448 states and 144693 transitions. [2019-12-07 10:13:55,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:13:55,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 10:13:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:55,977 INFO L225 Difference]: With dead ends: 42448 [2019-12-07 10:13:55,977 INFO L226 Difference]: Without dead ends: 42433 [2019-12-07 10:13:55,977 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 10:13:56,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42433 states. [2019-12-07 10:13:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42433 to 37509. [2019-12-07 10:13:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37509 states. [2019-12-07 10:13:56,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37509 states to 37509 states and 129444 transitions. [2019-12-07 10:13:56,892 INFO L78 Accepts]: Start accepts. Automaton has 37509 states and 129444 transitions. Word has length 14 [2019-12-07 10:13:56,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:56,893 INFO L462 AbstractCegarLoop]: Abstraction has 37509 states and 129444 transitions. [2019-12-07 10:13:56,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:13:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 37509 states and 129444 transitions. [2019-12-07 10:13:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:13:56,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:56,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:13:56,896 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:56,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:56,896 INFO L82 PathProgramCache]: Analyzing trace with hash 287658910, now seen corresponding path program 1 times [2019-12-07 10:13:56,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:56,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911544372] [2019-12-07 10:13:56,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:56,945 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 10:13:56,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911544372] [2019-12-07 10:13:56,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:56,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:13:56,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727704293] [2019-12-07 10:13:56,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:13:56,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:56,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:13:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:13:56,946 INFO L87 Difference]: Start difference. First operand 37509 states and 129444 transitions. Second operand 4 states. [2019-12-07 10:13:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:56,976 INFO L93 Difference]: Finished difference Result 5685 states and 16133 transitions. [2019-12-07 10:13:56,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:13:56,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:13:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:56,980 INFO L225 Difference]: With dead ends: 5685 [2019-12-07 10:13:56,980 INFO L226 Difference]: Without dead ends: 3507 [2019-12-07 10:13:56,980 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 10:13:56,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3507 states. [2019-12-07 10:13:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3507 to 3507. [2019-12-07 10:13:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3507 states. [2019-12-07 10:13:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3507 states to 3507 states and 8632 transitions. [2019-12-07 10:13:57,015 INFO L78 Accepts]: Start accepts. Automaton has 3507 states and 8632 transitions. Word has length 16 [2019-12-07 10:13:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:57,015 INFO L462 AbstractCegarLoop]: Abstraction has 3507 states and 8632 transitions. [2019-12-07 10:13:57,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:13:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 3507 states and 8632 transitions. [2019-12-07 10:13:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 10:13:57,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:57,018 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 10:13:57,018 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:57,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:57,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1435016275, now seen corresponding path program 1 times [2019-12-07 10:13:57,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:57,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508203233] [2019-12-07 10:13:57,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:57,089 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 10:13:57,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508203233] [2019-12-07 10:13:57,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:57,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:13:57,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511319567] [2019-12-07 10:13:57,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:13:57,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:57,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:13:57,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:13:57,090 INFO L87 Difference]: Start difference. First operand 3507 states and 8632 transitions. Second operand 5 states. [2019-12-07 10:13:57,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:57,346 INFO L93 Difference]: Finished difference Result 4041 states and 9716 transitions. [2019-12-07 10:13:57,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 10:13:57,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 10:13:57,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:57,350 INFO L225 Difference]: With dead ends: 4041 [2019-12-07 10:13:57,350 INFO L226 Difference]: Without dead ends: 4040 [2019-12-07 10:13:57,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 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 10:13:57,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4040 states. [2019-12-07 10:13:57,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3755. [2019-12-07 10:13:57,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3755 states. [2019-12-07 10:13:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3755 states to 3755 states and 9158 transitions. [2019-12-07 10:13:57,391 INFO L78 Accepts]: Start accepts. Automaton has 3755 states and 9158 transitions. Word has length 28 [2019-12-07 10:13:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:57,391 INFO L462 AbstractCegarLoop]: Abstraction has 3755 states and 9158 transitions. [2019-12-07 10:13:57,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:13:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 3755 states and 9158 transitions. [2019-12-07 10:13:57,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:13:57,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:57,394 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 10:13:57,394 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:57,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:57,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2056109186, now seen corresponding path program 1 times [2019-12-07 10:13:57,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:57,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868046049] [2019-12-07 10:13:57,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:57,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:13:57,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868046049] [2019-12-07 10:13:57,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:57,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:13:57,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827508726] [2019-12-07 10:13:57,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:13:57,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:13:57,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:13:57,434 INFO L87 Difference]: Start difference. First operand 3755 states and 9158 transitions. Second operand 3 states. [2019-12-07 10:13:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:57,450 INFO L93 Difference]: Finished difference Result 3672 states and 8887 transitions. [2019-12-07 10:13:57,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:13:57,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-07 10:13:57,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:57,453 INFO L225 Difference]: With dead ends: 3672 [2019-12-07 10:13:57,453 INFO L226 Difference]: Without dead ends: 3672 [2019-12-07 10:13:57,453 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 10:13:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3672 states. [2019-12-07 10:13:57,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3672 to 3564. [2019-12-07 10:13:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3564 states. [2019-12-07 10:13:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 8662 transitions. [2019-12-07 10:13:57,487 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 8662 transitions. Word has length 33 [2019-12-07 10:13:57,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:57,487 INFO L462 AbstractCegarLoop]: Abstraction has 3564 states and 8662 transitions. [2019-12-07 10:13:57,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:13:57,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 8662 transitions. [2019-12-07 10:13:57,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 10:13:57,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:57,490 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 10:13:57,490 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:57,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:57,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1771548087, now seen corresponding path program 1 times [2019-12-07 10:13:57,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:57,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169986888] [2019-12-07 10:13:57,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:57,539 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 10:13:57,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169986888] [2019-12-07 10:13:57,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:57,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:13:57,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550091920] [2019-12-07 10:13:57,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:13:57,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:13:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:13:57,541 INFO L87 Difference]: Start difference. First operand 3564 states and 8662 transitions. Second operand 4 states. [2019-12-07 10:13:57,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:57,559 INFO L93 Difference]: Finished difference Result 3506 states and 8527 transitions. [2019-12-07 10:13:57,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:13:57,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-07 10:13:57,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:57,564 INFO L225 Difference]: With dead ends: 3506 [2019-12-07 10:13:57,564 INFO L226 Difference]: Without dead ends: 3506 [2019-12-07 10:13:57,564 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 10:13:57,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2019-12-07 10:13:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3506. [2019-12-07 10:13:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2019-12-07 10:13:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 8527 transitions. [2019-12-07 10:13:57,598 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 8527 transitions. Word has length 33 [2019-12-07 10:13:57,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:57,598 INFO L462 AbstractCegarLoop]: Abstraction has 3506 states and 8527 transitions. [2019-12-07 10:13:57,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:13:57,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 8527 transitions. [2019-12-07 10:13:57,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:13:57,602 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:57,602 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 10:13:57,602 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:57,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1323120657, now seen corresponding path program 1 times [2019-12-07 10:13:57,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:57,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152775445] [2019-12-07 10:13:57,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:57,669 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 10:13:57,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152775445] [2019-12-07 10:13:57,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:57,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:13:57,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734882012] [2019-12-07 10:13:57,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 10:13:57,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 10:13:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 10:13:57,671 INFO L87 Difference]: Start difference. First operand 3506 states and 8527 transitions. Second operand 6 states. [2019-12-07 10:13:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:57,749 INFO L93 Difference]: Finished difference Result 5804 states and 14267 transitions. [2019-12-07 10:13:57,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 10:13:57,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 10:13:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:57,754 INFO L225 Difference]: With dead ends: 5804 [2019-12-07 10:13:57,754 INFO L226 Difference]: Without dead ends: 4532 [2019-12-07 10:13:57,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:13:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4532 states. [2019-12-07 10:13:57,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4532 to 4532. [2019-12-07 10:13:57,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4532 states. [2019-12-07 10:13:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4532 states to 4532 states and 11282 transitions. [2019-12-07 10:13:57,801 INFO L78 Accepts]: Start accepts. Automaton has 4532 states and 11282 transitions. Word has length 42 [2019-12-07 10:13:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:57,802 INFO L462 AbstractCegarLoop]: Abstraction has 4532 states and 11282 transitions. [2019-12-07 10:13:57,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 10:13:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 4532 states and 11282 transitions. [2019-12-07 10:13:57,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 10:13:57,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:57,807 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] [2019-12-07 10:13:57,807 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:57,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash 551589791, now seen corresponding path program 1 times [2019-12-07 10:13:57,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:57,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641138270] [2019-12-07 10:13:57,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:57,879 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 10:13:57,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641138270] [2019-12-07 10:13:57,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:57,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:13:57,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039532996] [2019-12-07 10:13:57,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 10:13:57,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:57,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 10:13:57,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 10:13:57,881 INFO L87 Difference]: Start difference. First operand 4532 states and 11282 transitions. Second operand 5 states. [2019-12-07 10:13:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:57,916 INFO L93 Difference]: Finished difference Result 3247 states and 8290 transitions. [2019-12-07 10:13:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:13:57,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-07 10:13:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:57,920 INFO L225 Difference]: With dead ends: 3247 [2019-12-07 10:13:57,920 INFO L226 Difference]: Without dead ends: 3076 [2019-12-07 10:13:57,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:13:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2019-12-07 10:13:57,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3049. [2019-12-07 10:13:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3049 states. [2019-12-07 10:13:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3049 states to 3049 states and 7868 transitions. [2019-12-07 10:13:57,961 INFO L78 Accepts]: Start accepts. Automaton has 3049 states and 7868 transitions. Word has length 43 [2019-12-07 10:13:57,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:57,961 INFO L462 AbstractCegarLoop]: Abstraction has 3049 states and 7868 transitions. [2019-12-07 10:13:57,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 10:13:57,961 INFO L276 IsEmpty]: Start isEmpty. Operand 3049 states and 7868 transitions. [2019-12-07 10:13:57,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:13:57,965 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:57,965 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] [2019-12-07 10:13:57,965 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:57,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:57,965 INFO L82 PathProgramCache]: Analyzing trace with hash -2085818891, now seen corresponding path program 1 times [2019-12-07 10:13:57,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:57,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660284464] [2019-12-07 10:13:57,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:58,090 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 10:13:58,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660284464] [2019-12-07 10:13:58,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:58,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:13:58,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185851842] [2019-12-07 10:13:58,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:13:58,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:58,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:13:58,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:13:58,091 INFO L87 Difference]: Start difference. First operand 3049 states and 7868 transitions. Second operand 4 states. [2019-12-07 10:13:58,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:58,118 INFO L93 Difference]: Finished difference Result 3437 states and 8753 transitions. [2019-12-07 10:13:58,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:13:58,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 10:13:58,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:58,120 INFO L225 Difference]: With dead ends: 3437 [2019-12-07 10:13:58,120 INFO L226 Difference]: Without dead ends: 2388 [2019-12-07 10:13:58,120 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 10:13:58,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2388 states. [2019-12-07 10:13:58,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2388 to 2047. [2019-12-07 10:13:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-12-07 10:13:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 5146 transitions. [2019-12-07 10:13:58,141 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 5146 transitions. Word has length 59 [2019-12-07 10:13:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:58,141 INFO L462 AbstractCegarLoop]: Abstraction has 2047 states and 5146 transitions. [2019-12-07 10:13:58,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:13:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 5146 transitions. [2019-12-07 10:13:58,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:13:58,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:58,144 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] [2019-12-07 10:13:58,144 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:58,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:58,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1617268735, now seen corresponding path program 2 times [2019-12-07 10:13:58,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:58,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85094698] [2019-12-07 10:13:58,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:58,217 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 10:13:58,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85094698] [2019-12-07 10:13:58,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:58,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 10:13:58,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717834336] [2019-12-07 10:13:58,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 10:13:58,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:58,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 10:13:58,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 10:13:58,219 INFO L87 Difference]: Start difference. First operand 2047 states and 5146 transitions. Second operand 7 states. [2019-12-07 10:13:58,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:58,339 INFO L93 Difference]: Finished difference Result 4184 states and 10468 transitions. [2019-12-07 10:13:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 10:13:58,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-07 10:13:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:58,341 INFO L225 Difference]: With dead ends: 4184 [2019-12-07 10:13:58,341 INFO L226 Difference]: Without dead ends: 2566 [2019-12-07 10:13:58,342 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-07 10:13:58,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2019-12-07 10:13:58,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2111. [2019-12-07 10:13:58,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-12-07 10:13:58,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 5246 transitions. [2019-12-07 10:13:58,362 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 5246 transitions. Word has length 59 [2019-12-07 10:13:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:58,362 INFO L462 AbstractCegarLoop]: Abstraction has 2111 states and 5246 transitions. [2019-12-07 10:13:58,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 10:13:58,363 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 5246 transitions. [2019-12-07 10:13:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:13:58,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:58,365 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] [2019-12-07 10:13:58,365 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:58,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:58,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1629639837, now seen corresponding path program 1 times [2019-12-07 10:13:58,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:58,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116330847] [2019-12-07 10:13:58,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:58,572 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 10:13:58,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116330847] [2019-12-07 10:13:58,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:58,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:13:58,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111077172] [2019-12-07 10:13:58,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:13:58,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:58,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:13:58,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:13:58,574 INFO L87 Difference]: Start difference. First operand 2111 states and 5246 transitions. Second operand 10 states. [2019-12-07 10:13:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:13:59,627 INFO L93 Difference]: Finished difference Result 5677 states and 13872 transitions. [2019-12-07 10:13:59,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 10:13:59,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-12-07 10:13:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:13:59,634 INFO L225 Difference]: With dead ends: 5677 [2019-12-07 10:13:59,634 INFO L226 Difference]: Without dead ends: 5255 [2019-12-07 10:13:59,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-12-07 10:13:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2019-12-07 10:13:59,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4474. [2019-12-07 10:13:59,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4474 states. [2019-12-07 10:13:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 11265 transitions. [2019-12-07 10:13:59,689 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 11265 transitions. Word has length 60 [2019-12-07 10:13:59,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:13:59,689 INFO L462 AbstractCegarLoop]: Abstraction has 4474 states and 11265 transitions. [2019-12-07 10:13:59,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:13:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 11265 transitions. [2019-12-07 10:13:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:13:59,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:13:59,694 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] [2019-12-07 10:13:59,694 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:13:59,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:13:59,694 INFO L82 PathProgramCache]: Analyzing trace with hash -650863359, now seen corresponding path program 2 times [2019-12-07 10:13:59,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:13:59,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534377797] [2019-12-07 10:13:59,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:13:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:13:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:13:59,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534377797] [2019-12-07 10:13:59,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:13:59,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:13:59,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659819387] [2019-12-07 10:13:59,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 10:13:59,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:13:59,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 10:13:59,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 10:13:59,838 INFO L87 Difference]: Start difference. First operand 4474 states and 11265 transitions. Second operand 11 states. [2019-12-07 10:14:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:14:00,331 INFO L93 Difference]: Finished difference Result 9954 states and 24281 transitions. [2019-12-07 10:14:00,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 10:14:00,331 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 60 [2019-12-07 10:14:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:14:00,336 INFO L225 Difference]: With dead ends: 9954 [2019-12-07 10:14:00,336 INFO L226 Difference]: Without dead ends: 6679 [2019-12-07 10:14:00,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2019-12-07 10:14:00,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2019-12-07 10:14:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 5364. [2019-12-07 10:14:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5364 states. [2019-12-07 10:14:00,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 13374 transitions. [2019-12-07 10:14:00,392 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 13374 transitions. Word has length 60 [2019-12-07 10:14:00,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:14:00,392 INFO L462 AbstractCegarLoop]: Abstraction has 5364 states and 13374 transitions. [2019-12-07 10:14:00,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 10:14:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 13374 transitions. [2019-12-07 10:14:00,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:14:00,398 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:14:00,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:14:00,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:14:00,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:14:00,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2030008483, now seen corresponding path program 3 times [2019-12-07 10:14:00,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:14:00,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450776442] [2019-12-07 10:14:00,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:14:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:14:00,435 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 10:14:00,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450776442] [2019-12-07 10:14:00,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:14:00,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:14:00,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745859915] [2019-12-07 10:14:00,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:14:00,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:14:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:14:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:14:00,437 INFO L87 Difference]: Start difference. First operand 5364 states and 13374 transitions. Second operand 4 states. [2019-12-07 10:14:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:14:00,460 INFO L93 Difference]: Finished difference Result 5725 states and 14171 transitions. [2019-12-07 10:14:00,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:14:00,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 10:14:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:14:00,461 INFO L225 Difference]: With dead ends: 5725 [2019-12-07 10:14:00,461 INFO L226 Difference]: Without dead ends: 434 [2019-12-07 10:14:00,461 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 10:14:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-12-07 10:14:00,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2019-12-07 10:14:00,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-12-07 10:14:00,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 952 transitions. [2019-12-07 10:14:00,492 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 952 transitions. Word has length 60 [2019-12-07 10:14:00,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:14:00,492 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 952 transitions. [2019-12-07 10:14:00,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:14:00,493 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 952 transitions. [2019-12-07 10:14:00,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:14:00,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:14:00,493 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] [2019-12-07 10:14:00,493 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:14:00,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:14:00,494 INFO L82 PathProgramCache]: Analyzing trace with hash -814810737, now seen corresponding path program 4 times [2019-12-07 10:14:00,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:14:00,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069838380] [2019-12-07 10:14:00,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:14:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:14:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 10:14:00,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069838380] [2019-12-07 10:14:00,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:14:00,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 10:14:00,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868974595] [2019-12-07 10:14:00,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 10:14:00,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:14:00,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 10:14:00,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-07 10:14:00,694 INFO L87 Difference]: Start difference. First operand 434 states and 952 transitions. Second operand 13 states. [2019-12-07 10:14:01,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:14:01,850 INFO L93 Difference]: Finished difference Result 1654 states and 3490 transitions. [2019-12-07 10:14:01,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 10:14:01,850 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-07 10:14:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:14:01,852 INFO L225 Difference]: With dead ends: 1654 [2019-12-07 10:14:01,852 INFO L226 Difference]: Without dead ends: 1341 [2019-12-07 10:14:01,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2019-12-07 10:14:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-12-07 10:14:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 638. [2019-12-07 10:14:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-12-07 10:14:01,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1407 transitions. [2019-12-07 10:14:01,865 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1407 transitions. Word has length 60 [2019-12-07 10:14:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:14:01,865 INFO L462 AbstractCegarLoop]: Abstraction has 638 states and 1407 transitions. [2019-12-07 10:14:01,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 10:14:01,866 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1407 transitions. [2019-12-07 10:14:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 10:14:01,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:14:01,867 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] [2019-12-07 10:14:01,867 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 10:14:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:14:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1249946427, now seen corresponding path program 5 times [2019-12-07 10:14:01,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:14:01,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553180805] [2019-12-07 10:14:01,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:14:01,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:14:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 10:14:01,942 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 10:14:01,942 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 10:14:01,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1765~0.base_19| 4)) (= |v_ULTIMATE.start_main_~#t1765~0.offset_14| 0) (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff0_thd2~0_427) (= 0 v_~__unbuffered_p0_EAX~0_40) (= v_~y$r_buff0_thd0~0_102 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1765~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1765~0.base_19|) |v_ULTIMATE.start_main_~#t1765~0.offset_14| 0))) (= 0 v_~y$w_buff0~0_194) (= v_~main$tmp_guard0~0_27 0) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1765~0.base_19|) (= v_~y$r_buff1_thd1~0_255 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1765~0.base_19|) 0) (= v_~y$flush_delayed~0_195 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_242 0) (= 0 v_~weak$$choice0~0_161) (= v_~y$r_buff0_thd1~0_290 0) (= v_~main$tmp_guard1~0_32 0) (= v_~x~0_50 0) (= 0 v_~__unbuffered_cnt~0_49) (= |v_#NULL.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1765~0.base_19| 1) |v_#valid_45|) (= v_~y$w_buff1~0_196 0) (= v_~y$w_buff0_used~0_766 0) (= v_~y$r_buff1_thd0~0_184 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EBX~0_32 0) (= v_~y~0_216 0) (= v_~y$w_buff1_used~0_425 0) (= 0 v_~y$r_buff1_thd2~0_284) (= v_~y$mem_tmp~0_173 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_15|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1766~0.base=|v_ULTIMATE.start_main_~#t1766~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_255, ~y$mem_tmp~0=v_~y$mem_tmp~0_173, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_194, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_195, #length=|v_#length_17|, ~y~0=v_~y~0_216, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_129|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_84|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_284, ~weak$$choice0~0=v_~weak$$choice0~0_161, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_198|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_30|, ULTIMATE.start_main_~#t1766~0.offset=|v_ULTIMATE.start_main_~#t1766~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_102, #valid=|v_#valid_45|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_427, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1765~0.offset=|v_ULTIMATE.start_main_~#t1765~0.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_242, ULTIMATE.start_main_~#t1765~0.base=|v_ULTIMATE.start_main_~#t1765~0.base_19|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_184, ~x~0=v_~x~0_50, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_425} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t1766~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t1766~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1765~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1765~0.base, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:14:01,945 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-1-->L812: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1766~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1766~0.base_11|)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1766~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1766~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1766~0.offset_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1766~0.base_11| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1766~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1766~0.base_11|) |v_ULTIMATE.start_main_~#t1766~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1766~0.base=|v_ULTIMATE.start_main_~#t1766~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1766~0.offset=|v_ULTIMATE.start_main_~#t1766~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1766~0.base, ULTIMATE.start_main_~#t1766~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:14:01,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_~y$w_buff0_used~0_154 1) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~y$w_buff0~0_41) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= v_~y$w_buff1_used~0_78 v_~y$w_buff0_used~0_155) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~y$w_buff0~0_42 v_~y$w_buff1~0_30) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) (not (= 0 (mod v_~y$w_buff1_used~0_78 256))))) 1 0)) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_42, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_30, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_41, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:14:01,946 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In65091676 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In65091676 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out65091676| |P1Thread1of1ForFork1_#t~ite28_Out65091676|))) (or (and (or .cse0 .cse1) (= ~y$w_buff1~0_In65091676 |P1Thread1of1ForFork1_#t~ite28_Out65091676|) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff0~0_In65091676 |P1Thread1of1ForFork1_#t~ite28_Out65091676|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In65091676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65091676, ~y$w_buff0~0=~y$w_buff0~0_In65091676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65091676} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out65091676|, ~y$w_buff1~0=~y$w_buff1~0_In65091676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65091676, ~y$w_buff0~0=~y$w_buff0~0_In65091676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65091676, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out65091676|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:14:01,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd2~0_142 v_~y$r_buff0_thd2~0_141)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 10:14:01,949 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-962178325 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-962178325 |P1Thread1of1ForFork1_#t~ite48_Out-962178325|)) (and (= ~y~0_In-962178325 |P1Thread1of1ForFork1_#t~ite48_Out-962178325|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-962178325, ~y$flush_delayed~0=~y$flush_delayed~0_In-962178325, ~y~0=~y~0_In-962178325} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-962178325, ~y$flush_delayed~0=~y$flush_delayed~0_In-962178325, ~y~0=~y~0_In-962178325, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-962178325|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:14:01,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In964982676 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out964982676| ~y$mem_tmp~0_In964982676)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out964982676| ~y~0_In964982676) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In964982676, ~y$flush_delayed~0=~y$flush_delayed~0_In964982676, ~y~0=~y~0_In964982676} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In964982676, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out964982676|, ~y$flush_delayed~0=~y$flush_delayed~0_In964982676, ~y~0=~y~0_In964982676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:14:01,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L744-2-->P0EXIT: Formula: (and (= v_~y$flush_delayed~0_168 0) (= v_~y~0_183 |v_P0Thread1of1ForFork0_#t~ite25_30|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_29|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_168, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:14:01,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1592712840 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1592712840 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out1592712840| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out1592712840| ~y$w_buff0_used~0_In1592712840) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1592712840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1592712840} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1592712840, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1592712840|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1592712840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:14:01,954 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In113077870 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In113077870 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In113077870 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In113077870 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out113077870| ~y$w_buff1_used~0_In113077870) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out113077870| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In113077870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In113077870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In113077870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113077870} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In113077870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In113077870, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out113077870|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In113077870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113077870} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:14:01,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In144762743 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In144762743 256))) (.cse2 (= ~y$r_buff0_thd2~0_Out144762743 ~y$r_buff0_thd2~0_In144762743))) (or (and (= ~y$r_buff0_thd2~0_Out144762743 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In144762743, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In144762743} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out144762743|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In144762743, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out144762743} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:14:01,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1494292234 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1494292234 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1494292234 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1494292234 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1494292234 |P1Thread1of1ForFork1_#t~ite54_Out-1494292234|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-1494292234|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1494292234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494292234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1494292234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494292234} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1494292234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494292234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1494292234, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1494292234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494292234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:14:01,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= v_~y$r_buff1_thd2~0_210 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_210, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:14:01,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_203 256)) (= (mod v_~y$r_buff0_thd0~0_26 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:14:01,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1043152244 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1043152244 256) 0))) (or (and (= ~y~0_In1043152244 |ULTIMATE.start_main_#t~ite57_Out1043152244|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In1043152244 |ULTIMATE.start_main_#t~ite57_Out1043152244|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1043152244, ~y~0=~y~0_In1043152244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1043152244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1043152244} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1043152244, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1043152244|, ~y~0=~y~0_In1043152244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1043152244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1043152244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:14:01,955 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_45 |v_ULTIMATE.start_main_#t~ite57_16|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_26|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 10:14:01,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-206888361 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-206888361 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-206888361|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-206888361 |ULTIMATE.start_main_#t~ite59_Out-206888361|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-206888361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-206888361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-206888361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-206888361, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-206888361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:14:01,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-47250549 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-47250549 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-47250549 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-47250549 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite60_Out-47250549|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-47250549 |ULTIMATE.start_main_#t~ite60_Out-47250549|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-47250549, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-47250549, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47250549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47250549} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-47250549|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-47250549, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-47250549, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47250549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47250549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:14:01,956 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In289030239 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In289030239 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In289030239 |ULTIMATE.start_main_#t~ite61_Out289030239|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out289030239| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In289030239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289030239} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out289030239|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In289030239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289030239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:14:01,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In557023375 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In557023375 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In557023375 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In557023375 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out557023375| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In557023375 |ULTIMATE.start_main_#t~ite62_Out557023375|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In557023375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In557023375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In557023375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In557023375} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out557023375|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In557023375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In557023375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In557023375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In557023375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:14:01,957 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_32) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y$r_buff1_thd0~0_164 |v_ULTIMATE.start_main_#t~ite62_41|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:14:02,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 10:14:02 BasicIcfg [2019-12-07 10:14:02,011 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 10:14:02,011 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 10:14:02,011 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 10:14:02,011 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 10:14:02,012 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:13:47" (3/4) ... [2019-12-07 10:14:02,013 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 10:14:02,013 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1765~0.base_19| 4)) (= |v_ULTIMATE.start_main_~#t1765~0.offset_14| 0) (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$r_buff0_thd2~0_427) (= 0 v_~__unbuffered_p0_EAX~0_40) (= v_~y$r_buff0_thd0~0_102 0) (= 0 v_~__unbuffered_p1_EAX~0_40) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1765~0.base_19| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1765~0.base_19|) |v_ULTIMATE.start_main_~#t1765~0.offset_14| 0))) (= 0 v_~y$w_buff0~0_194) (= v_~main$tmp_guard0~0_27 0) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1765~0.base_19|) (= v_~y$r_buff1_thd1~0_255 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1765~0.base_19|) 0) (= v_~y$flush_delayed~0_195 0) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_#NULL.base_4|) (= v_~weak$$choice2~0_242 0) (= 0 v_~weak$$choice0~0_161) (= v_~y$r_buff0_thd1~0_290 0) (= v_~main$tmp_guard1~0_32 0) (= v_~x~0_50 0) (= 0 v_~__unbuffered_cnt~0_49) (= |v_#NULL.offset_4| 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1765~0.base_19| 1) |v_#valid_45|) (= v_~y$w_buff1~0_196 0) (= v_~y$w_buff0_used~0_766 0) (= v_~y$r_buff1_thd0~0_184 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~__unbuffered_p1_EBX~0_32 0) (= v_~y~0_216 0) (= v_~y$w_buff1_used~0_425 0) (= 0 v_~y$r_buff1_thd2~0_284) (= v_~y$mem_tmp~0_173 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_766, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_15|, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_32, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_~#t1766~0.base=|v_ULTIMATE.start_main_~#t1766~0.base_17|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_255, ~y$mem_tmp~0=v_~y$mem_tmp~0_173, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_194, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_290, ~y$flush_delayed~0=v_~y$flush_delayed~0_195, #length=|v_#length_17|, ~y~0=v_~y~0_216, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_129|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_84|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_61|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_284, ~weak$$choice0~0=v_~weak$$choice0~0_161, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_198|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_30|, ULTIMATE.start_main_~#t1766~0.offset=|v_ULTIMATE.start_main_~#t1766~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_196, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_102, #valid=|v_#valid_45|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_427, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1765~0.offset=|v_ULTIMATE.start_main_~#t1765~0.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_242, ULTIMATE.start_main_~#t1765~0.base=|v_ULTIMATE.start_main_~#t1765~0.base_19|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_184, ~x~0=v_~x~0_50, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_425} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ULTIMATE.start_main_~#t1766~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t1766~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t1765~0.offset, ~__unbuffered_cnt~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1765~0.base, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:14:02,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-1-->L812: Formula: (and (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1766~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1766~0.base_11|)) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1766~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1766~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t1766~0.offset_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1766~0.base_11| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1766~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1766~0.base_11|) |v_ULTIMATE.start_main_~#t1766~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1766~0.base=|v_ULTIMATE.start_main_~#t1766~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1766~0.offset=|v_ULTIMATE.start_main_~#t1766~0.offset_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1766~0.base, ULTIMATE.start_main_~#t1766~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 10:14:02,014 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] P1ENTRY-->L5-3: Formula: (and (= v_~y$w_buff0_used~0_154 1) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= 1 v_~y$w_buff0~0_41) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|) (= v_~y$w_buff1_used~0_78 v_~y$w_buff0_used~0_155) (= |v_P1Thread1of1ForFork1_#in~arg.offset_8| v_P1Thread1of1ForFork1_~arg.offset_6) (= v_~y$w_buff0~0_42 v_~y$w_buff1~0_30) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= 0 (mod v_~y$w_buff0_used~0_154 256))) (not (= 0 (mod v_~y$w_buff1_used~0_78 256))))) 1 0)) (= v_P1Thread1of1ForFork1_~arg.base_6 |v_P1Thread1of1ForFork1_#in~arg.base_8|)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_155, ~y$w_buff0~0=v_~y$w_buff0~0_42, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_8, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_154, ~y$w_buff1~0=v_~y$w_buff1~0_30, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_6|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_6, ~y$w_buff0~0=v_~y$w_buff0~0_41, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_8|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_8|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_78} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 10:14:02,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] L772-2-->L772-5: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In65091676 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In65091676 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out65091676| |P1Thread1of1ForFork1_#t~ite28_Out65091676|))) (or (and (or .cse0 .cse1) (= ~y$w_buff1~0_In65091676 |P1Thread1of1ForFork1_#t~ite28_Out65091676|) .cse2) (and (not .cse1) (not .cse0) (= ~y$w_buff0~0_In65091676 |P1Thread1of1ForFork1_#t~ite28_Out65091676|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In65091676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65091676, ~y$w_buff0~0=~y$w_buff0~0_In65091676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65091676} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out65091676|, ~y$w_buff1~0=~y$w_buff1~0_In65091676, ~y$w_buff0_used~0=~y$w_buff0_used~0_In65091676, ~y$w_buff0~0=~y$w_buff0~0_In65091676, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In65091676, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out65091676|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 10:14:02,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [899] [899] L777-->L778: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_69 256))) (= v_~y$r_buff0_thd2~0_142 v_~y$r_buff0_thd2~0_141)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_142, ~weak$$choice2~0=v_~weak$$choice2~0_69} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_6|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_141, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_11|, ~weak$$choice2~0=v_~weak$$choice2~0_69} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 10:14:02,017 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-962178325 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-962178325 |P1Thread1of1ForFork1_#t~ite48_Out-962178325|)) (and (= ~y~0_In-962178325 |P1Thread1of1ForFork1_#t~ite48_Out-962178325|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-962178325, ~y$flush_delayed~0=~y$flush_delayed~0_In-962178325, ~y~0=~y~0_In-962178325} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-962178325, ~y$flush_delayed~0=~y$flush_delayed~0_In-962178325, ~y~0=~y~0_In-962178325, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-962178325|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 10:14:02,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [918] [918] L744-->L744-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In964982676 256) 0))) (or (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out964982676| ~y$mem_tmp~0_In964982676)) (and (= |P0Thread1of1ForFork0_#t~ite25_Out964982676| ~y~0_In964982676) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In964982676, ~y$flush_delayed~0=~y$flush_delayed~0_In964982676, ~y~0=~y~0_In964982676} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In964982676, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out964982676|, ~y$flush_delayed~0=~y$flush_delayed~0_In964982676, ~y~0=~y~0_In964982676} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 10:14:02,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [960] [960] L744-2-->P0EXIT: Formula: (and (= v_~y$flush_delayed~0_168 0) (= v_~y~0_183 |v_P0Thread1of1ForFork0_#t~ite25_30|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_36 1) v_~__unbuffered_cnt~0_35)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_36} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_29|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_168, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_35, ~y~0=v_~y~0_183} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 10:14:02,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1592712840 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1592712840 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite51_Out1592712840| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out1592712840| ~y$w_buff0_used~0_In1592712840) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1592712840, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1592712840} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1592712840, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out1592712840|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1592712840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 10:14:02,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [919] [919] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In113077870 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In113077870 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In113077870 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In113077870 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite52_Out113077870| ~y$w_buff1_used~0_In113077870) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out113077870| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In113077870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In113077870, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In113077870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113077870} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In113077870, ~y$w_buff0_used~0=~y$w_buff0_used~0_In113077870, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out113077870|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In113077870, ~y$w_buff1_used~0=~y$w_buff1_used~0_In113077870} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 10:14:02,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [933] [933] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In144762743 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In144762743 256))) (.cse2 (= ~y$r_buff0_thd2~0_Out144762743 ~y$r_buff0_thd2~0_In144762743))) (or (and (= ~y$r_buff0_thd2~0_Out144762743 0) (not .cse0) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In144762743, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In144762743} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out144762743|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In144762743, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out144762743} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 10:14:02,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [910] [910] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1494292234 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1494292234 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1494292234 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-1494292234 256)))) (or (and (= ~y$r_buff1_thd2~0_In-1494292234 |P1Thread1of1ForFork1_#t~ite54_Out-1494292234|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-1494292234|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1494292234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494292234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1494292234, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494292234} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1494292234, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494292234, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1494292234, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1494292234|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1494292234} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 10:14:02,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_26 1) v_~__unbuffered_cnt~0_25) (= v_~y$r_buff1_thd2~0_210 |v_P1Thread1of1ForFork1_#t~ite54_18|) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_26, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_18|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_210, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_25, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_17|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 10:14:02,023 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [881] [881] L816-->L818-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$w_buff0_used~0_203 256)) (= (mod v_~y$r_buff0_thd0~0_26 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_203, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 10:14:02,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L818-2-->L818-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In1043152244 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In1043152244 256) 0))) (or (and (= ~y~0_In1043152244 |ULTIMATE.start_main_#t~ite57_Out1043152244|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In1043152244 |ULTIMATE.start_main_#t~ite57_Out1043152244|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1043152244, ~y~0=~y~0_In1043152244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1043152244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1043152244} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1043152244, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out1043152244|, ~y~0=~y~0_In1043152244, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1043152244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1043152244} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-07 10:14:02,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L818-4-->L819: Formula: (= v_~y~0_45 |v_ULTIMATE.start_main_#t~ite57_16|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_16|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_26|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_15|, ~y~0=v_~y~0_45} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-07 10:14:02,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-206888361 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-206888361 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite59_Out-206888361|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-206888361 |ULTIMATE.start_main_#t~ite59_Out-206888361|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-206888361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-206888361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-206888361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-206888361, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-206888361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 10:14:02,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [911] [911] L820-->L820-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-47250549 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-47250549 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-47250549 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-47250549 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite60_Out-47250549|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-47250549 |ULTIMATE.start_main_#t~ite60_Out-47250549|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-47250549, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-47250549, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47250549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47250549} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-47250549|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-47250549, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-47250549, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-47250549, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-47250549} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-07 10:14:02,024 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In289030239 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In289030239 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In289030239 |ULTIMATE.start_main_#t~ite61_Out289030239|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite61_Out289030239| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In289030239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289030239} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out289030239|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In289030239, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In289030239} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 10:14:02,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [920] [920] L822-->L822-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In557023375 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In557023375 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In557023375 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In557023375 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite62_Out557023375| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In557023375 |ULTIMATE.start_main_#t~ite62_Out557023375|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In557023375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In557023375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In557023375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In557023375} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out557023375|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In557023375, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In557023375, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In557023375, ~y$w_buff1_used~0=~y$w_buff1_used~0_In557023375} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 10:14:02,025 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [969] [969] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (ite (= (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_32) (= 1 v_~__unbuffered_p1_EAX~0_23) (= v_~__unbuffered_p1_EBX~0_23 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y$r_buff1_thd0~0_164 |v_ULTIMATE.start_main_#t~ite62_41|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_41|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_40|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_32, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_23, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_164, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 10:14:02,084 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_36768c87-051f-4127-a86f-98c2d3b21dce/bin/utaipan/witness.graphml [2019-12-07 10:14:02,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 10:14:02,085 INFO L168 Benchmark]: Toolchain (without parser) took 15098.86 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 933.8 MB). Free memory was 942.4 MB in the beginning and 1.2 GB in the end (delta: -300.0 MB). Peak memory consumption was 633.8 MB. Max. memory is 11.5 GB. [2019-12-07 10:14:02,085 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 10:14:02,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:14:02,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2019-12-07 10:14:02,086 INFO L168 Benchmark]: Boogie Preprocessor took 26.18 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2019-12-07 10:14:02,086 INFO L168 Benchmark]: RCFGBuilder took 439.24 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: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2019-12-07 10:14:02,087 INFO L168 Benchmark]: TraceAbstraction took 14092.06 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 833.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -263.5 MB). Peak memory consumption was 569.6 MB. Max. memory is 11.5 GB. [2019-12-07 10:14:02,087 INFO L168 Benchmark]: Witness Printer took 72.88 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2019-12-07 10:14:02,089 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 962.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -130.3 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.18 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.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 439.24 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: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14092.06 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 833.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -263.5 MB). Peak memory consumption was 569.6 MB. Max. memory is 11.5 GB. * Witness Printer took 72.88 ms. Allocated memory is still 2.0 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.1s, 178 ProgramPointsBefore, 102 ProgramPointsAfterwards, 227 TransitionsBefore, 126 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 28 ChoiceCompositions, 9537 VarBasedMoverChecksPositive, 264 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 279 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 121847 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t1765, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] FCALL, FORK 0 pthread_create(&t1766, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L763] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L764] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = (_Bool)1 [L768] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L769] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L770] 2 y$flush_delayed = weak$$choice2 [L771] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L773] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L774] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L775] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L776] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y = y$flush_delayed ? y$mem_tmp : y [L781] 2 y$flush_delayed = (_Bool)0 [L784] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 x = 1 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 y$flush_delayed = weak$$choice2 [L735] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L737] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L738] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L739] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 172 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.9s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3140 SDtfs, 5510 SDslu, 7854 SDs, 0 SdLazy, 3753 SolverSat, 236 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 22 SyntacticMatches, 8 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 449 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37509occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 10312 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 643 NumberOfCodeBlocks, 643 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 568 ConstructedInterpolants, 0 QuantifiedInterpolants, 188610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...